Abstract
The row-column approach is widely used for the realization of multi-dimensional DCT due to its simple and flexible structure. In this paper, we propose a new DCT algorithm which is most suitable for the realization of multi-dimensional DCT with the row-column decomposition technique. By using this new algorithm, the saving in terms of computational complexity is exponentially proportional to the degree of dimension compared with any other 1-D DCT algorithms. On the other hand, this new algorithm can also achieve additional saving in terms of the number of multiplications when the complete DCT realization is not necessary. These two important properties make the algorithm very suitable for the realization of multi-dimensional DCT for image compression.
| Original language | English |
|---|---|
| Title of host publication | 91 China Int Conf Circuits Syst |
| Publisher | Publ by IEEE |
| Pages | 309-312 |
| Number of pages | 4 |
| ISBN (Print) | 0780301502 |
| Publication status | Published - 1 Dec 1991 |
| Event | China 1991 International Conference on Circuits and Systems. Part 1 (of 2) - Shenzhen, China Duration: 16 Jun 1991 → 17 Jun 1991 |
Conference
| Conference | China 1991 International Conference on Circuits and Systems. Part 1 (of 2) |
|---|---|
| Country/Territory | China |
| City | Shenzhen |
| Period | 16/06/91 → 17/06/91 |
ASJC Scopus subject areas
- General Engineering