An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk-Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are difficult to analyze (posterior matching). This paper introduces a ne...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 61; H. 6; S. 2953 - 2963
Hauptverfasser: Cheuk Ting Li, El Gamal, Abbas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.06.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Coding theory
Complexity theory
Decoding
discrete memoryless channel
Electrical engineering
Electronics
Encoding
error exponent
Error probability
Feedback
Markov analysis
Markov processes
Memoryless systems
Silicon
Feedback
error exponent
discrete memoryless channel
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk-Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are difficult to analyze (posterior matching). This paper introduces a new fixed-length feedback coding scheme which achieves the capacity for all discrete memoryless channels, has an error exponent that approaches the sphere packing bound as the rate approaches the capacity, and has O(n log n) coding complexity. These benefits are achieved by judiciously combining features from previous schemes with new randomization technique and encoding/decoding rule. These new features make the analysis of the error probability for the new scheme easier than for posterior matching.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2015.2428234