English
Related papers

Related papers: Robust Performance Over Changing Intersymbol Inter…

200 papers

We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized…

Quantum Physics · Physics 2010-02-11 Min-Hsiu Hsieh , Todd A. Brun , Igor Devetak

Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth…

Quantum Physics · Physics 2026-01-21 Kenta Kasai

While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the…

Information Theory · Computer Science 2009-02-05 Mohammad H. Taghavi , Amin Shokrollahi , Paul H. Siegel

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…

Information Theory · Computer Science 2009-11-13 Tadashi Wadayama

Sparse regression codes (SPARCs) are a class of codes that encode information through the superposition of columns of a randomised coding matrix. The combination with an outer non-binary low density parity check (NB-LDPC) code was recently…

Information Theory · Computer Science 2025-09-23 Alexander Fengler , Burak Çakmak , Giuseppe Caire

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

We propose an Iterative Detection and Decoding (IDD) scheme with Low Density Parity Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems for block-fading $F = 2$ and fast fading Rayleigh channels. An IDD receiver with soft…

Information Theory · Computer Science 2014-04-09 A. G. D. Uchoa , C. T. Healy , R. C. de Lamare , P. Li

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing…

Information Theory · Computer Science 2016-11-18 Jaehong Kim , Aditya Ramamoorthy , Steven W. McLaughlin

We consider spatially coupled code ensembles over a multiple access channel. Convolutional LDPC ensembles are one instance of spatially coupled codes. It was shown recently that, for transmission over the binary erasure channel, this…

Information Theory · Computer Science 2011-02-15 Shrinivas Kudekar , Kenta Kasai

Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive…

Information Theory · Computer Science 2025-08-28 Diego Lentner , Thomas Wiegart , Richard D. Wesel

One of the challenges often faced with wireless communication systems is its limited range and data-rate. Distributed Transmit Beamforming (DTB) techniques are being developed to address these two issues to provide reliable connectivity…

Signal Processing · Electrical Eng. & Systems 2018-07-18 Ismail Shakeel , Ishtiaq Ahmad , Hajime Suzuki

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

This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the…

Information Theory · Computer Science 2007-07-13 Igal Sason , Gil Wiechman

In this letter, we propose a reliability-based windowed decoding scheme for spatially-coupled (SC) low-density parity-check (LDPC) codes. To mitigate the error propagation along the sliding windowed decoder of the SC LDPC codes, a partial…

Information Theory · Computer Science 2018-05-10 Peng Kang , Yixuan Xie , Lei Yang , Jinhong Yuan

This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti

Quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of LDPC codes with a simple construction facilitating hardware implementation while achieving excellent performance. In this paper, we introduce an algorithm that…

Information Theory · Computer Science 2025-07-15 Haizheng Li , Sisi Miao , Laurent Schmalen

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

In this paper, we give necessary and sufficient conditions for low-density parity-check (LDPC) codes with column-weight three to correct three errors when decoded using hard-decision message-passing decoding. Additionally, we give necessary…

Information Theory · Computer Science 2009-09-29 Shashi Kiran Chilappagari , Anantha Raman Krishnan , Bane Vasic , Michael W. Marcellin

We present a method for estimating the undetected error rate when a cyclic redundancy check (CRC) is performed on the output of the decoder of short low-density parity-check (LDPC) codes. This system is of interest for telecommand links,…

Information Theory · Computer Science 2016-11-18 Marco Baldi , Nicola Maturo , Giacomo Ricciutelli , Franco Chiaraluce