一种有效的修正离散余弦反变换递归算法

Efficient recursive algorithm for the inverse modified discrete cosine transform(IMDCT)

修正的离散余弦变换及反变换在许多领域有广泛的应用,但计算量很大。本文针对修正的离散余弦反变换提出一种迭代方法,得到了一种快速有效的算法,与已有方法相比,该方法不需要区分N的奇偶性而给出了统一的递归公式,降低了硬件实现的复杂性,可以更方便的采用VLSI实现。同时,实验表明本文的方法速度更快,效率更高,更适于解决大计算量的问题。

Although modified discrete cosine transform （MDCT） has been applied in many fields, such as the encoding of MP3, AC-3, the computation to realize MDCT is still a big problem. This paper presents an efficient recursive algorithm for the inverse modified discrete cosine transform （IMDCT）. And the recursive algorithm is suitable for parallel computing, relatively easier to be realized in super large-scale integration and comparatively more efficient than those proposed before.