A new look at DCT-type transforms

Author

Kou, Weidong ; Mark, Jon W.

Author_Institution

Dept. of Electr. Eng., Waterloo Univ., Ont., Canada

Volume

37

Issue

12

fYear

1989

fDate

12/1/1989 12:00:00 AM

Firstpage

1899

Lastpage

1908

Abstract

A computationally efficient DCT- (discrete-cosine-transform) type orthogonal transform obtained by using a construction method developed by W. Kou and H. Zu (1986) is proposed. A recursive relation exists between a higher order and a lower order form of the kernel matrix of the transform and includes the DCT matrices as submatrices. The characteristics of the proposed transform and several fast transform algorithms are discussed. The proposed transform offers a higher computational efficiency than the traditional even discrete cosine transform and yields a mean-squared error close to that of the DCT. Since the HDCT has window spectral structures, it can be used in signal filtering and speech and image processing

Keywords

signal processing; spectral analysis; speech analysis and processing; transforms; DCT matrices; discrete-cosine-transform; image processing; kernel matrix; mean-squared error; orthogonal transform; signal filtering; speech analysis; submatrices; window spectral structures; Computational complexity; Computational efficiency; Data compression; Discrete cosine transforms; Discrete transforms; Image coding; Karhunen-Loeve transforms; Kernel; Signal processing algorithms; Welding;

fLanguage

English

Journal_Title

Acoustics, Speech and Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

0096-3518

Type

jour

DOI

10.1109/29.45536

Filename

45536