Please use this identifier to cite or link to this item:
|Title:||Generalized approach for the realization of discrete cosine transform using cyclic convolutions|
|Source:||ICASSP-93 : 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing : April 27-30, 1993, Minneapolis, Minnesota, USA, p. III277-III280.|
|Abstract:||A general solution is proposed to realize the discrete cosine transform of any length via cyclic convolutions in this paper. This algorithm is not optimal in minimizing any measure of computational complexity, but it involves some regular forms that are most suitable for the realization using technologies and structures which are well suited for doing convolutions, such as the distributed arithmetic and the systolic array. On the other hand, this algorithm is much more flexible than any available DCT algorithm as it can be applied to realize DCT/IDCT with any length.|
|Rights:||© 1993 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:
|Discrete cosine transform using cyclic convolutions_93.pdf||318.08 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.