English
Related papers

Related papers: Threshold Saturation on BMS Channels via Spatial C…

200 papers

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

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

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 investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a-priori…

Information Theory · Computer Science 2012-01-17 Shrinivas Kudekar , Tom Richardson , Ruediger Urbanke

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

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

Convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing as a function of the average degree. Several variations on the basic theme have been proposed to…

Information Theory · Computer Science 2016-11-17 Shrinivas Kudekar , Tom Richardson , Ruediger Urbanke

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

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 low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now…

Information Theory · Computer Science 2015-01-16 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

We consider transmission over a wiretap channel where both the main channel and the wiretapper's channel are Binary Erasure Channels (BEC). We use convolutional LDPC ensembles based on the coset encoding scheme. More precisely, we consider…

Information Theory · Computer Science 2011-07-20 Vishwambhar Rathi , Ruediger Urbanke , Mattias Andersson , Mikael Skoglund

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

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular…

Information Theory · Computer Science 2015-03-20 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We…

Information Theory · Computer Science 2011-08-03 Vahid Aref , Rüdiger L. Urbanke

In this paper we prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC…

Information Theory · Computer Science 2015-08-11 Saeedeh Moloudi , Michael Lentmaier , Alexandre Graell i Amat

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

Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation…

Information Theory · Computer Science 2013-01-25 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

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

We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove threshold saturation of the belief propagation decoding to the…

Information Theory · Computer Science 2014-07-23 Alexandre Graell i Amat , Iryna Andriyanova , Amina Piemontese

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this…

Information Theory · Computer Science 2016-11-17 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

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
‹ Prev 1 2 3 10 Next ›