CONVOLUTION-BASED DCT ALGORITHM

被引：1

作者：

CHIN, YM

WU, JL

机构：

[1] Department of Computer Science, Information Engineering, National Taiwan University

来源：

ELECTRONICS LETTERS | 1991年 / 27卷 / 20期

关键词：

ALGORITHMS; TRANSFORMS; CONVOLUTION; MATHEMATICAL TECHNIQUES; INFORMATION THEORY;

D O I：

10.1049/el:19911140

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

Based on elements of number theory, a new convolution-based algorithm for computing the DCT (with power of two length) is proposed. In terms of computational counts, the proposed algorithm computes a length-N DCT (with N a power of two) using only N multiplications.

引用

页码：1834 / 1836

页数：3

共 9 条

[1] AHMED N, 1974, IEEE T C, V23, P89
[2] FAST COMPUTATION OF THE DISCRETE COSINE TRANSFORM AND THE DISCRETE HARTLEY TRANSFORM
MALVAR, HS
[J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1987, 35 (10): : 1484 - 1485
[3] COMPUTATION OF DISCRETE COSINE TRANSFORM
NARASIMHA, MJ
PETERSON, AM
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1978, 26 (06) : 934 - 936
[4] IMPROVED LONG CONVOLUTIONS USING GENERALIZED NUMBER THEORETIC AND POLYNOMIAL-TRANSFORMS
PEI, SC
WU, JL
[J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1985, 33 (06): : 1626 - 1627
[5] DISCRETE FOURIER TRANSFORMS WHEN NUMBER OF DATA SAMPLES IS PRIME
RADER, CM
[J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1968, 56 (06): : 1107 - &
[6] Rosen K. H., 1993, ELEMENTARY NUMBER TH
[7] SIMPLE FFT AND DCT ALGORITHMS WITH REDUCED NUMBER OF OPERATIONS
VETTERLI, M
NUSSBAUMER, HJ
[J]. SIGNAL PROCESSING, 1984, 6 (04) : 267 - 278
[8] WANG ZD, 1984, IEEE T ACOUST SPEECH, V32, P803
[9] SOME BILINEAR FORMS WHOSE MULTIPLICATIVE COMPLEXITY DEPENDS ON FIELD OF CONSTANTS
WINOGRAD, S
[J]. MATHEMATICAL SYSTEMS THEORY, 1977, 10 (02): : 169 - 180

← 1 →