Turbo Decoding of Product Codes based on the Modified Adaptive Belief Propagation Algorithm
Jego, Christophe
Gross, Warren J.
GET/ENST Bretagne, CNRS TAMCIC UMR2872, 29238 Brest, France. Christophe.Jego@enst-bretagne.fr;
This paper appears in: Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Publication Date: 24-29 June 2007
On page(s): 641-644
Location: Nice,
ISBN: 978-1-4244-1397-3
Digital Object Identifier: 10.1109/ISIT.2007.4557297
Current Version Published: 2008-07-09
Abstract
This paper introduces the Modified Adaptive Belief Propagation (m-ABP) algorithm, an innovative method for the turbo decoding of product codes based on BCH component codes. The Adaptive Belief Propagation algorithm of Jiang and Narayanan is simplified by moving the matrix adaptation step outside of the iteration loop, significantly reducing the complexity. Performance in terms of the bit-error-rate (BER) of the novel turbo decoding algorithm is given. Simulation results for the turbo decoding of product codes show that compared to the Chase-Pyndiah algorithm no significant BER deviation is observed while the highly-parallelizable graph-based structure of the algorithm enables high-throughput decoding.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
