English
Related papers

Related papers: Comparison of Windowed-Decoder Configurations for …

200 papers

Low-density parity-check (LDPC) convolutional codes have been shown to exhibit excellent performance under low-complexity belief-propagation decoding [1], [2]. This phenomenon is now termed threshold saturation via spatial coupling. The…

Information Theory · Computer Science 2013-12-30 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph J. Boutros , Marc Moeneclaey

In the emerging field of goal-oriented communications, the focus has shifted from reconstructing data to directly performing specific learning tasks, such as classification, segmentation, or pattern recognition, on the received coded data.…

Image and Video Processing · Electrical Eng. & Systems 2025-03-18 Ahcen Aliouat , Elsa Dupraz

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that have excellent performance thanks to the degrees of freedom they offer. An SC code is designed by partitioning a base matrix into components, the number…

Information Theory · Computer Science 2026-05-11 Bade Aksoy , Doğukan Özbayrak , Ahmed Hareedy

The non-binary low-density parity-check (NB-LDPC) codes can offer promising performance advantages but suffer from high decoding complexity. To tackle this challenge, in this paper, we consider NB-LDPC codes over finite fields as codes over…

Information Theory · Computer Science 2024-10-30 V. B. Wijekoon , Emanuele Viterbo , Yi Hong

We investigate random spatially coupled low-density parity-check (SC-LDPC) code ensembles over finite fields. Under different variable-node edge-spreading rules, the random Tanner graphs of several coupled ensembles are defined by multiple…

Information Theory · Computer Science 2026-01-01 Jiaxin Lyu , Guanghui He

This paper is concerned with linear superposition systems in which all components of the superimposed signal are coded with an identical binary low-density parity-check (LDPC) code.

Information Theory · Computer Science 2019-09-23 Shancheng Zhao , Xiao Ma , Baoming Bai

Owing to their capacity-achieving performance and low encoding and decoding complexity, polar codes have drawn much research interests recently. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two common…

Information Theory · Computer Science 2017-03-17 Syed Mohsin Abbas , YouZhe Fan , Ji Chen , Chi-Ying Tsui

We introduce a sliding window decoder based on belief propagation (BP) with guided decimation for the purposes of decoding quantum low-density parity-check codes in the presence of circuit-level noise. Windowed decoding keeps the decoding…

Quantum Physics · Physics 2024-03-29 Anqi Gong , Sebastian Cammerer , Joseph M. Renes

We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized…

Quantum Physics · Physics 2010-02-11 Min-Hsiu Hsieh , Todd A. Brun , Igor Devetak

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…

Information Theory · Computer Science 2016-11-18 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication.…

Information Theory · Computer Science 2025-08-12 Roxana Smarandache , David G. M. Mitchell , Anthony Gómez-Fonseca

Low-density parity-check (LDPC) codes are an important feature of several communication and storage applications, offering a flexible and effective method for error correction. These codes are computationally complex and require the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-06 Oscar Ferraz , Vitor Silva , Gabriel Falcao

The recent development of deep learning methods provides a new approach to optimize the belief propagation (BP) decoding of linear codes. However, the limitation of existing works is that the scale of neural networks increases rapidly with…

Information Theory · Computer Science 2021-02-11 Jincheng Dai , Kailin Tan , Zhongwei Si , Kai Niu , Mingzhe Chen , H. Vincent Poor , Shuguang Cui

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

In this paper, we propose a novel low complexity scaling strategy of min-sum decoding algorithm for irregular LDPC codes. In the proposed method, we generalize our previously proposed simplified Variable Scaled Min-Sum (SVS-min-sum) by…

Information Theory · Computer Science 2015-01-30 Ahmed A. Emran , Maha Elsabrouty

For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction…

Information Theory · Computer Science 2017-04-19 Sebastian Cammerer , Laurent Schmalen , Vahid Aref , Stephan ten Brink

For a multiple-input multiple-output (MIMO) system with unknown channel state information (CSI), a novel low-density parity check (LDPC)-coded transmission (LCT) scheme with joint pilot and data channel estimation is proposed. To fine-tune…

Information Theory · Computer Science 2023-11-14 Binghui Shi , Yongpeng Wu , Peihong Yuan , Derrick Wing Kwan Ng , Xiang-Gen Xia , Wenjun Zhang

This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

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