English
Related papers

Related papers: Spatially Coupled Turbo-Like Codes

200 papers

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

The aim of this paper is to show that spatial coupling can be viewed not only as a means to build better graphical models, but also as a tool to better understand uncoupled models. The starting point is the observation that some asymptotic…

Information Theory · Computer Science 2015-08-27 Andrei Giurgiu , Nicolas Macris , Rüdiger Urbanke

Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers…

Information Theory · Computer Science 2016-11-17 Daniel J. Costello, , Lara Dolecek , Thomas E. Fuja , Joerg Kliewer , David G. M. Mitchell , Roxana Smarandache

For a given family of spatially coupled codes, we prove that the LP threshold on the BSC of the graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ensemble. This result is in contrast with the…

Information Theory · Computer Science 2013-03-06 Louay Bazzi , Badih Ghazi , Rudiger Urbanke

The investigation of spatio-temporal couplings (STCs) of broadband light beams is becoming a key topic for the optimization as well as applications of ultrashort laser systems. This calls for accurate measurements of STCs. Yet, it is only…

This letter proposes a novel method for accelerating iterative detection for spatially coupled (SC) systems. An SC system is constructed by one-dimensional coupling of many subsystems, which are classified into training and propagation…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi

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

We show how the iterative decoding threshold of tailbiting spatially coupled (SC) low-density parity-check (LDPC) code ensembles can be improved over the binary input additive white Gaussian noise channel by allowing the use of different…

Information Theory · Computer Science 2018-02-19 Thomas Jerkovits , Gianluigi Liva , Alexandre Graell i Amat

Several authors have proposed spatially-coupled (or convolutional-like) variants of product codes (PCs). In this paper, we focus on a parametrized family of generalized PCs that recovers some of these codes (e.g., staircase and block-wise…

Information Theory · Computer Science 2016-04-29 Christian Häger , Henry D. Pfister , Alexandre Graell i Amat , Fredrik Brännström

In this paper we are concerned with the asymptotic analysis of nonbinary spatially-coupled low-density parity-check (SC-LDPC) ensembles defined over GL$\left(2^{m}\right)$ (the general linear group of degree $m$ over GF$\left(2\right)$).…

Information Theory · Computer Science 2020-06-23 Zhonghao Zhang , Mengnan Xu , Chongbin Xu , Dan Zeng , Zhichao Sheng

The concept of spatial coupling is among the most significant breakthroughs in coding theory over the past decade. The excellent waterfall and error floor performance of spatially coupled codes has positioned them as promising coding…

Information Theory · Computer Science 2026-05-13 Min Qiu , Xiaowei Wu , Peng Kang , Lei Yang , Jinhong Yuan

Raptor codes are known as precoded rateless codes that achieve the capacity of BEC. However the maximum degree of Raptor codes needs to be unbounded to achieve the capacity. In this paper, we prove that spatially-coupled precoded rateless…

Information Theory · Computer Science 2014-01-29 Kosuke Sakata , Kenta Kasai , Kohichi Sakaniwa

This paper is devoted to the finite-length analysis of turbo decoding over the binary erasure channel (BEC). The performance of iterative belief-propagation (BP) decoding of low-density parity-check (LDPC) codes over the BEC can be…

Information Theory · Computer Science 2011-05-31 Eirik Rosnes , Øyvind Ytrehus

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

In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure…

Information Theory · Computer Science 2014-03-03 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello

Regular spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we…

Information Theory · Computer Science 2018-02-20 Vahid Aref , Narayanan Rengaswamy , Laurent Schmalen

Spatial coupling is utilized to improve the performance of iterative channel estimation, multiuser detection, and decoding for multiple-input multiple-input (MIMO) bit-interleaved coded modulation (BICM). Coupling is applied to both coding…

Information Theory · Computer Science 2014-12-22 Keigo Takeuchi

Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is…

Information Theory · Computer Science 2007-07-13 Alexandre Graell i Amat , Fredrik Brannstrom , Lars K. Rasmussen

In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference…

Information Theory · Computer Science 2016-11-17 Gianluigi Liva , Enrico Paolini , Michael Lentmaier , Marco Chiani

Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled…

Information Theory · Computer Science 2015-05-26 Pablo M. Olmos , Rüdiger Urbanke