FAST ALGORITHMS FOR THE DISCRETE COSINE TRANSFORM

被引：247

作者：

FEIG, E

WINOGRAD, S

机构：

[1] IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, NY

来源：

IEEE TRANSACTIONS ON SIGNAL PROCESSING | 1992年 / 40卷 / 09期

关键词：

D O I：

10.1109/78.157218

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

We introduce several fast algorithms for computing discrete cosine transforms (DCT's) and their inverses on multidimensional inputs of sizes which are powers of 2. Because the one-dimensional 8-point DCT and the two-dimensional 8 x 8-point DCT are so widely used, we discuss them in detail. We also present algorithms for computing scaled DCT's and their inverses; these have applications in compression of continuous tone image data, where the DCT is generally followed by scaling and quantization.

引用

页码：2174 / 2193

页数：20

共 29 条

[1] DISCRETE COSINE TRANSFORM [J].

AHMED, N ;

NATARAJAN, T ;

RAO, KR .

IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (01) :90-93

[2]

Arai Y., 1988, T IEICE, VE-71

[3] ABELIAN SEMI-SIMPLE ALGEBRAS AND ALGORITHMS FOR THE DISCRETE FOURIER-TRANSFORM [J].

AUSLANDER, L ;

FEIG, E ;

WINOGRAD, S .

ADVANCES IN APPLIED MATHEMATICS, 1984, 5 (01) :31-55

[4]

AUSLANDER L, 1980, ADV APPL MATH, V1, P257

[5]

CHEN WH, 1977, IEEE T COMMUN, V25, P1004, DOI 10.1109/TCOM.1977.1093941

[6]

DUHAMEL P, 1987, APR ICASSP 87 DALL, P1805

[7]

DUHAMEL P, 1990, APR P ICASSP 90, P1515

[8]

EUTANI Y, 1990, 1990 P ICASSP 90 ALB

[9]

EUTANI Y, 1990, 4TH DSP WORKSH

[10] ON THE MULTIPLICATIVE COMPLEXITY OF DISCRETE COSINE TRANSFORMS [J].

FEIG, E ;

WINOGRAD, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (04) :1387-1391

← 1 2 3 →