• DocumentCode
    2517737
  • Title

    Computing the threshold shift for general channels

  • Author

    Ezri, Jeremie ; Urbanke, Rudiger ; Montanari, Andrea ; Oh, Sewoong

  • Author_Institution
    LTHC, EPFL, Lausanne
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    1448
  • Lastpage
    1452
  • Abstract
    The dasiathresholdpsila of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasure channel, the behavior of the threshold for large blocklengths is known in detail. It is characterized by an asymptotic threshold value, and a finite-blocklength shift parameter. Here we present a new method for computing the shift parameter that can be applied to general binary memoryless symmetric channels, and general message passing algorithms. We check that the new approach recovers the known parameters for erasure correction.
  • Keywords
    error statistics; message passing; parity check codes; binary erasure channel; binary memoryless symmetric channels; block error probability; code ensemble; finite-blocklength shift parameter; low-density parity check codes; message passing; noise level; threshold shift computing; Context; Degradation; Error probability; Iterative decoding; Lead; Message passing; Noise level; Numerical simulation; Parity check codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595227
  • Filename
    4595227