Abstract
This paper presents a new algorithm for the implementation of discrete cosine transform (DCT), based on the idea of reformulating prime N-length DCT into two cyclic convolutions with exactly the same structure, which are implemented with a proposed fast cyclic convolution-based systolic array structure. The proposed algorithm can save (N-1)/2 multiplications and 2Nregisters, at the cost of only (N-1)/2 additions of those used in previous designs. The I/O is kept low because of the simple control complexity of the algorithm. Furthermore, this new algorithm preserves all the other benefits of very large-scale integration algorithms based on circular correlation or cyclic convolution, such as regular and simple structure.
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 callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
