Abstract
In this paper, a general solution is proposed to realize the discrete cosine transform (DCT) of any length through convolutions. This algorithm is not optimal in minimizing any measure of computational complexity, but it is flexible and involves some regular forms that are most suitable for the realization using technologies and structures that are well suited for doing convolutions.
Original language | English |
---|---|
Pages (from-to) | 357-363 |
Number of pages | 7 |
Journal | Signal Processing |
Volume | 37 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Jan 1994 |
Keywords
- Convolutions
- Discrete cosine transform (DCT)
- Distributed arithmetic
- Fast algorithms
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering