A fast algorithm of the DCT and IDCT for VLSI implementation
Ying Hong, Hou Zhao-huan · 2002
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.