Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 1998 | public
Book Section - Chapter Open

Iterative min-sum decoding of tail-biting codes

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.

Additional Information

© Copyright 1998 IEEE. Reprinted with permission This work was partially supported by NSF grant no. NCR-9505975, AFOSR grant no. 5F49620-97-1-0313, and a grant from Qualcomm, Inc. Gavin Horn's contribution was also supported by an NSERC scholarship.

Files

AJIitw98.pdf
Files (239.5 kB)
Name Size Download all
md5:4ac6216c9d1d34dcc140842b5d1cb4b6
239.5 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023