Referenced Items are not available for this document.
A new algorithm to calculate the discrete cosine transform (DCT) and its inverse is described. The algorithm is recursive in that it breaks the DCT transformation of an array of size N into two DCTs of size N/2. The proposed recursive algorithm has the ability to gradually reconstruct the original data from its DCT array, with progressively higher levels of resolution. In regard to speed, it requires O(N logN) operations, where N is the array size, but it is not the fastest algorithm if only the full resolution reconstruction is desired. The algorithm can be extended to multidimensional arrays in a straightforward way
Published in:
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Date of Conference: 27 Jun-1 Jul 1994
- Meeting Date :
- 27 Jun 1994-01 Jul 1994
- Print ISBN:
- 0-7803-2015-8
- INSPEC Accession Number:
- 4939271
- Conference Location :
- Trondheim
- Digital Object Identifier :
- 10.1109/ISIT.1994.394867
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
