A new multi-path tree-search FSVQ architecture for image/video sequence coding

Chao, Yen-Jean; Lee, Chiou-Yng

doi:10.1109/iscas.1995.523721

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also the addresses for four different codevectors have to be provided by the address generators whose part of the MSB's are determined by its previous stage. As for the distortion estimation and index selection, it can be easily realized on a few adders, registers, and multiplexers [13]. Design style: full-custom + cell-based approach.…”

Section: A Architecture For the Tsvqmentioning

confidence: 99%

Finite state vector quantization with multipath tree search strategy for image/video coding

Lee

Juan

Chao

1996

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

This paper presents a new vector quantization (VQ) algorithm exploiting the features of tree-search as well as finite state VQs for image/video coding. In the tree-search VQ, multiple candidates are identified for on-going search to optimally determine an index of the minimum distortion. In addition, the desired codebook has been reorganized hierarchically to meet the concept of multi-path search of neighboring trees so that picture quality can be improved by 4 dB on the average. In the finite state VQ, adaptation to the state codebooks is added to enhance the hit-ratio of the index produced by the tree-search VQ and hence to further reduce compressed bits. An identifier code is then included to indicate to which output indices belong. Our proposed algorithm not only reaches a higher compression ratio but also achieves better quality compared to conventional Anite-state and tree-search VQs.

show abstract

Section: A Architecture For the Tsvqmentioning

confidence: 99%

Finite state vector quantization with multipath tree search strategy for image/video coding

Lee

Juan

Chao

1996

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

show abstract

Design of a fast sequential decoding algorithm based on dynamic searching strategy

Yang

Jeng

Lee

Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94

View full text Add to dashboard Cite

This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and path recording techniques. By means of sorting, we cun identify the correct path in a very fast way and then, by path recording, we can recover the bit sequence without degmding decoding performance. We also develop a conditional resetting scheme to overcome the buffer overflow problem encountered in conventional sequential decoding algorithms. Simulation results show that for a given code, decoding efficiency remains the same as that obtained from maximum likelihood function by appropriately selecting sorting length and decoding depth. In addition, this algrithm can be mapped onto an area-efflcient VLSI architecture to implement long constraint length convolutional decoders for high-speed digital communications.

show abstract

A new multi-path tree-search FSVQ architecture for image/video sequence coding

Cited by 2 publications

References 6 publications

Finite state vector quantization with multipath tree search strategy for image/video coding

Finite state vector quantization with multipath tree search strategy for image/video coding

Design of a fast sequential decoding algorithm based on dynamic searching strategy

Contact Info

Product

Resources

About