TR2014-052

Threshold Analysis of Non-Binary Spatially-Coupled LDPC Codes with Windowed Decoding


    •  Wei, L.; Koike-Akino, T.; Mitchell, D.G.M.; Fuja, T.E.; Costello, D.J., "Threshold Analysis of Non-binary Spatially-coupled LDPC Codes with Windowed Decoding", IEEE International Symposium on Information Theory (ISIT), DOI: 10.1109/ISIT.2014.6874959, June 2014, pp. 881-885.
      BibTeX Download PDF
      • @inproceedings{Wei2014jun,
      • author = {Wei, L. and Koike-Akino, T. and Mitchell, D.G.M. and Fuja, T.E. and Costello, D.J.},
      • title = {Threshold Analysis of Non-binary Spatially-coupled LDPC Codes with Windowed Decoding},
      • booktitle = {IEEE International Symposium on Information Theory (ISIT)},
      • year = 2014,
      • pages = {881--885},
      • month = jun,
      • publisher = {IEEE},
      • doi = {10.1109/ISIT.2014.6874959},
      • url = {http://www.merl.com/publications/TR2014-052}
      • }
  • MERL Contact:
  • Research Area:

    Electronics & Communications


In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC), with particular emphasis on windowed decoding (WD). We consider both (2, 4)-regular and (3, 6)-regular NB-SC-LDPC code ensembles constructed using protographs and compute their thresholds using protograph versions of NB density evolution and NB extrinsic information transfer analysis. For these code ensembles, we show that WD of NB-SC-LDPC codes, which provides a significant decrease in latency and complexity compared to decoding across the entire parity-check matrix, results in a negligible decrease in the near-capacity performance for a sufficiently large window size W on both the BEC and the BIAWGNC. Also, we show that NBSC-LDPC code ensembles exhibit gains in the WD threshold compared to the corresponding block code ensembles decoded across the entire parity-check matrix, and that the gains increase as the finite field size q increases. Moreover, from the viewpoint of decoding complexity, we see that (3, 6)-regular NB-SC-LDPC codes are particularly attractive due to the fact that they achieve near-capacity thresholds even for small q and W.