A fast algorithm of the DCT and IDCT for VLSI implementation

Author

Ying, Mong ; Zhaohuan, Hou

Author_Institution

Inst. of Acoust., Acad. Sinica, Beijing, China

Volume

1

fYear

1996

fDate

14-18 Oct 1996

Firstpage

637

Abstract

Since the DCT performs very close to the statistically optimal Karhunen-Loeve transform (KLT), it is widely used in digital signal processing, especially for speech and image data compression. The DCT algorithms and VLSI architectures for real-time computation capabilities are required urgently. It is known that VLSI implementation of distributed arithmetic is very efficient for computing the convolution. An algorithm is presented to convert the DCT and inverse DCT (IDCT) to the skew-convolution. VLSI implementation of the algorithm has the same advantage as any implementation using distributed arithmetic

Keywords

VLSI; convolution; data compression; digital arithmetic; digital signal processing chips; discrete cosine transforms; image coding; inverse problems; number theory; speech coding; transform coding; DCT; IDCT; VLSI architectures; VLSI implementation; digital signal processing; distributed arithmetic; fast algorithm; image data compression; inverse DCT; number theoretic transforms; real-time computation; skew-convolution; speech compression; statistically optimal Karhunen-Loeve transform; Arithmetic; Computer architecture; Data compression; Digital signal processing; Discrete cosine transforms; Distributed computing; Karhunen-Loeve transforms; Signal processing algorithms; Speech processing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing, 1996., 3rd International Conference on

Conference_Location

Beijing

Print_ISBN

0-7803-2912-0

Type

conf

DOI

10.1109/ICSIGP.1996.567344

Filename

567344