Efficient Termination of Spatially-Coupled Codes

Koji Tazoe; Kenta Kasai; Kohichi Sakaniwa

Efficient Termination of Spatially-Coupled Codes

Information Theory 2013-02-07 v1 math.IT

Authors: Koji Tazoe , Kenta Kasai , Kohichi Sakaniwa

Abstract

Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear equations to terminate the encoding process. In this paper, we propose modified spatially-coupled codes. The modified $(\dl,\dr,L)$ codes have less rate-loss, i.e., higher coding rate, and have the same threshold as $(\dl,\dr,L)$ codes and are efficiently terminable by using an accumulator.

Keywords

low-density parity-check codes decoding algorithm network coding

Cite

@article{arxiv.1302.1512,
  title  = {Efficient Termination of Spatially-Coupled Codes},
  author = {Koji Tazoe and Kenta Kasai and Kohichi Sakaniwa},
  journal= {arXiv preprint arXiv:1302.1512},
  year   = {2013}
}

Related papers

View all related →