Abstract
In this paper, we present a discussion on DCT algorithms based on convolutions. It is shown that these approaches can provide effective solutions to realize DCTs. Besides, they provide a theoretical lower bound on the number of multiplications required for the realization of DCTs. Some fast short length DCT algorithms have also been derived from these approaches.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |
| Publisher | Publ by IEEE |
| Pages | 750-753 |
| Number of pages | 4 |
| Volume | 1 |
| ISBN (Print) | 0780312813 |
| Publication status | Published - 1 Jan 1993 |
| Event | 1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, United States Duration: 3 May 1993 → 6 May 1993 |
Conference
| Conference | 1993 IEEE International Symposium on Circuits and Systems |
|---|---|
| Country/Territory | United States |
| City | Chicago, IL |
| Period | 3/05/93 → 6/05/93 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials