CORDIC BASED FAST RADIX-2 DCT ALGORITHM

Abstract: This paper proposes an algorithm for computation of discrete cosine transformation (DCT) which uses rotational angles known as coordinate rotation digital computer (CORDIC). This proposed algorithm has less computational complexity compared to other DCT algorithms. Along with reducing computational complexities it has some discriminate 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. Furthermore, the proposed algorithm is highly scalable, modular, regular, and suitable for pipelined VLSI implementation. A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science an