|
计算机应用 2006
Fast algorithm for integer 2D-DCT based on polynomial transform
|
Abstract:
A polynomial transform-based fast algorithm for integer 2D Discrete Cosine Transform(2D-DCT) was proposed.The 2D-DCT was transformed to some 1D-DCT and summing calculation by polynomial transform,so the computational complexity was reduced.The integer DCT was implemented by lifting matrix to promote efficiency,and the transformed signal could be reconstructed completely.