English
Related papers

Related papers: A Phenomenological Study on Threshold Improvement …

200 papers

To alleviate the suboptimal performance of belief propagation (BP) decoding of short low-density parity-check (LDPC) codes, a plethora of improved decoding algorithms has been proposed over the last two decades. Many of these methods can be…

Information Theory · Computer Science 2024-11-01 Felix Krieg , Jannis Clausius , Marvin Geiselhart , Stephan ten Brink

Constellation shaping is an energy-efficient strategy involving the transmission of lower-energy signals more frequently than higher-energy signals. Previous work has shown that shaping is particularly effective when used with coded…

Information Theory · Computer Science 2012-10-18 Xingyu Xiang , Matthew C. Valenti

In this paper, we study the density evolution analysis of spatially coupled low-density parity-check (SC-LDPC) codes over binary input additive white Gaussian noise (BIAWGN) channels under the belief propagation (BP) decoding algorithm.…

Information Theory · Computer Science 2015-10-19 Md. Noor-A-Rahim , Gottfried Lechner , Khoa D. Nguyen

Recently, a new class of codes, called sparse superposition or sparse regression codes, has been proposed for communication over the AWGN channel. It has been proven that they achieve capacity using power allocation and various forms of…

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

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

Spatially coupled, parallel concatenated codes (SC-PCCs) have been shown to approach channel capacity when decoded using optimal iterative methods. However, under complexity constraints such decoding strategies can result in unacceptable…

Information Theory · Computer Science 2021-09-07 Andrew D. Cummins , David G. M. Mitchell , Daniel J. Costello,

In this paper, we study the application of spatially coupled LDPC codes with sub-block locality for space division multiplexing. We focus on the information exchange between the sub-blocks and compare decoding strategies with respect to the…

Information Theory · Computer Science 2023-10-25 Haizheng Li , Laurent Schmalen

It is known that windowed decoding (WD) can effectively balance the performance and complexity of spatially coupled low-density parity-check (LDPC) codes. In this study, we show that information can propagate in a wave-like manner at a…

Information Theory · Computer Science 2025-07-10 Qingqing Peng , Dongxu Chang , Guanghui Wang , Guiying Yan

We study a new encoding scheme for lossy source compression based on spatially coupled low-density generator-matrix codes. We develop a belief-propagation guided-decimation algorithm, and show that this algorithm allows to approach the…

Information Theory · Computer Science 2012-02-23 Vahid Aref , Nicolas Macris , Rudiger Urbanke , Marc Vuffray

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

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

Information Theory · Computer Science 2016-11-18 Lai Wei , Toshiaki Koike-Akino , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

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

We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore…

Information Theory · Computer Science 2022-08-17 Marvin Geiselhart , Moustafa Ebada , Ahmed Elkelesh , Jannis Clausius , Stephan ten Brink

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

We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in…

Information Theory · Computer Science 2016-11-15 Constantinos Daskalakis , Alexandros G. Dimakis , Richard M. Karp , Martin J. Wainwright

This paper investigates the design of spatially coupled low-density parity-check (SC-LDPC) codes constructed from connected-chain ensembles for bit-interleaved coded modulation (BICM) schemes. For short coupling lengths, connecting multiple…

Information Theory · Computer Science 2021-07-08 Yihuan Liao , Min Qiu , Jinhong Yuan

A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…

Information Theory · Computer Science 2007-07-13 Oscar Y. Takeshita

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

A low-density parity-check (LDPC) code is a linear block code described by a sparse parity-check matrix, which can be efficiently represented by a bipartite Tanner graph. The standard iterative decoding algorithm, known as belief…

Information Theory · Computer Science 2016-05-17 Sachini Jayasooriya , Sarah J. Johnson , Lawrence Ong , Regina Berretta

In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation,…

Information Theory · Computer Science 2017-04-18 Laurent Schmalen , Stephan ten Brink , Andreas Leven