Abstract
A novel algorithm is introduced that makes it possible to realize a discrete cosine transform (DCT) by correlations. A p2-length DCT can be realized through four (p-1)/2-length and two (p-1)p/2-length cyclic correlations with a cost of N-1 multiplications. This formulation is potentially useful for the realization of the DCT using VLSI techniques, especially if the distributed arithmetic technique is used.
| Original language | English |
|---|---|
| Pages (from-to) | 630-633 |
| Number of pages | 4 |
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 1 |
| Publication status | Published - 1 Dec 1991 |
| Event | 1991 IEEE International Symposium on Circuits and Systems Part 1 (of 5) - Singapore, Singapore Duration: 11 Jun 1991 → 14 Jun 1991 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials