English
Related papers

Related papers: Windowed Decoding of Spatially Coupled Codes

200 papers

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

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

In this paper, we investigate the performance of a class of spatially coupled codes, namely partially information coupled turbo codes (PIC-TCs) over the binary erasure channel (BEC). This class of codes enjoy flexible code rate adjustment…

Information Theory · Computer Science 2019-06-18 Min Qiu , Xiaowei Wu , Yixuan Xie , Jinhong Yuan

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

This paper investigates the belief propagation decoding of spatially-coupled MacKay-Neal (SC-MN) codes over erasure channels with memory. We show that SC-MN codes with bounded degree universally achieve the symmetric information rate (SIR)…

Information Theory · Computer Science 2015-01-28 Masaru Fukushima , Takuya Okazaki , Kenta Kasai

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

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 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 (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an…

Information Theory · Computer Science 2021-09-21 Siyi Yang , Ahmed Hareedy , Robert Calderbank , Lara Dolecek

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications. They also find application in various data storage systems because of their…

Information Theory · Computer Science 2021-01-26 Siyi Yang , Ahmed Hareedy , Shyam Venkatasubramanian , Robert Calderbank , Lara Dolecek

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

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 Low-Density Parity-Check (SC-LDPC) codes offer excellent decoding performance and can be elegantly decoded with a Windowed Decoder (WD). We determine an efficient WD configuration with low control overhead. For fair…

Signal Processing · Electrical Eng. & Systems 2020-04-28 Janik Frenzel , Stefan Müller-Weinfurtner , Johannes Huber , Ralf Müller

The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on…

Information Theory · Computer Science 2016-07-12 Shrinivas Kudekar , Santhosh Kumar , Marco Mondelli , Henry D. Pfister , Rüdiger Urbanke

We consider communication over memoryless channels using low-density parity-check code ensembles above the iterative (belief propagation) threshold. What is the computational complexity of decoding (i.e., of reconstructing all the typical…

Information Theory · Computer Science 2007-07-13 Cyril Measson , Andrea Montanari , Tom Richardson , Rudiger 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

The code that combines channel estimation and error protection has received general attention recently, and has been considered a promising methodology to compensate multi-path fading effect. It has been shown by simulations that such code…

Information Theory · Computer Science 2007-12-18 Chia-Lung Wu , Po-Ning Chen , Yunghsiang S. Han , Ming-Hsin Kuo

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