Sungwook Yu

TL;DR: This paper presents an efficient method for implementing the Discrete Cosine Transform (DCT) with distributed arithmetic that uses the recursive DCT algorithm and requires less area than the conventional approaches, regardless of the memory reduction techniques employed in the ROM Accumulators.

TL;DR: This paper presents an efficient approach for computing the N-point (N=2/sup n/) scaled discrete cosine transform (DCT) with the coordinate rotation digital computer (CORDIC) algorithm based on an indirect approach so that the vector rotations are completely separated from the other operations and placed at the end of the DCT unit.

TL;DR: The proposed scheme is area-efficient since the computational elements (CEs) use the minimum number of multipliers, and the number of CEs increases only linearly with respect to the dimension m, and it can be easily extended to the N/sup m/-point m-dimensional DFT with large m and/or N.