Low complexity and fast computation for recursive MDCT and IMDCT algorithms

Sheau Fang Lei, Shin Chi Lai, Po Yin Cheng, Ching Hsing Luo

研究成果: Article同行評審

12 引文 斯高帕斯(Scopus)

摘要

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.

原文English
文章編號5475185
頁(從 - 到)571-575
頁數5
期刊IEEE Transactions on Circuits and Systems II: Express Briefs
57
發行號7
DOIs
出版狀態Published - 2010 七月 1

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

指紋 深入研究「Low complexity and fast computation for recursive MDCT and IMDCT algorithms」主題。共同形成了獨特的指紋。

引用此