English
Related papers

Related papers: Reliability-Based Windowed Decoding for Spatially-…

200 papers

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

While low-density parity-check (LDPC) codes are near capacity-achieving when paired with iterative decoders, these decoders may not output a codeword due to the existence of pseudocodewords. Thus, pseudocodewords have been studied to give…

Information Theory · Computer Science 2025-12-03 Wittawat Kositwattanarerk , Gretchen L. Matthews , Emily McMillon , Tunchanok Yutitumsatit

We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the…

Information Theory · Computer Science 2014-02-17 Stefan Schwandter , Alexandre Graell i Amat , Gerald Matz

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

This paper outlines a three-step procedure for determining the low bit error rate performance curve of a wide class of LDPC codes of moderate length. The traditional method to estimate code performance in the higher SNR region is to use a…

Information Theory · Computer Science 2007-07-13 Chad A. Cole , Stephen G. Wilson , Eric. K. Hall , Thomas R. Giallorenzi

Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear…

Information Theory · Computer Science 2013-02-07 Koji Tazoe , Kenta Kasai , Kohichi Sakaniwa

Low-density parity-check (LDPC) codes are specified by graphs, and are the error correction technique of choice in many communications and data storage contexts. Message passing decoders diffuse information carried by parity bits into the…

Information Theory · Computer Science 2023-05-02 Beyza Dabak , Ece Tiryaki , Robert Calderbank , Ahmed Hareedy

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

The equivalence of peeling decoding (PD) and Belief Propagation (BP) for low-density parity-check (LDPC) codes over the binary erasure channel is analyzed. Modifying the scheduling for PD, it is shown that exactly the same variable nodes…

Information Theory · Computer Science 2016-04-19 Markus Stinner , Luca Barletta , Pablo M. Olmos

Distributed storage systems suffer from significant repair traffic generated due to frequent storage node failures. This paper shows that properly designed low-density parity-check (LDPC) codes can substantially reduce the amount of…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-17 Hyegyeong Park , Dongwon Lee , Jaekyun Moon

In this paper, we study the application of spatially coupled LDPC codes with sub-block locality for space division multiplexing. We focus on the information exchange between the sub-blocks and compare decoding strategies with respect to the…

Information Theory · Computer Science 2023-10-25 Haizheng Li , Laurent Schmalen

In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed…

Information Theory · Computer Science 2016-11-17 Dung Viet Nguyen , Bane Vasic , Michael W. Marcellin

Non-binary low-density parity-check (LDPC) codes have some advantages over their binary counterparts, but unfortunately their decoding complexity is a significant challenge. The iterative hard- and soft-reliability based majority-logic…

Information Theory · Computer Science 2015-06-22 Chenrong Xiong , Zhiyuan Yan

The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures -- variously referred to as near codewords, trapping…

Information Theory · Computer Science 2013-09-11 Xiaojie Zhang , Paul H. Siegel

Quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of LDPC codes with a simple construction facilitating hardware implementation while achieving excellent performance. In this paper, we introduce an algorithm that…

Information Theory · Computer Science 2025-07-15 Haizheng Li , Sisi Miao , Laurent Schmalen

This paper presents novel techniques for improving the error correction performance and reducing the complexity of coarsely quantized 5G-LDPC decoders. The proposed decoder design supports arbitrary message-passing schedules on a…

Information Theory · Computer Science 2025-08-19 Philipp Mohr , Gerhard Bauch

Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result…

Information Theory · Computer Science 2021-04-19 David G. M. Mitchell , Pablo M. Olmos , Michael Lentmaier , Daniel J. Costello

In this work, we present an adaptive reliability-driven conditional innovation (AR-CID) decoding algorithm for low-density parity check (LDPC) codes. The proposed AR-CID decoding algorithm consists of one stage of message quality checking…

Information Theory · Computer Science 2026-01-13 Hassan Touati , Rodrigo C. de Lamare

We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of ones of the parity-check matrix of the codes presented is typically higher than the…

Information Theory · Computer Science 2009-11-18 Samuel Ouzan , Yair Be'ery

Spiking neural networks (SNNs) are neural networks that enable energy-efficient signal processing due to their event-based nature. This paper proposes a novel decoding algorithm for low-density parity-check (LDPC) codes that integrates SNNs…

Signal Processing · Electrical Eng. & Systems 2024-10-16 Alexander von Bank , Eike-Manuel Edelmann , Sisi Miao , Jonathan Mandelbaum , Laurent Schmalen
‹ Prev 1 3 4 5 6 7 10 Next ›