• DocumentCode
    2023149
  • Title

    Turbo Decoding of Product Codes based on the Modified Adaptive Belief Propagation Algorithm

  • Author

    Jego, C. ; Gross, W.J.

  • Author_Institution
    CNRS, Brest
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    641
  • Lastpage
    644
  • 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.
  • Keywords
    BCH codes; computational complexity; error statistics; iterative decoding; product codes; turbo codes; BCH component codes; bit-error-rate; decoding complexity; iteration loop; m-ABP algorithm; matrix adaptation step; modified adaptive belief propagation algorithm; product codes; turbo decoding algorithm; Belief propagation; Bit error rate; Block codes; Concatenated codes; Iterative algorithms; Iterative decoding; Parity check codes; Product codes; Reed-Solomon codes; Sparse matrices; Adaptive Belief Propagation; BCH codes; iterative decoding of product codes; parity check matrix;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2007.4557297
  • Filename
    4557297