English
Related papers

Related papers: An Optimization Model for Offline Scheduling Polic…

200 papers

We illustrate the utility of the recently developed loop calculus for improving the Belief Propagation (BP) algorithm. If the algorithm that minimizes the Bethe free energy fails we modify the free energy by accounting for a critical loop…

Information Theory · Computer Science 2007-07-13 Michael Chertkov , Vladimir Y. Chernyak

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range…

Information Theory · Computer Science 2024-02-20 Yuqing Ren , Hassan Harb , Yifei Shen , Alexios Balatsoukas-Stimming , Andreas Burg

We propose a decoder for quantum low density parity check (LDPC) codes based on a beam search heuristic guided by belief propagation (BP). Our beam search decoder applies to all quantum LDPC codes and achieves different speed-accuracy…

Quantum Physics · Physics 2025-12-18 Min Ye , Dave Wecker , Nicolas Delfosse

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

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

A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their…

Information Theory · Computer Science 2017-05-18 Yung-Yih Jian , Henry D. Pfister , Krishna R. Narayanan

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…

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

A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. The method is based on a rigorous approach to spin…

Information Theory · Computer Science 2016-11-18 Andrea Montanari

When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding problem can be stated as a linear program (LP). This LP decoder can be used to decode error-correcting codes at…

Information Theory · Computer Science 2013-09-24 Siddharth Barman , Xishuo Liu , Stark C. Draper , Benjamin Recht

We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an…

Information Theory · Computer Science 2016-11-17 David Burshtein , Idan Goldenberg

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

In this paper we present a new algorithm, denoted as TEP, to decode low-density parity-check (LDPC) codes over the Binary Erasure Channel (BEC). The TEP decoder is derived applying the expectation propagation (EP) algorithm with a tree-…

Information Theory · Computer Science 2012-01-05 Pablo M. Olmos , Juan José Murillo-Fuentes , Fernando Pérez-Cruz

We design and assess some practical low-density parity-check (LDPC) coded transmission schemes for the Gaussian broadcast channel with confidential messages (BCC). This channel model is different from the classical wiretap channel model as…

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

Low-density parity-check (LDPC) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity…

Information Theory · Computer Science 2016-11-17 Ali Sanaei , Mahdi Ramezani , Masoud Ardakani

In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity…

Information Theory · Computer Science 2019-10-31 Kun Cheng , Qiming Lu , Hongbo Xie , Qi Shen , Shengkai Liao , Chengzhi Peng

Belief Propagation (BP) followed by Ordered Statistics Decoding (OSD) has emerged as the gold standard for decoding quantum low-density parity-check (QLDPC) codes. Recent advancements in this field have proposed new methods and algorithms…

Information Theory · Computer Science 2026-05-26 Michele Banfi , Marco Ferrari , Antonino Favano , Alberto Tarable , Luca Barletta

This paper proposes a new iterative gradient descent decoding method for real number parity codes. The proposed decoder, named Gradient Descent Symbol Update (GDSU), is used for a class of low-density parity-check (LDPC) real-number codes…

Information Theory · Computer Science 2024-11-26 Oana Boncalo , Alexandru Amaricai

The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds…

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

This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner sparse regression code (SPARC) whose respective field size and…

Information Theory · Computer Science 2024-10-28 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

One of the major challenges in Wireless Body Area Networks (WBANs) is to prolong the lifetime of network. Traditional research work focuses on minimizing transmit power; however, in the case of short range communication the consumption…

Networking and Internet Architecture · Computer Science 2013-09-18 O. Rehman , N. Javaid , A. Haider , N. Amjad , A. A. Awan , M. Qamar , Z. A. Khan , U. Qasim