English
Related papers

Related papers: Refined Reliability Combining for Binary Message P…

200 papers

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

Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed…

Signal Processing · Electrical Eng. & Systems 2020-06-05 Yi Lei , Bin Chen , Gabriele Liga , Xiong Deng , Zizheng Cao , Jianqiang Li , Kun Xu , Alex Alvarado

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 propose an improved soft-aided decoding scheme for product codes that approaches the decoding performance of conventional soft-decision TPD with only a 0.2 dB gap while keeping the complexity and internal decoder data flow similarly low…

Information Theory · Computer Science 2022-07-12 Sisi Miao , Lukas Rapp , Laurent Schmalen

Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, finding a low complexity soft-input decoding scheme is still an…

Information Theory · Computer Science 2021-07-28 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

Although iterative decoding of polar codes has recently made huge progress based on the idea of permuted factor graphs, it still suffers from a non-negligible performance degradation when compared to state-of-the-art CRC-aided successive…

Information Theory · Computer Science 2020-01-20 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

Fault tolerance in quantum protocols requires contributions from error-correcting codes and their suitable decoders. Quantum Low-Density Parity Check (QLDPC) codes are one of the most explored quantum codes that have good coding rate and…

Quantum Physics · Physics 2026-04-24 Mainak Bhattacharyya , Ankur Raina

In this work, we consider the problem of reduced latency of low-density parity-check (LDPC) codes with iterative detection and decoding (IDD) receiver in multiuser multiple-antenna systems. The proposed knowledge-aided IDD (KA-IDD) system…

Information Theory · Computer Science 2018-02-19 P. Li , R. C. de Lamare , J. Liu

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

In this work, we investigate the decoding of Low-Density Parity-Check (LDPC) codes using informed dynamic scheduling algorithms that require a reduced number of iterations. In particular, we devise the weighted residual layered belief…

Information Theory · Computer Science 2024-10-18 H. Touati , R. C. de Lamare

The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary…

Information Theory · Computer Science 2016-11-17 Ian P. Mulholland , Enrico Paolini , Mark F. Flanagan

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

Information Theory · Computer Science 2016-11-18 Lai Wei , Toshiaki Koike-Akino , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

We combine two approaches to optimize the iterative decoding of product codes with precoded polar component codes. On one side, we generate bitwise soft messages based on the codebook probability, an approximation of an auxiliary quantity…

Information Theory · Computer Science 2025-08-29 Nicolás Alvarez Prado , Andreas Straßhofer

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are…

Quantum Physics · Physics 2022-05-06 Nithin Raveendran , Narayanan Rengaswamy , Asit Kumar Pradhan , Bane Vasić

In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which…

Information Theory · Computer Science 2014-11-17 Mostafa El-Khamy , Robert J. McEliece

An iterative algorithm is presented for soft-input-soft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the sum product algorithm (SPA) in conjunction with a binary parity check matrix of the RS…

Information Theory · Computer Science 2009-09-29 Jing Jiang , Krishna R. Narayanan

In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and order statistic decoding (OSD) algorithms. Specifically, a modified BP…

Information Theory · Computer Science 2023-09-06 Weiyang Zhang , Chentao Yue , Yonghui Li , Branka Vucetic

An iterative detection and decoding (IDD) scheme is proposed for multiuser multiple-antenna systems assisted by an active or a passive Reconfigurable Intelligent Surface (RIS). The proposed approach features an IDD strategy that…

Information Theory · Computer Science 2024-12-17 R. Porto , R. C. de Lamare

In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted…

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

Iterative decoders used for decoding low-density parity-check (LDPC) and moderate-density parity-check (MDPC) codes are not characterized by a deterministic decoding radius and their error rate performance is usually assessed through…

Information Theory · Computer Science 2020-02-27 Paolo Santini , Massimo Battaglioni , Marco Baldi , Franco Chiaraluce