One- and two-dimensional constant geometry fast cosine transform algorithms and architectures

Author

Kwak, Jinsuk ; You, Jaehee

Author_Institution

Broadcasting Technol. Dept., Electron. & Telecommun. Res. Inst., Daejeon, South Korea

Volume

47

Issue

7

fYear

1999

fDate

7/1/1999 12:00:00 AM

Firstpage

2023

Lastpage

2034

Abstract

This paper presents general radix one- and two-dimensional (1-D and 2-D) constant geometry fast cosine transform algorithms and architectures suitable for VLSI, owing to their regular structures. A constant geometry algorithm is obtained by shuffling the rows and columns of each decomposed DCT matrix that corresponds to a butterfly stage. The 1-D algorithm is derived, and then, it is extended to the 2-D case. Based on the derived algorithms, the architectures with a flexible degree of parallelism are discussed

Keywords

VLSI; discrete cosine transforms; matrix algebra; parallel algorithms; parallel architectures; signal processing; 1D architecture; 1D constant geometry algorithm; 2D architecture; 2D constant geometry algorithm; DCT; VLSI; butterfly stage; decomposed DCT matrix; fast cosine transform; general radix; image signal processing; parallel algorithms; parallel architectures; regular structures; Computational geometry; Discrete cosine transforms; Discrete transforms; Hardware; Helium; Karhunen-Loeve transforms; Matrix decomposition; Parallel processing; Signal processing algorithms; Very large scale integration;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.771049

Filename

771049