CORDIC Based Fast Radix-2 DCT Algorithm

Author

Hai Huang ; Liyi Xiao

Author_Institution

Microelectron. Center, Harbin Inst. of Technol., Harbin, China

Volume

20

Issue

5

fYear

2013

fDate

41395

Firstpage

483

Lastpage

486

Abstract

This letter proposes a novel coordinate rotation digital computer (CORDIC)-based fast radix-2 algorithm for computation of discrete cosine transformation (DCT). The proposed algorithm has some distinguish advantages, such as Cooley-Tukey fast Fourier transformation (FFT)-like regular data flow, uniform post-scaling factor, in-place computation and arithmetic-sequence rotation angles. Compared to existing DCT algorithms, this proposed algorithm has lower computational complexity. Furthermore, the proposed algorithm is highly scalable, modular, regular, and suitable for pipelined VLSI implementation. In addition, this letter also provides an easy way to implement the reconfigurable or unified architecture for DCTs and inverse DCTs.

Keywords

VLSI; computational complexity; digital arithmetic; discrete cosine transforms; signal processing; CORDIC-based fast radix-2 DCT algorithm; Cooley-Tukey FFT-like regular data flow; Cooley-Tukey fast Fourier transformation; arithmetic-sequence rotation angles; computational complexity; coordinate rotation digital computer; discrete cosine transformation; in-place computation; inverse DCT; pipelined VLSI implementation; uniform post-scaling factor; Algorithm design and analysis; Computational complexity; Digital arithmetic; Discrete cosine transforms; Very large scale integration; Coordinate rotation digital computer (CORDIC); discrete cosine transformation (DCT); fast radix-2 algorithm;

fLanguage

English

Journal_Title

Signal Processing Letters, IEEE

Publisher

ieee

ISSN

1070-9908

Type

jour

DOI

10.1109/LSP.2013.2252616

Filename

6479682