English
Related papers

Related papers: Optimized Bit Mappings for Spatially Coupled LDPC …

200 papers

The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on…

Information Theory · Computer Science 2016-07-12 Shrinivas Kudekar , Santhosh Kumar , Marco Mondelli , Henry D. Pfister , Rüdiger Urbanke

The performance of bit-interleaved coded modulation (BICM) with bit shaping (i.e., non-equiprobable bit probabilities in the underlying binary code) is studied. For the Gaussian channel, the rates achievable with BICM and bit shaping are…

Information Theory · Computer Science 2010-01-19 Albert Guillen i Fabregas , Alfonso Martinez

Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and…

Information Theory · Computer Science 2016-11-18 Chung-Li Wang , Xiaoheng Chen , Zongwang Li , Shaohua Yang

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

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

We explain how to optimize finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn based on a finite-length scaling result to…

Information Theory · Computer Science 2007-07-13 Abdelaziz Amraoui , Andrea Montanari , Ruediger Urbanke

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

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

In this paper, we propose a framework of the mutual information-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes by using simple mappings and fixed-point additions. Our decoding method is generic in the sense…

Information Theory · Computer Science 2022-02-15 Peng Kang , Kui Cai , Xuan He , Shuangyang Li , Jinhong Yuan

It is well known that spatially coupled (SC) codes with erasure-BP decoding have powerful error correcting capability over memoryless erasure channels. However, the decoding performance of SC-codes significantly degrades when they are used…

Information Theory · Computer Science 2015-01-20 Hiroki Mori , Tadashi Wadayama

This paper presents Bit-Interleaved Coded Modulation metrics for joint estimation detection using training or reference signal transmission strategies for short to long block length channels. We show that it is possible to enhance the…

Information Theory · Computer Science 2025-02-11 Mody Sy , Raymond Knopp

In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation for a wiretap channel where the main channel is noiseless, and the wiretap channel is a binary symmetric channel (BSC). Using this technique,…

Information Theory · Computer Science 2024-01-17 Ali Nikkhah , Morteza Shoushtari , Bahareh Akhbari , Willie K. Harrison

In this paper, we highlight the class of spatially coupled codes and discuss their applicability to long-haul and submarine optical communication systems. We first demonstrate how to optimize irregular spatially coupled LDPC codes for their…

Information Theory · Computer Science 2016-06-03 Laurent Schmalen , Detlef Suikat , Detlef Rösener , Vahid Aref , Andreas Leven , Stephan ten Brink

We study LDPC codes for the channel with $2^m$-ary input $\underline{x}\in \mathbb{F}_2^m$ and output $\underline{y}=\underline{x}+\underline{z}\in \mathbb{F}_2^m$. The receiver knows a subspace $V\subset \mathbb{F}_2^m$ from which…

Information Theory · Computer Science 2012-05-22 Kenta Kasai , Takayuki Nozaki , Kohichi Sakaniwa

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

The error probability of block codes sent under a non-uniform input distribution over the memoryless binary symmetric channel (BSC) and decoded via the maximum a posteriori (MAP) decoding rule is investigated. It is proved that the ratio of…

Information Theory · Computer Science 2023-05-10 Ling-Hua Chang , Po-Ning Chen , Fady Alajaji

We address a design of high-capacity and low-peak-to-average power ratio (PAPR) orthogonal frequency-division multiplexing (OFDM) systems based on bit-interleaved coded modulation (BICM) utilizing non-equiprobable and non-uniform (NENU)…

Information Theory · Computer Science 2026-01-21 Eito Kurihara , Hideki Ochiai

We address photon-number-assisted, polarization- based, binary communication systems equipped with photon counting receivers. In these channels information is encoded in the value of polarization phase-shift but the carrier has and…

In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check…

Information Theory · Computer Science 2008-10-08 E. Paolini , M. Chiani

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros
‹ Prev 1 3 4 5 6 7 10 Next ›