Referenced Items are not available for this document.
A fast codeword search algorithm based on partial distance search (PDS) and zero-tree data structure is presented. Before the fast search, the zero-trees of the wavelet coefficients of codewords and sourcewords are first identified. The PDS is then preformed only over the wavelet coefficients which are not inside the zero-trees. The algorithm is well-suited to applications where degradation in average distortion is allowed to achieve very low arithmetic complexity
Published in:
Electronics Letters
(Volume:33
,
Issue:
15
)
Date of Publication: 17 Jul 1997
- Page(s):
- 1290 - 1292
- ISSN :
- 0013-5194
- INSPEC Accession Number:
- 5653466
- Digital Object Identifier :
- 10.1049/el:19970880
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- 17 Jul 1997
- Sponsored by :
- Institution of Engineering and Technology
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.
