English
Related papers

Related papers: A Refined Scaling Law for Spatially Coupled LDPC C…

200 papers

In many practical communication systems, one binary encoder/decoder pair is used to communicate over a set of parallel channels. Examples of this setup include multi-carrier transmission, rate-compatible puncturing of turbo-like codes, and…

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

The complexity-performance trade-off is a fundamental aspect of the design of low-density parity-check (LDPC) codes. In this paper, we consider LDPC codes for the binary erasure channel (BEC), use code rate for performance metric, and…

Information Theory · Computer Science 2016-11-17 Vahid Jamali , Yasser Karimian , Johannes Huber , Mahmoud Ahmadian

In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes…

Signal Processing · Electrical Eng. & Systems 2020-03-04 Yang Yu , Wen Chen , Lili Wei

We consider the dynamics of message passing for spatially coupled codes and, in particular, the set of density evolution equations that tracks the profile of decoding errors along the spatial direction of coupling. It is known that, for…

Information Theory · Computer Science 2017-01-17 Rafah El-Khatib , Nicolas Macris

We show that spatially coupled low-density parity-check (LDPC) codes yield robust performance over changing intersymbol interfere (ISI) channels with optimal and suboptimal detectors. We compare the performance with classical LDPC code…

Information Theory · Computer Science 2024-04-19 Mgeni Makambi Mashauri , Alexandre Graell i Amat , Michael Lentmaier

Based on the extended binary image of non-binary LDPC codes, we propose a method for generating extra redundant bits, such as to decreases the coding rate of a mother code. The proposed method allows for using the same decoder, regardless…

Information Theory · Computer Science 2011-03-15 Lam Pham Sy , Valentin Savin , David Declercq

This paper investigates the design of self-connected spatially coupled low-density parity-check (SC-LDPC) codes. First, a termination method is proposed to reduce rate loss. Particularly, a single-side open SC-LDPC ensemble is introduced,…

Information Theory · Computer Science 2023-07-03 Yihuan Liao , Min Qiu , Jinhong Yuan

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

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative…

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

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

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying…

Information Theory · Computer Science 2013-07-16 Vahid Aref , Laurent Schmalen , Stephan ten Brink

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 2017-01-27 Laurent Schmalen , Vahid Aref , Fanny Jardel

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

Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which form the trapping sets. We…

Information Theory · Computer Science 2010-02-24 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari

Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes \cite{Kschischang01}. An…

Information Theory · Computer Science 2009-08-27 Xudong Ma , En-hui Yang

We propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analysis tools such as…

Information Theory · Computer Science 2008-01-24 Hamid Saeedi , Amir H. Banihashemi

For a multiple-input multiple-output (MIMO) system with unknown channel state information (CSI), a novel low-density parity check (LDPC)-coded transmission (LCT) scheme with joint pilot and data channel estimation is proposed. To fine-tune…

Information Theory · Computer Science 2023-11-14 Binghui Shi , Yongpeng Wu , Peihong Yuan , Derrick Wing Kwan Ng , Xiang-Gen Xia , Wenjun Zhang

We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based…

Information Theory · Computer Science 2016-11-09 J. Van Wonterghem , A. Alloum , J. J. Boutros , M. Moeneclaey

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