English
Related papers

Related papers: Threshold Analysis of Non-Binary Spatially-Coupled…

200 papers

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

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

In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword. LDPC codes…

Information Theory · Computer Science 2024-10-30 Beomkyu Shin , Seokbeom Hong , Hosung Park , Jong-Seon No , Dong-Joon Shin

This paper investigates decoder diversity architectures for short low-density parity-check (LDPC) codes, based on recurrent neural network (RNN) models of the belief-propagation (BP) algorithm. We propose a new approach to achieve decoder…

Information Theory · Computer Science 2022-11-28 Joachim Rosseel , Valérian Mannoni , Inbar Fijalkow , Valentin Savin

A new protograph-based framework for message passing (MP) decoding of low density parity-check (LDPC) codes with Hamming weight amplifiers (HWAs), which are used e.g. in the NIST post-quantum crypto candidate LEDAcrypt, is proposed. The…

Cryptography and Security · Computer Science 2020-02-10 Hannes Bartz , Emna Ben Yacoub , Lorenza Bertarelli , Gianluigi Liva

This paper investigates the design of spatially coupled low-density parity-check (SC-LDPC) codes constructed from connected-chain ensembles for bit-interleaved coded modulation (BICM) schemes. For short coupling lengths, connecting multiple…

Information Theory · Computer Science 2021-07-08 Yihuan Liao , Min Qiu , Jinhong Yuan

We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance…

Information Theory · Computer Science 2021-09-08 Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva , Alex Alvarado

This work shows how non-binary low-density parity-check codes over GF($2^p$) can be combined with probabilistic amplitude shaping (PAS) (B\"ocherer, et al., 2015), which combines forward-error correction with non-uniform signaling for…

Information Theory · Computer Science 2017-08-21 Fabian Steiner , Gianluigi Liva , Georg Böcherer

In this paper, we introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC).…

Information Theory · Computer Science 2016-11-18 H. Tavakoli , M. Ahmadian Attari , M. Reza Peyghami

In this paper, we introduce two new methods of mitigating decoder error propagation for low-latency sliding window decoding (SWD) of spatially coupled low density parity check (SC-LDPC) codes. Building on the recently introduced idea of…

Information Theory · Computer Science 2020-04-21 Min Zhu , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). The proposed method is much simpler, faster,…

Information Theory · Computer Science 2021-03-02 H. Tavakoli , M. Ahmadian Attari , M. R. Peyghami

Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve…

Information Theory · Computer Science 2018-04-30 Elia Santi , Christian Häger , Henry D. Pfister

Regular spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we…

Information Theory · Computer Science 2018-02-20 Vahid Aref , Narayanan Rengaswamy , Laurent Schmalen

Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention. In this approach, mutual-information maximizing lookup tables replace the conventional operations of the…

Information Theory · Computer Science 2019-10-24 Maximilian Stark , Jan Lewandowsky , Souradip Saha , Gerhard Bauch

A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable…

Information Theory · Computer Science 2009-04-24 Ingmar Land , Gottfried Lechner , Lars K. Rasmussen

Efficient decoding is crucial to high-throughput and power-sensitive wireless communication scenarios. A theoretical analysis of the performance-complexity tradeoff toward low-complexity decoding is required for a better understanding of…

Information Theory · Computer Science 2025-11-12 Qingqing Peng , Dawei Yin , Dongxu Chang , Yuan Li , Huazi Zhang , Guiying Yan , Guanghui Wang

This paper is concerned with the application of nonbinary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference (ISI) channels. Two low-complexity joint detection/decoding algorithms are proposed. One is…

Information Theory · Computer Science 2012-09-13 Shancheng Zhao , Zhifei Lu , Xiao Ma , Baoming Bai

The theoretical analysis of detection and decoding of low-density parity-check (LDPC) codes transmitted over channels with two-dimensional (2D) interference and additive white Gaussian noise (AWGN) is provided in this paper. The detection…

Information Theory · Computer Science 2017-01-17 Jun Yao , Kah Chan Teh , Kwok Hung Li

We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding. For fixed numbers of BP iterations, the bit error probability approaches a limit as…

Information Theory · Computer Science 2016-11-17 Ryuhei Mori , Toshiyuki Tanaka , Kenta Kasai , Kohichi Sakaniwa

The Extended Min-Sum (EMS) algorithm for non-binary low-density parity-check (LDPC) defined over an alphabet of size $q$ operates on truncated messages of length $q'$ to achieve a complexity of the order $q'^2$. In contrast, Walsh-Hadamard…

Information Theory · Computer Science 2014-07-22 Jossy Sayir