Fast vector quantisation encoding algorithm using zero-tree data structure

Wen Jyi Hwang; Biing Yau Chen

doi:10.1049/el:19970880

Fast vector quantisation encoding algorithm using zero-tree data structure

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	1290-1292
Number of pages	3
Journal	Electronics Letters
Volume	33
Issue number	15
DOIs	https://doi.org/10.1049/el:19970880
Publication status	Published - 1997 Jul 17
Externally published	Yes

Keywords

Data structures
Vector quantisation

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1049/el:19970880

Cite this

@article{e9ec3344ee6c4a12bb0ded18b8adf879,

title = "Fast vector quantisation encoding algorithm using zero-tree data structure",

abstract = "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.",

keywords = "Data structures, Vector quantisation",

author = "Hwang, {Wen Jyi} and Chen, {Biing Yau}",

year = "1997",

month = jul,

day = "17",

doi = "10.1049/el:19970880",

language = "English",

volume = "33",

pages = "1290--1292",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "Institution of Engineering and Technology",

number = "15",

}

TY - JOUR

T1 - Fast vector quantisation encoding algorithm using zero-tree data structure

AU - Hwang, Wen Jyi

AU - Chen, Biing Yau

PY - 1997/7/17

Y1 - 1997/7/17

N2 - 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.

AB - 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.

KW - Data structures

KW - Vector quantisation

UR - http://www.scopus.com/inward/record.url?scp=3342940930&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3342940930&partnerID=8YFLogxK

U2 - 10.1049/el:19970880

DO - 10.1049/el:19970880

M3 - Article

AN - SCOPUS:3342940930

SN - 0013-5194

VL - 33

SP - 1290

EP - 1292

JO - Electronics Letters

JF - Electronics Letters

IS - 15

ER -

Fast vector quantisation encoding algorithm using zero-tree data structure

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this