Please use this identifier to cite or link to this item:
|Title:||Novel formulation and realisation of discrete cosine transform using distributed arithmetic|
Mathematical Techniques - Algorithms
|Source:||IEEE TENCON '90 : 1990 IEEE Region 10 Conference on Computer Communication Systems : 24-27 September, 1990, Hong Kong, v. 1, p. 190-193.|
|Abstract:||In this paper, a new algorithm is introduced such that we can convert an odd prime length, say N, DCT into two (N-1)/2 length cyclic correlations. This formulation enables us to realise the DCT using the distributed arithmetic and it also results in extremely regular structure which is most suitable for VLSI realisation. An example is given to show the feasibility and the structural regularity of the algorithm.|
|Rights:||© 1990 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:
|Realisation of discrete cosine transform_90.pdf||314.13 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.