English
Related papers

Related papers: Threshold Saturation on BMS Channels via Spatial C…

200 papers

The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of…

Information Theory · Computer Science 2010-07-28 Enrico Paolini , Marc Fossorier , Marco Chiani

The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For…

Information Theory · Computer Science 2007-07-13 Chun-Hao Hsu , Achilleas Anastasopoulos

We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block length is known by density evolution and it is…

Information Theory · Computer Science 2008-01-23 Ryuhei Mori , Kenta Kasai , Tomoharu Shibuya , Kohichi Sakaniwa

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

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

We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code…

Information Theory · Computer Science 2016-11-17 Aravind Iyengar , Marco Papaleo , Paul Siegel , Jack Wolf , Alessandro Vanelli-Coralli , Giovanni Corazza

We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…

Information Theory · Computer Science 2022-07-12 YuHao Liu , Teng Fu , Jean Barbier , TianQi Hou

We study the stability of low-density parity-check (LDPC) codes under blockwise or bitwise maximum $\textit{a posteriori}$ (MAP) decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study…

Information Theory · Computer Science 2024-02-05 Wei Liu , Rüdiger Urbanke

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 consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…

Information Theory · Computer Science 2008-02-12 Satish Babu Korada , Ruediger Urbanke

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via…

Information Theory · Computer Science 2024-09-10 Yuhao Liu , Yizhou Xu , Tianqi Hou

This paper considers the performance of Reed-Muller (RM) codes transmitted over binary memoryless symmetric (BMS) channels under bitwise maximum-a-posteriori (bit-MAP) decoding. Its main result is that, for a fixed BMS channel, the family…

Information Theory · Computer Science 2023-06-14 Galen Reeves , Henry D. Pfister

The performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite-length low-density parity-check (LDPC) codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is…

Information Theory · Computer Science 2018-11-21 Irina E. Bocharova , Boris D. Kudryashov , Vitaly Skachek , Eirik Rosnes , Øyvind Ytrehus

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

Because of their capacity-approaching performance, graph-based codes have a wide range of applications, including communications and storage. In these codes, unequal error protection (UEP) can offer performance gains with limited rate loss.…

Information Theory · Computer Science 2021-01-25 Beyza Dabak , Ahmed Hareedy , Alexei Ashikhmin , Robert Calderbank

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes…

Information Theory · Computer Science 2022-02-25 Min Qiu , Xiaowei Wu , Jinhong Yuan , Alexandre Graell i Amat

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

Spatially coupled turbo-like codes (SC-TCs) have been shown to have excellent decoding thresholds due to the threshold saturation effect. Furthermore, even for moderate block lengths, simulation results demonstrate very good bit error rate…

Information Theory · Computer Science 2018-04-06 Saeedeh Moloudi , Michael Lentmaier , Alexandre Graell i Amat

Raptor codes are rateless codes that achieve the capacity on the binary erasure channels. However the maximum degree of optimal output degree distribution is unbounded. This leads to a computational complexity problem both at encoders and…

Information Theory · Computer Science 2013-02-07 Kosuke Sakata , Kenta Kasai , Kohichi Sakaniwa

In this paper, we propose a new class of quantized message-passing decoders for LDPC codes over the BSC. The messages take values (or levels) from a finite set. The update rules do not mimic belief propagation but instead are derived using…

Information Theory · Computer Science 2016-11-15 Shiva Kumar Planjery , David Declercq , Shashi Kiran Chilappagari , Bane Vasić
‹ Prev 1 3 4 5 6 7 10 Next ›