English
Related papers

Related papers: Efficient Probabilistic Parity Shaping for Irregul…

200 papers

In this study, the performance of generalized low-density parity-check (GLDPC) codes under the a posteriori probability (APP) decoder is analyzed. We explore the concentration, symmetry, and monotonicity properties of GLDPC codes under the…

Information Theory · Computer Science 2024-08-07 Dongxu Chang , Qingqing Peng , Zhiming Ma , Guanghui Wang , Dawei Yin

Forward error correcting (FEC) codes are used in many communication standards with a wide range of re quirements. FEC codes should work close to capacity, achieve low error floors, and have low decoding complexity. In this paper, we propose…

Information Theory · Computer Science 2025-05-26 Vincent Wüst , Erdem Eray Cil , Laurent Schmalen

A class of doubly-generalized low-density parity-check (D-GLDPC) codes, where single parity-check (SPC) codes are used as variable nodes (VNs), is investigated. An expression for the growth rate of the weight distribution of any D-GLDPC…

Information Theory · Computer Science 2016-11-17 E. Paolini , M. F. Flanagan , M. Chiani , M. P. C. Fossorier

It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linearly with block length and that they are capable of achieving…

Information Theory · Computer Science 2015-03-19 David. G. M. Mitchell , Michael Lentmaier , Daniel J. Costello,

In this work, we present an adaptive reliability-driven conditional innovation (AR-CID) decoding algorithm for low-density parity check (LDPC) codes. The proposed AR-CID decoding algorithm consists of one stage of message quality checking…

Information Theory · Computer Science 2026-01-13 Hassan Touati , Rodrigo C. de Lamare

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the…

Information Theory · Computer Science 2015-03-17 Shengtian Yang , Thomas Honold , Yan Chen , Zhaoyang Zhang , Peiliang Qiu

We propose a new low-density parity-check code construction scheme based on 2-lifts. The proposed codes have an advantage of admitting efficient hardware implementations. With the motivation of designing codes with low error floors, we…

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

Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure…

Information Theory · Computer Science 2008-04-21 Enrico Paolini , Gianluigi Liva , Michela Varrella , Balazs Matuz , Marco Chiani

Low-density parity-check (LDPC) codes on symmetric memoryless channels have been analyzed using statistical physics by several authors. In this paper, statistical mechanical analysis of LDPC codes is performed for asymmetric memoryless…

Information Theory · Computer Science 2011-10-11 Ryuhei Mori , Toshiyuki Tanaka

Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor…

Information Theory · Computer Science 2016-08-17 C. T. Healy , R. C. de Lamare

In a digital communication system, information is sent from one place to another over a noisy communication channel. It may be possible to detect and correct errors that occur during the transmission if one encodes the original information…

Information Theory · Computer Science 2017-08-21 Banu Kabakulak , Z. Caner Taşkın , Ali Emre Pusane

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

This paper basically expresses the core fundamentals and brief overview of the research of R. G. GALLAGER [1] on Low-Density Parity-Check (LDPC) codes and various parameters related to LDPC codes like, encoding and decoding of LDPC codes,…

Information Theory · Computer Science 2020-09-21 Saumya Borwankar , Dhruv Shah

In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative…

Information Theory · Computer Science 2016-11-17 Byung-Hak Kim , Henry D. Pfister

An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the…

Information Theory · Computer Science 2017-05-31 Stanislav Kruglik , Valeriya Potapova , Alexey Frolov

We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output…

Information Theory · Computer Science 2016-11-17 André Uchoa , Cornelius T. Healy , Rodrigo C. de Lamare

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

Most existing works on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assume that the degree distributions of the two ends of a randomly selected edge are independent. In the paper, we take one step…

Information Theory · Computer Science 2023-04-20 Hsiao-Wen Yu , Cheng-En Lee , Ruhui Zhang , Cheng-Shang Chang , Duan-Shin Lee

We consider codes for channels with extreme noise that emerge in various low-power applications. Simple LDPC-type codes with parity checks of weight 3 are first studied for any dimension $m\rightarrow\infty.$ These codes form modulation…

Information Theory · Computer Science 2021-01-26 Ilya Dumer , Navid Gharavi

This short paper explores density evolution (DE) for low-density parity-check (LDPC) codes at signal-to-noise-ratios (SNRs) that are significantly above the decoding threshold. The focus is on the additive white Gaussian noise channel and…

Information Theory · Computer Science 2014-09-22 Brian K. Butler , Paul H. Siegel
‹ Prev 1 3 4 5 6 7 10 Next ›