论文信息 - On fast algorithms for computing the inverse modified discrete cosine transform

On fast algorithms for computing the inverse modified discrete cosine transform

Two new fast algorithms for computing the inverse modified discrete cosine transform (IMDCT) as used in the adaptive spectral entropy coder (ASPEC) (Brandenburg et al. 1991) are proposed. A fixed-point error analysis is presented to determine the number of significant bits required for fixed-point implementations.

Russell M. Mersereau | Vijay K. Madisetti | Yun-Hui Fan

[1] R. Bracewell. The fast Hartley transform , 1984, Proceedings of the IEEE.

[2] John Princen,et al. Subband/Transform coding using filter bank designs based on time domain aliasing cancellation , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[3] Henrique S. Malvar. Fast computation of discrete cosine transform through fast Hartley transform , 1986 .

[4] Pierre Duhamel,et al. A fast algorithm for the implementation of filter banks based on 'time domain aliasing cancellation' , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[5] B. Lee. A new algorithm to compute the discrete cosine Transform , 1984 .

[6] Ernst F Schroeder,et al. Aspec-Adaptive Spectral Entropy Coding of High Quality Music Signals , 1991 .

[7] D. Sevic,et al. A new efficient implementation of the oddly stacked Princen-Bradley filter bank , 1994, IEEE Signal Processing Letters.