A refined fast 2-D discrete cosine transform algorithm with regular butterfly structure

Author

Huang, Yuh-Ming ; WU, JA-LING ; Hsu, Chiou-Ting

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan

Volume

44

Issue

2

fYear

1998

fDate

5/1/1998 12:00:00 AM

Firstpage

376

Lastpage

383

Abstract

A fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation. As a result, only the computation of N N-point 1-D DCTs and some post-additions are required for the computation of an (N×N)-point 2-D DCT. Furthermore, as compared with the method of Cho and Lee (1992), the derivation of the refined algorithm is more succinct, and the associated post-addition stage possesses a more regular butterfly structure. The regular structure of the proposed algorithm makes it more suitable for VLSI and parallel implementations

Keywords

digital arithmetic; discrete cosine transforms; parallel algorithms; signal processing; VLSI implementation; discrete cosine transform; fast 2D DCT algorithm; index permutation; parallel implementation; post-additions; refined algorithm; regular butterfly structure; signal processing; Computational complexity; Computer science; Data compression; Discrete cosine transforms; Image processing; Karhunen-Loeve transforms; Signal processing algorithms; Speech processing; Two dimensional displays; Very large scale integration;

fLanguage

English

Journal_Title

Consumer Electronics, IEEE Transactions on

Publisher

ieee

ISSN

0098-3063

Type

jour

DOI

10.1109/30.681953

Filename

681953