A vector quantization algorithm suitable for VLSI implementation

Author

Ting, Zhou ; Xuyun, Chen ; Qianling, Zhang ; Min Hao

Author_Institution

State Key Lab., Fudan Univ., Shanghai, China

fYear

1996

fDate

21-24 Oct 1996

Firstpage

23

Lastpage

26

Abstract

Vector quantization (VQ) has been extensively applied in image coding systems due to its high compression rate and simple decoder. A new algorithm of VQ based on minimum mean absolute error (MMAE) which is suitable for VLSI implementation is proposed in this paper. In the proposed algorithm, a criterion based on sum inequality of distortion measure, the presorted codebook, the nearest neighbors searching algorithm and a dichotomy searching method have been used. All of these methods result in a considerable reduction in the complexity of VLSI implementation

Keywords

VLSI; application specific integrated circuits; computational complexity; digital signal processing chips; image coding; parallel algorithms; parallel architectures; search problems; vector quantisation; VLSI implementation; VQ algorithm; dichotomy searching method; image coding systems; minimum mean absolute error; nearest neighbors searching algorithm; presorted codebook; sum inequality of distortion measure; vector quantization algorithm; Computational complexity; Decoding; Distortion measurement; Encoding; Image coding; Nearest neighbor searches; Q measurement; Testing; Vector quantization; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

ASIC, 1996., 2nd International Conference on

Conference_Location

Shanghai

Print_ISBN

7-5439-0940-5

Type

conf

DOI

10.1109/ICASIC.1996.562741

Filename

562741