Please use this identifier to cite or link to this item:
|Title:||Efficient implementation of discrete cosine transform using recursive filter structure|
|Source:||IEEE transactions on circuits and systems for video technology, Dec. 1994, v. 4, no. 6, p. 550-552.|
|Abstract:||In this paper, we generalize a formulation for converting a length-2ⁿ discrete cosine transform into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are 2[sup n-1], 2[sup n-2],... 2[sup 0] respectively, while their structures are extremely regular. The realization can then be converted into recursive filter form, which is of particularly simple for practical implementation.|
|Rights:||© 1994 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 Journal/Magazine Articles|
Files in This Item:
|Implementation of discrete cosine transform_94.pdf||266.89 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.