English
Related papers

Related papers: A Comparative Study of Ensemble Decoding Methods f…

200 papers

Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation due to their potential for low-overhead protocols. A common approach to decoding qLDPC codes is to use the belief…

Quantum Physics · Physics 2025-10-13 Kento Tsubouchi , Hayata Yamasaki , Shiro Tamiya

The near channel performance of Low Density Parity Check Codes (LDPC) has motivated its wide applications. Iterative decoding of LDPC codes provides significant implementation challenges as the complexity grows with the code size. Recent…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-11-29 Sudeep Kanur , Georgios Georgakarakos , Antti Siirilä , Jérémie Lagravière , Kristian Nybom , Sébastien Lafond , Johan Lilius

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

This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum…

Information Theory · Computer Science 2012-08-28 Yuichiro Fujiwara , David Clark , Peter Vandendriessche , Maarten De Boeck , Vladimir D. Tonchev

We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in…

Information Theory · Computer Science 2016-11-15 Constantinos Daskalakis , Alexandros G. Dimakis , Richard M. Karp , Martin J. Wainwright

Aiming at bridging the gap between the maximum likelihood decoding (MLD) and the suboptimal iterative decodings for short or medium length LDPC codes, we present a generalized ordered statistic decoding (OSD) in the form of syndrome…

Information Theory · Computer Science 2008-05-16 Guangwen Li , Guangzeng Feng

Most existing works on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assume that the degree distributions of the two ends of a randomly selected edge are independent. In the paper, we take one step…

Information Theory · Computer Science 2023-04-20 Hsiao-Wen Yu , Cheng-En Lee , Ruhui Zhang , Cheng-Shang Chang , Duan-Shin Lee

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

With the widespread application of Large Language Models (LLMs) in the field of Natural Language Processing (NLP), enhancing their performance has become a research hotspot. This paper presents a novel multi-prompt ensemble decoding…

Computation and Language · Computer Science 2024-12-25 Jiaxin Guo , Daimeng Wei , Yuanchang Luo , Shimin Tao , Hengchao Shang , Zongyao Li , Shaojun Li , Jinlong Yang , Zhanglin Wu , Zhiqiang Rao , Hao Yang

The design of optimal linear block codes capable of being efficiently decoded is of major concern, especially for short block lengths. As near capacity-approaching codes, Low-Density Parity-Check (LDPC) codes possess several advantages over…

Information Theory · Computer Science 2024-10-11 Yoni Choukroun , Lior Wolf

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

With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly…

Information Theory · Computer Science 2012-07-30 Yue Zhao , Francis C. M. Lau

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

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now…

Information Theory · Computer Science 2015-01-16 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

This paper considers low-density parity-check (LDPC) decoders affected by deviations introduced by the electronic device on which the decoder is implemented. Noisy density evolution (DE) that allows to theoretically study the performance of…

Information Theory · Computer Science 2020-11-18 Elsa Dupraz , François Leduc-Primeau

In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered message-passing algorithm. In particular, we show that…

Information Theory · Computer Science 2026-04-28 Qingqing Peng , Dongxu Chang , Guiying Yan , Guanghui Wang

Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief propagation decoding of low-density parity-check (LDPC) codes…

Information Theory · Computer Science 2019-10-21 Fabian Steiner , Emna Ben Yacoub , Balazs Matuz , Gianluigi Liva , Alexandre Graell i Amat

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

This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels.…

Information Theory · Computer Science 2016-11-17 Igal Sason

In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure…

Information Theory · Computer Science 2014-03-03 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello
‹ Prev 1 3 4 5 6 7 10 Next ›