Abstract
Fast algorithms are derived for modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) in this brief. The proposed algorithms based on type II discrete cosine transform and type II discrete sine transform not only adopt a unified architecture for both MDCT and IMDCT computations but also take only N/8 + 1 computational cycles for each output sequence. Compared with previous IMDCT approaches, the number of preprocessing multiplications of the proposed IMDCT algorithm is reduced by 87.5%. In addition, the coefficient requirements for preprocessing in the proposed IMDCT algorithm can be reduced by 50%, and the number of multiplications for the recursive kernel is greatly decreased by up to 87.5%. The proposed algorithms in terms of hardware costs take two fewer multipliers and six fewer adders than some well-known recursive algorithms. Therefore, the proposed architecture is better suited for various audio codecs.
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.
