• DocumentCode
    1037281
  • Title

    Kikuchi approximation method for joint decoding of LDPC codes and partial-response channels

  • Author

    Pakzad, Payam ; Anantharam, Venkat

  • Author_Institution
    Sch. of Comput. & Commun. Eng., Ecole Polytechnique Federate de Lausanne
  • Volume
    54
  • Issue
    7
  • fYear
    2006
  • fDate
    7/1/2006 12:00:00 AM
  • Firstpage
    1149
  • Lastpage
    1153
  • Abstract
    In this letter, we apply the Kikuchi approximation method to the problem of joint decoding of a low-density parity-check code and a partial-response channel. The Kikuchi method is, in general, more powerful than the conventional loopy belief propagation (BP) algorithm, and can produce better approximations to an underlying inference problem. We will first review the Kikuchi approximation method and the generalized BP algorithm, which is an iterative message-passing algorithm based on this method. We will then report simulation results which show that the Kikuchi method outperforms the best conventional iterative method
  • Keywords
    approximation theory; channel coding; inference mechanisms; iterative decoding; parity check codes; Kikuchi approximation method; LDPC codes; belief propagation algorithm; decoding; inference problem; iterative message-passing algorithm; low-density parity-check code; partial-response channels; Approximation algorithms; Approximation methods; Belief propagation; Bit error rate; Inference algorithms; Intersymbol interference; Iterative algorithms; Iterative decoding; Iterative methods; Parity check codes;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2006.877944
  • Filename
    1658205