Title :
Fast algorithm for computing discrete cosine transform
Author_Institution :
Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA
fDate :
3/1/1997 12:00:00 AM
Abstract :
An efficient method for computing the discrete cosine transform (DCT) is proposed. Based on direct decomposition of the DCT, the recursive properties of the DCT for an even length input sequence is derived, which is a generalization of the radix 2 DCT algorithm. Based on the recursive property, a new DCT algorithm for an even length sequence is obtained. The proposed algorithm is very structural and requires fewer computations when compared with others. The regular structure of the proposed algorithm is suitable for fast parallel algorithm and VLSI implementation
Keywords :
digital arithmetic; discrete cosine transforms; sequences; signal processing; VLSI implementation; discrete cosine transform; even length input sequence; fast algorithm; fast parallel algorithm; generalization; radix 2 DCT algorithm; recursive properties; recursive property; Algorithm design and analysis; Arithmetic; Computational complexity; Discrete cosine transforms; Hardware; Kernel; Matrix decomposition; Parallel algorithms; Signal processing algorithms; Telecommunication computing;
Journal_Title :
Signal Processing, IEEE Transactions on
