Referenced Items are not available for this document.
The authors describe efficient, fast numerical algorithms for computing wavelet transform representations. Methods presented include modified lattice and transform domain computation. The implementation of the wavelet transform is computationally intensive, since the number of computations required increases with the number of octaves. Various methods are applied to reduce the number of operations necessary for calculations of wavelet representation. Computational complexity per octave is compared to several algorithms described here. Modified lattice structure results in better efficiency for shorter wavelets, while transform domain filtering with incorporated sampling rate conversion leads to computationally efficient implementation of wavelet coefficients for longer wavelets
Published in:
Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on
(Volume:2
)
Date of Conference: 10-13 May 1992
- Page(s):
- 987 - 990 vol.2
- Meeting Date :
- 10 May 1992-13 May 1992
- Print ISBN:
- 0-7803-0593-0
- INSPEC Accession Number:
- 4411734
- Conference Location :
- San Diego, CA
- Digital Object Identifier :
- 10.1109/ISCAS.1992.230054
- 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.
