Please use this identifier to cite or link to this item:
|Title:||Efficient recursive algorithm for the inverse discrete cosine transform|
|Keywords:||Discrete cosine transform (DCT)|
|Source:||IEEE signal processing letters, Oct. 2000, v. 7, no. 10, p. 276-277 How to cite?|
|Journal:||IEEE signal processing letters|
|Abstract:||Recursive algorithms have been found very effective for realization using software and very large scale integrated circuit (VLSI) techniques. Recently, some recursive algorithms have been proposed for the realization of the inverse discrete cosine transform (IDCT). In this paper, an efficient recursive algorithm for the IDCT with arbitrary length is presented. By using some appropriate iterative techniques, the formulation of the IDCT can be implemented effectively using recursive equations, and the hardware complexity is further reduced as compared with the approaches in the literature.|
|Rights:||© 2000 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:||Journal/Magazine Article|
Show full item record
Citations as of Feb 6, 2016
WEB OF SCIENCETM
Citations as of Feb 5, 2016
Checked on Jan 31, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.