English
Related papers

Related papers: Study of Knowledge-Aided Iterative Detection and D…

200 papers

We consider generalized low-density parity-check (GLDPC) codes with component codes that are duals of Cordaro-Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann-Rudolph processing, analogous to Sum-Product…

Information Theory · Computer Science 2025-05-14 Dawit Simegn , Dmitry Artemasov , Kirill Andreev , Pavel Rybin , Alexey Frolov

This paper investigates the application of low-density parity-check (LDPC) codes to Flash memories. Multiple cell reads with distinct word-line voltages provide limited-precision soft information for the LDPC decoder. The values of the…

Information Theory · Computer Science 2012-10-02 Jiadong Wang , Guiqiang Dong , Thomas Courtade , Hari Shankar , Tong Zhang , Richard Wesel

We enhance coarsely quantized LDPC decoding by reusing computed check node messages from previous iterations. Typically, variable and check nodes update and replace old messages every iteration. We show that, under coarse quantization,…

Information Theory · Computer Science 2025-01-22 Philipp Mohr , Gerhard Bauch

We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the…

Quantum Physics · Physics 2021-11-24 Pavel Panteleev , Gleb Kalachev

In this paper, we propose a non-binary belief propagation approach (NB-BP) for detection of $M$-ary modulation symbols and decoding of $q$-ary LDPC codes in large-scale multiuser MIMO systems. We first propose a message passing based symbol…

Information Theory · Computer Science 2013-10-17 T. Lakshmi Narasimhan , A. Chockalingam

We introduce a new method for decoding short and moderate length linear block codes with dense parity-check matrix representations of cyclic form, termed multiple-bases belief-propagation (MBBP). The proposed iterative scheme makes use of…

Information Theory · Computer Science 2016-11-15 Thorsten Hehn , Johannes B. Huber , Olgica Milenkovic , Stefan Laendner

We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional…

Information Theory · Computer Science 2018-06-29 Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva , Christian Häger , Henry D. Pfister

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

This work considers the design of short non-binary low-density parity-check (LDPC) codes over finite fields of order m, for channels with phase noise. In particular, m-ary differential phase-shift keying (DPSK) modulated code symbols are…

Information Theory · Computer Science 2019-08-09 Tudor Ninacs , Balázs Matuz , Gianluigi Liva , Giulio Colavolpe

Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes \cite{Kschischang01}. An…

Information Theory · Computer Science 2009-08-27 Xudong Ma , En-hui Yang

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

In a digital communication system, information is sent from one place to another over a noisy communication channel. It may be possible to detect and correct errors that occur during the transmission if one encodes the original information…

Information Theory · Computer Science 2017-08-21 Banu Kabakulak , Z. Caner Taşkın , Ali Emre Pusane

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

We consider spatially coupled low-density parity-check (SC-LDPC) codes within a non-orthogonal interleave division multiple access (IDMA) scheme to avoid cumbersome degree profile matching of the LDPC code components to the iterative…

Information Theory · Computer Science 2019-01-29 Sebastian Cammerer , Xiaojie Wang , Yingyan Ma , Stephan ten Brink

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

Low Density Parity Check (LDPC) codes are linear error correcting codes used in communication systems for Forward Error Correction (FEC). But, intensive computation is required for encoding and decoding of LDPC codes, making it difficult…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-13 Bhargav Gokalgandhi , Ivan Seskar

In this letter, we propose a two-stage design method to construct memory efficient mutual information-maximizing quantized min-sum (MIM-QMS) decoder for rate-compatible low-density parity-check (LDPC) codes. We first develop a modified…

Information Theory · Computer Science 2022-01-19 Peng Kang , Kui Cai , Xuan He , Jinhong Yuan

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

An adaptive iterative decision multi-feedback detection algorithm with constellation constraints is proposed for multiuser multi-antenna systems. An enhanced detection and interference cancellation is performed by introducing multiple…

Information Theory · Computer Science 2013-04-24 Peng Li , Jingjing Liu , Rodrigo C. de Lamare

Low-density parity-check codes are attractive for high throughput applications because of their low decoding complexity per bit, but also because all the codeword bits can be decoded in parallel. However, achieving this in a circuit…

Hardware Architecture · Computer Science 2012-05-14 François Leduc-Primeau , Saied Hemati , Shie Mannor , Warren J. Gross
‹ Prev 1 3 4 5 6 7 10 Next ›