English
Related papers

Related papers: Rate-Equivocation Optimal Spatially Coupled LDPC C…

200 papers

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

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 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

We consider transmission over a wiretap channel where both the main channel and the wiretapper's channel are Binary Erasure Channels (BEC). We propose a code construction method using two edge type LDPC codes based on the coset encoding…

Information Theory · Computer Science 2016-11-17 Vishwambhar Rathi , Mattias Andersson , Ragnar Thobaben , Joerg Kliewer , Mikael Skoglund

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

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

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 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

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

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

In this paper, we derive the exact input/output transfer functions of the optimal a-posteriori probability channel detector for a general ISI channel with erasures. Considering three channel impulse responses of different memory as an…

Information Theory · Computer Science 2024-04-17 Mgeni Makambi Mashauri , Alexandre Graell i Amat , Michael Lentmaier

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

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

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

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

In many practical communication systems, one binary encoder/decoder pair is used to communicate over a set of parallel channels. Examples of this setup include multi-carrier transmission, rate-compatible puncturing of turbo-like codes, and…

Information Theory · Computer Science 2024-01-25 Christian Häger , Alexandre Graell i Amat , Alex Alvarado , Fredrik Brännström , Erik Agrell

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

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

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

We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of…

Information Theory · Computer Science 2010-10-26 Ananda T. Suresh , Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven McLaughlin
‹ Prev 1 2 3 10 Next ›