Abstract
It is always desirable to look for more efficient algorithms for the realization of the discrete cosine transform (DCT). In this paper, we generalize a formulation for converting a length-2n DCT into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are 2m, for m = n-1, ...., 0. While their structures are extremely regular. The realization can then be converted into the simplest recursive filter form, which is of particularly simple for practical implementation.
Original language | English |
---|---|
Pages (from-to) | 1169-1172 |
Number of pages | 4 |
Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
Volume | 2 |
Publication status | Published - 1 Jan 1995 |
Event | Proceedings of the 1995 20th International Conference on Acoustics, Speech, and Signal Processing. Part 2 (of 5) - Detroit, MI, United States Duration: 9 May 1995 → 12 May 1995 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Signal Processing
- Acoustics and Ultrasonics