Iterative min-sum decoding of tail-biting codes
Aji, S.
Horn, G.
McEliece, R.
Meina Xu
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA;
This paper appears in: Information Theory Workshop, 1998
Publication Date: 22-26 Jun 1998
On page(s): 68-69
Meeting Date: 06/22/1998 - 06/26/1998
Location: Killarney, Ireland
ISBN: 0-7803-4408-1
References Cited: 8
INSPEC Accession Number: 6154739
Digital Object Identifier: 10.1109/ITW.1998.706439
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
