Fast algorithms for type-III DCT of composite sequence lengths

Author

Bi, Guoan

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore

Volume

47

Issue

7

fYear

1999

fDate

7/1/1999 12:00:00 AM

Firstpage

2053

Lastpage

2059

Abstract

This correspondence presents an odd-factor algorithm for the type-III discrete cosine transform (DCT) for uniform or mixed radix decomposition. By jointly using the old-factor and the existing radix-2 algorithms, a general decomposition method for arbitrarily composite sequence length is developed. A reduction of computational complexity can be achieved compared with that needed by other reported algorithms for M=2^m. The decomposition approach has a simple computational structure and supports a wider range of choices for different sequence lengths

Keywords

computational complexity; discrete cosine transforms; signal processing; composite sequence lengths; computational complexity; computational structure; discrete cosine transform; fast algorithms; general decomposition method; mixed radix decomposition; odd-factor algorithm; old-factor; radix-2 algorithms; sequence lengths; type-III DCT; uniform radix decomposition; Arithmetic; Bismuth; Computational complexity; Computational efficiency; Digital signal processing; Discrete cosine transforms; Discrete transforms; Hardware; Signal processing algorithms;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.771055

Filename

771055