Please use this identifier to cite or link to this item:
|Title:||Symmetric realization of DCT for multi-dimensional data compression|
|Source:||China 1991 International Conference on Circuits and Systems : conference proceedings : 16-17 June 1991, Shenzhen University, Shenzhen, China, v. 1, p. 309-312.|
|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.|
|Rights:||© 1991 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||EE Conference Papers & Presentations|
Files in This Item:
|Symmetric Realization of DCT for Multi-dim Data Comp_91.pdf||407.39 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.