On the redundancy of trellis lossy source coding

On the redundancy of trellis lossy source coding

It is well known that trellis lossy source codes have better performance/complexity tradeoff than block codes, as shown by simulations. This makes the trellis coding technique attractive in practice. To get a better understanding of this fact, this paper studies the redundancy of trellis coding for...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2002-01, Vol.48 (1), p.205-218
Hauptverfasser: Zhou, Guangcai, Zhang, Zhen
Format: Artikel
Sprache:eng
Schlagworte:
Block codes
Codes
Coding
Complexity
Information theory
Redundancy
Simulation
Source code
Theory
Trellis codes
Trellis coding
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:It is well known that trellis lossy source codes have better performance/complexity tradeoff than block codes, as shown by simulations. This makes the trellis coding technique attractive in practice. To get a better understanding of this fact, this paper studies the redundancy of trellis coding for memoryless sources and compares it with a similar result for block codes.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.971749