On fast algorithms for computing the inverse modified discrete cosine transform

被引：16

作者：

Fan, YH ^{[1
]}

Madisetti, VK ^{[1
]}

Mersereau, RM ^{[1
]}

机构：

[1] Georgia Inst Technol, Ctr Signal & Image Proc Elect & Comp Engn, Atlanta, GA 30332 USA

来源：

IEEE SIGNAL PROCESSING LETTERS | 1999年 / 6卷 / 03期

关键词：

audio coding; discrete cosine transform; discrete Hartley transform; discrete transform; error analysis; quantization; signal reconstruction;

D O I：

10.1109/97.744625

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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

引用

页码：61 / 64

页数：4

共 8 条

[1] THE FAST HARTLEY TRANSFORM [J].

BRACEWELL, RN .

PROCEEDINGS OF THE IEEE, 1984, 72 (08) :1010-1018

[2]

BRANDENBURG K, 1991, P 90 AES CONV PAR FR

[3]

DUHAMEL P, 1991, P IEEE INT C AC SPEE, P2209

[4]

LEE BG, 1984, IEEE T ACOUST SPEECH, V32, P1243

[5] FAST COMPUTATION OF DISCRETE COSINE TRANSFORM THROUGH FAST HARTLEY TRANSFORM [J].

MALVAR, H .

ELECTRONICS LETTERS, 1986, 22 (07) :352-353

[6]

Princen J. P., 1987, Proceedings: ICASSP 87. 1987 International Conference on Acoustics, Speech, and Signal Processing (Cat. No.87CH2396-0), P2161

[7]

QUACKENBUSH SR, 1994, COMMUNICATION

[8] A New Efficient Implementation of the Oddly Stacked Princen-Bradley Filter Bank [J].

Sevic, Dragutin ;

Popovic, Miodrag .

IEEE SIGNAL PROCESSING LETTERS, 1994, 1 (11) :166-168

← 1 →