English
Related papers

Related papers: Repeat Accumulate Based Designs for LDPC Codes on …

200 papers

We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9,…

Information Theory · Computer Science 2011-07-14 Kenta Kasai , David Declercq , Charly Poulliat , Kohichi Sakaniwa

Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the…

Information Theory · Computer Science 2013-08-02 Vikram Arkalgud Chandrasetty , Syed Mahfuzul Aziz

The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity}, per information bit, of encoding and decoding. It also…

Information Theory · Computer Science 2009-09-29 Henry D. Pfister , Igal Sason

For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at…

Information Theory · Computer Science 2016-11-17 Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven W. McLaughlin

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

In this paper we present a thorough analysis of non binary LDPC codes over the binary erasure channel. First, the decoding of non binary LDPC codes is investigated. The proposed algorithm performs on-the-fly decoding, i.e. it starts…

Information Theory · Computer Science 2008-10-27 Valentin Savin

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

We study error bounds for linear programming decoding of regular LDPC codes. For memoryless binary-input output-symmetric channels, we prove bounds on the word error probability that are inverse doubly-exponential in the girth of the factor…

Information Theory · Computer Science 2011-04-12 Nissim Halabi , Guy Even

Low Density Parity Check (LDPC) codes are linear error correcting codes used in communication systems for Forward Error Correction (FEC). But, intensive computation is required for encoding and decoding of LDPC codes, making it difficult…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-13 Bhargav Gokalgandhi , Ivan Seskar

Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is $\mathbf{GF}(2)$, and the side information alphabet…

Information Theory · Computer Science 2015-03-20 Jin Meng , En-Hui Yang

This paper proposes an iterative detection and decoding (IDD) scheme and an approach to improve the selection of access points (APs) in uplink cell-free massive multiple-antenna systems. A cost-effective scheme for selection of APs based on…

Information Theory · Computer Science 2023-12-27 R. B. Di Renna , R. C. de Lamare

In this paper a new message passing algorithm, which takes advantage of both tree-based re-parameterization and the knowledge of short cycles, is introduced for the purpose of decoding LDPC codes with short block lengths. The proposed…

Information Theory · Computer Science 2014-03-25 J. Li , R. C. de Lamare

Finite alphabet iterative decoders (FAID) with multilevel messages that can surpass BP in the error floor region for LDPC codes on the BSC were previously proposed. In this paper, we propose decimation-enhanced decoders. The technique of…

Information Theory · Computer Science 2011-03-07 Shiva Kumar Planjery , Bane Vasic , David Declercq

In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from…

Information Theory · Computer Science 2014-03-20 Alexander Gruner , Michael Huber

This paper derives second-order statistics for diversity-combining techniques over Log-mu fading channels. Closed-form expressions for the level crossing rate (LCR) and average fading duration (AFD) are derived for pure selection combining…

Signal Processing · Electrical Eng. & Systems 2025-11-26 Godfred Kumi Tenkorang , Michel Daoud Yacoub

Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density…

Information Theory · Computer Science 2021-02-23 Salman Habib , David G. M. Mitchell , Joerg Kliewer

In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\"ocherer et al. has…

Information Theory · Computer Science 2016-07-04 Fabian Steiner , Patrick Schulte

Departing from traditional communication theory where decoding algorithms are assumed to perform without error, a system where noise perturbs both computational devices and communication channels is considered here. This paper studies…

Information Theory · Computer Science 2010-05-31 Lav R. Varshney

This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a…

Information Theory · Computer Science 2017-01-30 Mohamad Khas Mohamadi , Hamid Saeedi , Reza Asvadi

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic