Limited-trial Chase decoding

Chase decoders permit flexible use of reliability information in algebraic decoding algorithms for error-correcting block codes of Hamming distance d. The least complex version of the original Chase algorithms uses roughly d/2 trials of a conventional binary decoder, after which the best decoding re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 49; H. 11; S. 2972 - 2975
Hauptverfasser: Arico, G., Weber, J.H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.11.2003
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algebra
Algorithm design and analysis
Algorithms
Asymptotic properties
Binary system
Block codes
Channels
Codes
Decoders
Decoding
Demodulation
Hamming distance
Linear code
Maximum likelihood decoding
Maximum likelihood detection
Maximum likelihood estimation
Optimization
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Chase decoders permit flexible use of reliability information in algebraic decoding algorithms for error-correcting block codes of Hamming distance d. The least complex version of the original Chase algorithms uses roughly d/2 trials of a conventional binary decoder, after which the best decoding result is selected as the final output. On certain channels, this approach achieves asymptotically the same performance as maximum-likelihood (ML) decoding. In this correspondence, the performance of Chase-like decoders with even less trials is studied. Most strikingly, it turns out that asymptotically optimal performance can be achieved by a version which uses only about d/4 trials.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2003.818397