DocumentCode
2085452
Title
Iterative min-sum decoding of tail-biting codes
Author
Aji, Srinivas ; Horn, Gavin ; McEliece, Robert ; Xu, Meina
Author_Institution
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
fYear
1998
fDate
22-26 Jun 1998
Firstpage
68
Lastpage
69
Abstract
By invoking a form of the Perron-Frobenius theorem for the “min-sum” semi-ring, we obtain a union bound on the performance of iterative decoding of tail-biting codes. This bound shows that for the Gaussian channel, iterative decoding will be optimum, at least for high SNRs, if and only if the minimum “pseudo-distance” of the code is larger than the ordinary minimum distance
Keywords
AWGN channels; Hamming codes; channel coding; iterative decoding; Gaussian channel; Perron-Frobenius theorem; iterative decoding; iterative min-sum decoding; min-sum semi-ring; minimum distance; performance; pseudo-distance; tail-biting codes; union bound; AWGN channels; Algorithm design and analysis; Arithmetic; Gaussian channels; Iterative algorithms; Iterative decoding; Scholarships;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 1998
Conference_Location
Killarney
Print_ISBN
0-7803-4408-1
Type
conf
DOI
10.1109/ITW.1998.706439
Filename
706439
Link To Document