Abstract
A new algorithm is introduced such that we can realize a discrete cosine transform by correlations. This algorithm can be applied to any p[sup m]-length DCT, where p is an odd prime, and is most suitable for VLSI implementation.
| Original language | English |
|---|---|
| Title of host publication | [Missing Source Name from PIRA] |
| Publisher | IEEE |
| ISBN (Print) | 0780300505 |
| Publication status | Published - 1991 |
Keywords
- VLSI
- Digital arithmetic
- Transforms
Fingerprint
Dive into the research topics of 'Algorithm for p[sup m]-length discrete cosine transform'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver