English
Related papers

Related papers: Braided Convolutional Codes -- A Class of Spatiall…

200 papers

The excellent performance of convolutional low-density parity-check codes is the result of the spatial coupling of individual underlying codes across a window of growing size, but much smaller than the length of the individual codes.…

Information Theory · Computer Science 2011-05-05 S. Hamed Hassani , Nicolas Macris , Ruediger Urbanke

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

Spatially coupled codes have been shown to universally achieve the capacity for a large class of channels. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is…

Information Theory · Computer Science 2019-12-09 Dimitris Achlioptas , Hamed Hassani , Wei Liu , Rüdiger Urbanke

Partially information coupled turbo codes (PIC-TCs) is a class of spatially coupled turbo codes that can approach the BEC capacity while keeping the encoding and decoding architectures of the underlying component codes unchanged. However,…

Information Theory · Computer Science 2020-06-23 Xiaowei Wu , Min Qiu , Jinhong Yuan

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

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

The peeling decoding for spatially coupled low-density parity-check (SC-LDPC) codes is analyzed for a binary erasure channel. An analytical calculation of the mean evolution of degree-one check nodes of protograph-based SC-LDPC codes is…

Information Theory · Computer Science 2014-02-03 Markus Stinner Pablo M. Olmos

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

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

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

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

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical…

Information Theory · Computer Science 2015-12-16 Sebastian Cammerer , Vahid Aref , Laurent Schmalen , Stephan ten Brink

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take either an asymptotic or a finite-length design approach, in…

Information Theory · Computer Science 2022-09-02 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

In this paper, we highlight the class of spatially coupled codes and discuss their applicability to long-haul and submarine optical communication systems. We first demonstrate how to optimize irregular spatially coupled LDPC codes for their…

Information Theory · Computer Science 2016-06-03 Laurent Schmalen , Detlef Suikat , Detlef Rösener , Vahid Aref , Andreas Leven , Stephan ten Brink

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

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2019-07-09 Laurent Schmalen , Vahid Aref

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…

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

We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC…

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