• DocumentCode
    3509659
  • Title

    Spatially coupled codes over the multiple access channel

  • Author

    Kudekar, Shrinivas ; Kasai, Kenta

  • Author_Institution
    New Mexico Consortium, Los Alamos Nat. Lab., Los Alamos, NM, USA
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    2816
  • Lastpage
    2820
  • Abstract
    We consider spatially coupled code ensembles over a multiple access channel. Convolutional LDPC ensembles are one instance of spatially coupled codes. It was shown recently that, for transmission over the binary erasure channel, this coupling of individual code ensembles has the effect of increasing the belief propagation threshold of the coupled ensembles to the maximum a-posteriori threshold of the underlying ensemble. In this sense, spatially coupled codes were shown to be capacity achieving. It was observed, empirically, that these codes are universal in the sense that they achieve performance close to the Shannon threshold for any general binary-input memoryless symmetric channels. In this work we provide further evidence of the threshold saturation phenomena when transmitting over a class of multiple access channel. We show, by density evolution analysis and EXIT curves, that the belief propagation threshold of the coupled ensembles is very close to the ultimate Shannon limit.
  • Keywords
    channel coding; maximum likelihood estimation; memoryless systems; multi-access systems; parity check codes; EXIT curve; Shannon threshold; belief propagation threshold; binary erasure channel; binary input memoryless symmetric channel; convolutional LDPC; maximum-a-posteriori threshold; multiple access channel; spatially coupled code; Convolutional codes; Couplings; Decoding; Entropy; Equations; Parity check codes; Schedules;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
  • Conference_Location
    St. Petersburg
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4577-0596-0
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2011.6034088
  • Filename
    6034088