摘要
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.
| 原文 | 英語 |
|---|---|
| 頁(從 - 到) | 1290-1292 |
| 頁數 | 3 |
| 期刊 | Electronics Letters |
| 卷 | 33 |
| 發行號 | 15 |
| DOIs | |
| 出版狀態 | 已發佈 - 1997 7月 17 |
| 對外發佈 | 是 |
ASJC Scopus subject areas
- 電氣與電子工程
指紋
深入研究「Fast vector quantisation encoding algorithm using zero-tree data structure」主題。共同形成了獨特的指紋。引用此
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS