English
Related papers

Related papers: On Multilevel Coding Schemes Based on Non-Binary L…

200 papers

A new approach for designing bilayer and multi-layer LDPC codes is proposed and studied in the asymptotic regime. The ensembles are defined through individual uni-variate degree distributions, one for each layer. We present a construction…

Information Theory · Computer Science 2020-10-29 Eshed Ram , Yuval Cassuto

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates linear-programming based reception for coded modulation systems which use direct modulation mapping of coded…

Information Theory · Computer Science 2016-11-15 Mark F. Flanagan , Vitaly Skachek , Eimear Byrne , Marcus Greferath

We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new…

Information Theory · Computer Science 2015-02-25 Alexey Frolov , Victor Zyablov

We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The…

Information Theory · Computer Science 2016-11-17 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari

In this paper, we have investigated the application of non-binary LDPC codes to spatial multiplexing MIMO systems with a large number of low power antennas. We demonstrate that such large MIMO systems incorporating with low-complexity MMSE…

Information Theory · Computer Science 2012-03-06 Puripong Suthisopapan , Kenta Kasai , Anupap Meesomboon , Virasit Imtawil

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather…

Information Theory · Computer Science 2016-11-18 Joseph J. Boutros , Albert Guillen i Fabregas , Ezio Biglieri , Gilles Zemor

In this paper, we represent Raptor codes as multi-edge type low-density parity-check (MET-LDPC) codes, which gives a general framework to design them for higher-order modulation using MET density evolution. We then propose an efficient…

Information Theory · Computer Science 2017-01-17 Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Lawrence Ong , Sarah J. Johnson

In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative…

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

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

We present an analysis, under iterative decoding, of coset LDPC codes over GF(q), designed for use over arbitrary discrete-memoryless channels (particularly nonbinary and asymmetric channels). We use a random-coset analysis to produce an…

Information Theory · Computer Science 2007-07-16 Amir Bennatan , David Burshtein

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

Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure…

Information Theory · Computer Science 2008-04-21 Enrico Paolini , Gianluigi Liva , Michela Varrella , Balazs Matuz , Marco Chiani

In this paper, we develop efficient decoders for non-binary low-density parity-check (LDPC) codes using the alternating direction method of multipliers (ADMM). We apply ADMM to two decoding problems. The first problem is linear programming…

Information Theory · Computer Science 2015-07-29 Xishuo Liu , Stark C. Draper

In this paper, we devote to devise a non-binary low-density parity-check (LDPC) decoder in Galois fields of characteristic two ($\mathbb{F}_{2^q}$) via the alternating direction method of multipliers (ADMM) technique. Through the proposed…

Information Theory · Computer Science 2022-02-08 Xiaomeng Guo , Yongchao Wang

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

In this paper, we consider quantized decoding of LDPC codes on the binary symmetric channel. The binary message passing algorithms, while allowing extremely fast hardware implementation, are not very attractive from the perspective of…

Information Theory · Computer Science 2016-11-17 Lucile Sassatelli , Shashi Kiran Chilappagari , Bane Vasic , David Declercq

Linear Programming (LP) decoding is emerging as an attractive alternative to decode Low-Density Parity-Check (LDPC) codes. However, the earliest LP decoders proposed for binary and nonbinary LDPC codes are not suitable for use at moderate…

Information Theory · Computer Science 2011-02-17 Mayur Punekar , Mark F. Flanagan

This paper devotes to comparison of different coding schemes (various constructions of Polar and LDPC codes, Product codes and BCH codes) for the case when information is transmitted over AWGN channel with quantization with lowest possible…

Information Theory · Computer Science 2022-11-22 Fedor Ivanov , Dmitry Osipov

Protograph low-density-parity-check (LDPC) are considered to design near-capacity low-rate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes…

Information Theory · Computer Science 2018-05-03 Asit Kumar Pradhan , Andrew Thangaraj

We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the…

Information Theory · Computer Science 2020-10-23 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek , Tähvend Uustalu