Abstract
A general solution is proposed to realize the discrete cosine transform of any length via cyclic convolutions in this paper. This algorithm is not optimal in minimizing any measure of computational complexity, but it involves some regular forms that are most suitable for the realization using technologies and structures which are well suited for doing convolutions, such as the distributed arithmetic and the systolic array. On the other hand, this algorithm is much more flexible than any available DCT algorithm as it can be applied to realize DCT/IDCT with any length.
Original language | English |
---|---|
Title of host publication | Digital Speech Processing |
Publisher | Publ by IEEE |
Volume | 3 |
ISBN (Print) | 0780309464 |
Publication status | Published - 1 Jan 1993 |
Event | 1993 IEEE International Conference on Acoustics, Speech and Signal Processing - Minneapolis, MN, United States Duration: 27 Apr 1993 → 30 Apr 1993 |
Conference
Conference | 1993 IEEE International Conference on Acoustics, Speech and Signal Processing |
---|---|
Country/Territory | United States |
City | Minneapolis, MN |
Period | 27/04/93 → 30/04/93 |
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
- Acoustics and Ultrasonics