English
Related papers

Related papers: Spatially-Coupled MacKay-Neal Codes and Hsu-Anasta…

200 papers

Recently, it was observed that spatially-coupled LDPC code ensembles approach the Shannon capacity for a class of binary-input memoryless symmetric (BMS) channels. The fundamental reason for this was attributed to a "threshold saturation"…

Information Theory · Computer Science 2010-10-29 Shrinivas Kudekar , Henry D. Pfister

We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient…

Information Theory · Computer Science 2016-11-15 Amina Piemontese , Alexandre Graell i Amat , Giulio Colavolpe

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…

Information Theory · Computer Science 2011-02-15 Shrinivas Kudekar , Kenta Kasai

We consider spatially-coupled protograph-based LDPC codes for the three terminal erasure relay channel. It is observed that BP threshold value, the maximal erasure probability of the channel for which decoding error probability converges to…

Information Theory · Computer Science 2015-05-27 Hironori Uchikawa , Kenta Kasai , Kohichi Sakaniwa

In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain…

Information Theory · Computer Science 2016-11-17 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by…

Information Theory · Computer Science 2011-10-12 Phong S. Nguyen , Arvind Yedla , Henry D. Pfister , Krishna R. Narayanan

Obata et al. proved that spatially-coupled (SC) MacKay-Neal (MN) codes achieve the capacity of BEC. However, the SC-MN codes codes have many variable nodes of degree two and have higher error floors. In this paper, we prove that SC-MN codes…

Information Theory · Computer Science 2014-01-29 Takuya Okazaki , Kenta Kasai

In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of…

Information Theory · Computer Science 2014-07-03 Michael Lentmaier , Saeedeh Moloudi , Alexandre Graell i Amat

Low-density parity-check (LDPC) convolutional codes have been shown to exhibit excellent performance under low-complexity belief-propagation decoding [1], [2]. This phenomenon is now termed threshold saturation via spatial coupling. The…

Information Theory · Computer Science 2013-12-30 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the binary erasure channel, this coupling increases the belief propagation threshold of…

Information Theory · Computer Science 2010-04-22 Shrinivas Kudekar , Cyril Measson , Tom Richardson , Ruediger Urbanke

We study the performance of binary spatially-coupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white…

Information Theory · Computer Science 2013-03-05 Arvind Yedla , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the…

Information Theory · Computer Science 2014-02-17 Stefan Schwandter , Alexandre Graell i Amat , Gerald Matz

Kudekar et al. proved that the belief-propagation (BP) threshold for low-density parity-check codes can be boosted up to the maximum-a-posteriori (MAP) threshold by spatial coupling. In this paper, spatial coupling is applied to…

Information Theory · Computer Science 2011-04-21 Keigo Takeuchi , Toshiyuki Tanaka , Tsutomu Kawabata

We study LDPC codes for the channel with $2^m$-ary input $\underline{x}\in \mathbb{F}_2^m$ and output $\underline{y}=\underline{x}+\underline{z}\in \mathbb{F}_2^m$. The receiver knows a subspace $V\subset \mathbb{F}_2^m$ from which…

Information Theory · Computer Science 2012-05-22 Kenta Kasai , Takayuki Nozaki , Kohichi Sakaniwa

In this paper, we introduce the concept of spatially coupled turbo codes (SC-TCs), as the turbo codes counterpart of spatially coupled low-density parity-check codes. We describe spatial coupling for both Berrou et al. and Benedetto et al.…

Information Theory · Computer Science 2014-07-23 Saeedeh Moloudi , Michael Lentmaier , Alexandre Graell i Amat

We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an…

Information Theory · Computer Science 2011-10-04 Arvind Yedla , Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

Kudekar et al. proved an interesting result in low-density parity-check (LDPC) convolutional codes: The belief-propagation (BP) threshold is boosted to the maximum-a-posteriori (MAP) threshold by spatial coupling. Furthermore, the authors…

Information Theory · Computer Science 2015-05-27 Keigo Takeuchi , Toshiyuki Tanaka , Tsutomu Kawabata

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying…

Information Theory · Computer Science 2013-07-16 Vahid Aref , Laurent Schmalen , Stephan ten Brink

Spatially-Coupled LDPC (SC-LDPC) ensembles achieve the capacity of binary memoryless channels (BMS), asymptotically, under belief-propagation (BP) decoding. In this paper, we study the BP decoding of these code ensembles over a BMS channel…

Information Theory · Computer Science 2016-07-05 Vahid Aref , Narayanan Rengaswamy , Laurent Schmalen

In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative…

Information Theory · Computer Science 2014-11-18 Lai Wei , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello
‹ Prev 1 2 3 10 Next ›