English
Related papers

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

200 papers

Linear programming (LP) decoding for low-density parity-check (LDPC) codes proposed by Feldman et al. is shown to have theoretical guarantees in several regimes and empirically is not observed to suffer from an error floor. However at low…

Information Theory · Computer Science 2016-11-18 Xishuo Liu , Stark C. Draper

An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low…

Information Theory · Computer Science 2016-11-17 Alex Bazarsky , Noam Presman , Simon Litsyn

Soft forward error correction with higher-order modulations is often implemented in practice via the pragmatic bit-interleaved coded modulation paradigm, where a single binary code is mapped to a nonbinary modulation. In this paper, we…

Information Theory · Computer Science 2014-06-13 Christian Häger , Alexandre Graell i Amat , Fredrik Brännström , Alex Alvarado , Erik Agrell

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

CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) codes where the constraint nodes (CNs) represent convolutional codes. This allows for efficient decoding in the trellis with the forward-backward algorithm, and the…

Information Theory · Computer Science 2022-12-01 Muhammad Umar Farooq , Michael Lentmaier , Alexandre Graell i Amat

Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations…

Information Theory · Computer Science 2016-11-18 Gottfried Lechner , Troels Pedersen , Gerhard Kramer

We consider coding schemes for channels with non-uniform inputs (NUI), where standard linear block codes can not be applied directly. We show that multilevel coding (MLC) with a set of linear codes and a deterministic mapper can achieve the…

Information Theory · Computer Science 2007-07-13 Jing Jiang , Krishna R. Narayanan

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

Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention. In this approach, mutual-information maximizing lookup tables replace the conventional operations of the…

Information Theory · Computer Science 2019-10-24 Maximilian Stark , Jan Lewandowsky , Souradip Saha , Gerhard Bauch

We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient…

Information Theory · Computer Science 2016-11-15 Amina Piemontese , Alexandre Graell i Amat , Giulio Colavolpe

Quantum cryptography via key distribution mechanisms that utilize quantum entanglement between sender-receiver pairs will form the basis of future large-scale quantum networks. A key engineering challenge in such networks will be the…

Information Theory · Computer Science 2015-05-14 Yixuan Xie , Jun Li , Robert Malaney , Jinhong Yuan

Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are…

Information Theory · Computer Science 2009-01-13 Valentin Savin

This paper presents a general approach for optimizing the number of symbols in increments (packets of incremental redundancy) in a feedback communication system with a limited number of increments. This approach is based on a tight normal…

Information Theory · Computer Science 2016-02-17 Kasra Vakilinia , Sudarsan V. S. Ranganathan , Dariush Divsalar , Richard D. Wesel

A new coded modulation scheme is proposed. At the transmitter, the concatenation of a distribution matcher and a systematic binary encoder performs probabilistic signal shaping and channel coding. At the receiver, the output of a bitwise…

Information Theory · Computer Science 2015-04-23 Georg Böcherer , Patrick Schulte , Fabian Steiner

A framework is proposed that allows for a joint description and optimization of both binary polar coding and the multilevel coding (MLC) approach for $2^m$-ary digital pulse-amplitude modulation (PAM). The conceptual equivalence of polar…

Information Theory · Computer Science 2016-11-17 Mathis Seidl , Andreas Schenk , Clemens Stierstorfer , Johannes B. Huber

We propose an efficient encoding algorithm for the binary and non-binary low-density parity-check codes. This algorithm transforms the parity part of the parity-check matrix into a block triangular matrix with low weight diagonal…

Information Theory · Computer Science 2021-03-03 Yuta Iketo , Takayuki Nozaki

Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant…

Information Theory · Computer Science 2015-03-17 Ali E. Pusane , Roxana Smarandache , Pascal O. Vontobel , Daniel J. Costello

The sixth generation (6G) wireless communication system will improve the key technical indicators by one to two orders of magnitude, and come with some new features. As a crucial technique to enhance the reliability and efficiency of data…

Information Theory · Computer Science 2025-04-08 Li Shen , Yongpeng Wu , Yin Xu , Xiaohu You , Xiqi Gao , Wenjun Zhang

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

We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits. Since a collected channel output yields a…

Information Theory · Computer Science 2010-07-13 Kenta Kasai , Kohichi Sakaniwa