CORDIC-Based Unified Architectures for Computation of DCT/IDCT/DST/IDST

In this paper, CORDIC (coordinate rotation digital computer)-based Cooley-Tukey fast Fourier transform (FFT)-like algorithms for power-of-two point discrete cosine transform/discrete sine transform/inverse discrete cosine transform/inverse discrete sine transform are proposed and their corresponding unified architectures are developed by fully reusing the unique two basic processing elements. The proposed algorithms have some distinguished advantages, such as FFT-like regular data flow, unique post-scaling factor, and arithmetic-sequence rotation angles. The developed unified architectures can compute four different transforms by simple routing the data flow according to the specific transform without feeding different transform coefficients or different transform kernels. The unfolding technique is used to overcome the problem of difficult to realize pipeline that occur in iterative CORDIC algorithms. Compared to existing unified architectures, the proposed architectures have a superior performance in terms of hardware complexity, control complexity, throughput, scalability, modularity, and pipelinability.