English
Related papers

Related papers: Efficient Encoding Algorithm of Binary and Non-Bin…

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 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

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

A new approach for combining non-binary low-density parity-check (NB-LDPC) codes with higher-order modulation and probabilistic amplitude shaping (PAS) is presented. Instead of symbol-metric decoding (SMD), a bit-metric decoder (BMD) is…

Information Theory · Computer Science 2018-09-12 Fabian Steiner , Georg Böcherer , Gianluigi Liva

In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a periodic time-variant Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the…

Information Theory · Computer Science 2013-10-18 Vikram Arkalgud Chandrasetty , Sarah J. Johnson , Gottfried Lechner

In this paper we present a thorough analysis of non binary LDPC codes over the binary erasure channel. First, the decoding of non binary LDPC codes is investigated. The proposed algorithm performs on-the-fly decoding, i.e. it starts…

Information Theory · Computer Science 2008-10-27 Valentin Savin

In this paper, a new method for decoding Low Density Parity Check (LDPC) codes, based on Multi-Layer Perceptron (MLP) neural networks is proposed. Due to the fact that in neural networks all procedures are processed in parallel, this method…

Information Theory · Computer Science 2014-11-14 Alireza Karami , Mahmoud Ahmadian Attari

We study the performance of nonbinary low-density parity-check (LDPC) codes over finite integer rings over two channels that arise from the Lee metric. The first channel is a discrete memory-less channel (DMC) matched to the Lee metric. The…

Information Theory · Computer Science 2022-10-19 Jessica Bariffi , Hannes Bartz , Gianluigi Liva , Joachim Rosenthal

This paper investigates the Triangle Single Parity Check (T/SPC) code, a novel class of high-rate low-complexity LDPC codes. T/SPC is a regular, soft decodable, linear-time encodable/decodable code. Compared to previous high-rate and…

Information Theory · Computer Science 2011-04-11 Damian A. Morero , Graciela Corral-Briones , Carmen Rodriguez , Mario R. Hueda

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

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

Information Theory · Computer Science 2016-11-18 Lai Wei , Toshiaki Koike-Akino , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at…

Information Theory · Computer Science 2016-11-18 Mahdi Ramezani , Masoud Ardakani

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

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

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

We propose a quantized decoding algorithm for low- density parity-check codes where the variable node update rule of the standard min-sum algorithm is replaced with a look-up table (LUT) that is designed using an information-theoretic…

Information Theory · Computer Science 2015-12-02 Michael Meidlinger , Alexios Balatsoukas-Stimming , Andreas Burg , Gerald Matz

This paper basically expresses the core fundamentals and brief overview of the research of R. G. GALLAGER [1] on Low-Density Parity-Check (LDPC) codes and various parameters related to LDPC codes like, encoding and decoding of LDPC codes,…

Information Theory · Computer Science 2020-09-21 Saumya Borwankar , Dhruv Shah

This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding. Indeed, these codes feature simultaneously a sparse parity check matrix,…

Information Theory · Computer Science 2009-01-23 Alexandre Soro , Mathieu Cunche , Jerome Lacan , Vincent Roca

For decoding non-binary low-density parity check (LDPC) codes, logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing quantization effects of SP algorithm in conjunction with FFT. Since FFT is not applicable in the…

Information Theory · Computer Science 2015-05-19 Kenta Kasai , Kohichi Sakaniwa

This paper presents an efficient quadratic programming (QP) decoder via the alternating direction method of multipliers (ADMM) technique, called QP-ADMM, for binary low-density parity-check (LDPC) codes. Its main contents are as follows:…

Information Theory · Computer Science 2020-02-19 Jing Bai , Yongchao Wang , Qingjiang Shi
‹ Prev 1 3 4 5 6 7 10 Next ›