Channel-matched hierarchical table-lookup vector quantization
In this correspondence, we propose a channel-matched hierarchical table-lookup vector quantizer for a discrete memoryless channel. We show that this scheme simultaneously provides low encoding complexity and robustness against transmission noise. Additionally, we propose the use of lookup tables for...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on information theory 2000-05, Vol.46 (3), p.1121-1125 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this correspondence, we propose a channel-matched hierarchical table-lookup vector quantizer for a discrete memoryless channel. We show that this scheme simultaneously provides low encoding complexity and robustness against transmission noise. Additionally, we propose the use of lookup tables for transcoding in heterogeneous networks. We show, through an example motivated by an application in multicasting, that the proposed table-lookup transcoding approach is an elegant alternative to the expensive and delay-introducing method of transcoding achieved by decoding and re-encoding. |
---|---|
ISSN: | 0018-9448 1557-9654 |
DOI: | 10.1109/18.841194 |