Abstract
Discrete cosine transform is the most popular solution for image coding owing to its near optimal performance, yet it is not signal dependent. A two-stage convolver-based DCT and IDCT algorithm with power-of-two length is presented. The transform matrix of IDCT is decomposed into the product of pre- and post processing matrices by using Mobius inversion formula. The pre-processing stage consists of just additions and subtractions; the post-processing stage performs circular convolution operations. A nearly recursive computational method for preprocessing calculation is given which considerably reduces the operation count and is valuable in practical usage. The post-processing is a circular convolution and can be computed using number theoretic transform, (semi-) systolic arrays or transversal filters.
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: IEE Proceedings I Communications, Speech and Vision
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.
