Implementation of Efficient CORDIC Array Structure Based Fast RADIX-2 DCT Algorithm

A modern coordinate rotation digital computer (CORDIC)-based fast radix-2 algorithm for computation of discrete cosine transformation DCT). The planned algorithm has some distinguish advantages, such as Cooley-Tukey fast Fourier transformation (FFT)-like regular data flow, uniform post-scaling factor, in-place computation and arithmetic sequence rotation angles. Compared to existing DCT algorithms, this planned algorithm has lower computational complexity Furthermore; the proposed algorithm is highly scalable, modular, regular, and suitable for pipelined VLSI implementation. The projected algorithm can generate the next higher-order DCT from two identical lower-order DCTs. By using the unfolding CORDIC technique, this algorithm can overcome the problem of difficult to realize pipeline that in conventional CORDIC algorithms. This results in a pipeline and high-speed VLSI implementation. Compared to existing DCTs, the utilization of input was reduced about 40% and hence the accuracy of the output was increased over 50% so the output is highly scalable and it also provides an easy way to implement the unified architecture for DCTs and IDCTs using the orthogonal property.