Abstract
In this paper, we present a coordinate rotation digital computer (CORDIC) based fast algorithm for power of two point DCT. The proposed algorithm has some distinguish advantages, such as regular data flow like the Cooley-Tukey FFT, identical post-scaling factor, and the rotation angles of the CORDICs in DCT are arithmetic sequence. By using the sum formula and double angle formula, we dramatically reduce the CORDIC types in the proposed algorithm. For the purpose of gain fast speed, we use Carry Save Adder (CSA) as the basic cell of each part and Carry Look-ahead Adder (CLA) to produce the outputs in the final level. Compared with other known architectures, the proposed 2-point DCT architecture has lower hardware complexity, higher throughput and better synchronization
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
