English
Related papers

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

200 papers

We recently proved threshold saturation for spatially coupled sparse superposition codes on the additive white Gaussian noise channel. Here we generalize our analysis to a much broader setting. We show for any memoryless channel that…

Information Theory · Computer Science 2016-03-16 Jean Barbier , Mohamad Dia , Nicolas Macris

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

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 codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach capacity, as…

Information Theory · Computer Science 2012-12-03 Aravind R. Iyengar , Paul H. Siegel , Rudiger L. Urbanke , Jack K. Wolf

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

We study the scaling behavior of coupled sparse graph codes over the binary erasure channel. In particular, let 2L+1 be the length of the coupled chain, let M be the number of variables in each of the 2L + 1 local copies, let l be the…

Information Theory · Computer Science 2011-07-13 Pablo M. Olmos , Rüdiger Urbanke

We investigate random spatially coupled low-density parity-check (SC-LDPC) code ensembles over finite fields. Under different variable-node edge-spreading rules, the random Tanner graphs of several coupled ensembles are defined by multiple…

Information Theory · Computer Science 2026-01-01 Jiaxin Lyu , Guanghui He

In this paper, we introduce the concept of spatially coupled turbo-like codes (SC-TCs) as the spatial coupling of a number of turbo-like code ensembles. In particular, we consider the spatial coupling of Berrou et al. parallel concatenated…

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

Spatial coupling was proved to improve the belief-propagation (BP) performance up to the maximum-a-posteriori (MAP) performance. This paper addresses an extended class of spatially coupled (SC) systems. A potential function is derived for…

Information Theory · Computer Science 2014-04-21 Keigo Takeuchi

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

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

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

Kudekar et al. recently proved that for transmission over the binary erasure channel (BEC), spatial coupling of LDPC codes increases the BP threshold of the coupled ensemble to the MAP threshold of the underlying LDPC codes. One major…

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

In this paper, we give an overview of spatially coupled turbo codes (SC-TCs), the spatial coupling of parallel and serially concatenated convolutional codes, recently introduced by the authors. For presentation purposes, we focus on…

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

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

An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is…

Information Theory · Computer Science 2016-11-17 Michael Lentmaier , Arvind Sridharan , Kamil Sh. Zigangirov , Daniel J. Costello

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

This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels.…

Information Theory · Computer Science 2016-11-17 Igal Sason