JOURNAL ARTICLE

Successively refinable trellis coded quantization

Abstract

We propose successively refinable trellis coded quantizers which are suitable for progressive transmission. A new trellis structure which is scalable is used in the design of our trellis coded quantizers. A hierarchical set partitioning is used to preserve successive refillability. Two algorithms for designing trellis coded quantizers which provide embedded bit streams are provided. The computational complexity of the proposed schemes is compared with that of trellis coded quantization. Simulation results show good performance for memoryless sources.

Keywords:
Trellis quantization Trellis (graph) Quantization (signal processing) Space–time trellis code Computer science Algorithm Trellis modulation Theoretical computer science Scalability Decoding methods Mathematics Artificial intelligence Block code Image processing Error floor Fading

Metrics

9
Cited By
0.68
FWCI (Field Weighted Citation Impact)
14
Refs
0.67
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Data Compression Techniques
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Digital Filter Design and Implementation
Physical Sciences →  Computer Science →  Signal Processing
Advanced Wireless Communication Techniques
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

JOURNAL ARTICLE

On successively refinable trellis-coded quantization

Xin WangM.T. Orchard

Year: 2003 Vol: 2 Pages: 1203-1207
JOURNAL ARTICLE

Design of successively refinable trellis-coded quantizers

Hamid JafarkhaniV. Tarokin

Journal:   IEEE Transactions on Information Theory Year: 1999 Vol: 45 (5)Pages: 1490-1497
JOURNAL ARTICLE

Universal Refinable Trellis Coded Quantization

Sebastian StegerThomas Richter

Year: 2009 Vol: 11 Pages: 312-321
© 2026 ScienceGate Book Chapters — All rights reserved.