English
Related papers

Related papers: Binary Diversity for Non-Binary LDPC Codes over th…

200 papers

The equivalent binary parity check matrices for the binary images of the cycle-free non-binary LDPC codes have numerous bit-level cycles. In this paper, we show how to transform these binary parity check matrices into their cycle-free…

Signal Processing · Electrical Eng. & Systems 2020-03-03 Yang Yu , Wen Chen , Jun Li , Xiao Ma , Baoming Bai

A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable…

Information Theory · Computer Science 2009-04-24 Ingmar Land , Gottfried Lechner , Lars K. Rasmussen

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

Rateless codes have been shown to provide robust error correction over a wide range of binary and noisy channels. Using a stochastic geometry model, this paper studies the performance of rateless codes in the cellular downlink and compares…

Information Theory · Computer Science 2017-02-27 Amogh Rajanna , Martin Haenggi

In this paper, the application of non-binary low-density parity-check (NBLDPC) codes to MIMO systems which employ hundreds of antennas at both the transmitter and the receiver has been proposed. Together with the well-known low-complexity…

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

In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques…

Information Theory · Computer Science 2007-07-16 Lucile Sassatelli , David Declercq

This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this…

Networking and Internet Architecture · Computer Science 2014-03-27 Avi Zanko , Amir Leshem , Ephraim Zehavi

A new variant of bit interleaved coded modulation (BICM) is proposed. In the new scheme, called Parallel BICM, L identical binary codes are used in parallel using a mapper, a newly proposed finite-length interleaver and a binary dither…

Information Theory · Computer Science 2010-08-18 Amir Ingber , Meir Feder

In this paper, we study the performance of finite-length LDPC codes in the waterfall region. We propose an algorithm to predict the error performance of finite-length LDPC codes over various binary memoryless channels. Through numerical…

Information Theory · Computer Science 2013-09-30 Md. Noor-A-Rahim , Khoa D. Nguyen , Gottfried Lechner

In this paper we design non-uniform bit-wise puncturing distributions for irregular non-binary LDPC (NB-LDPC) codes. The puncturing distributions are optimized by minimizing the decoding threshold of the punctured LDPC code, the threshold…

Information Theory · Computer Science 2010-05-03 Matteo Gorgoglione , Valentin Savin , David Declercq

The complexity-performance trade-off is a fundamental aspect of the design of low-density parity-check (LDPC) codes. In this paper, we consider LDPC codes for the binary erasure channel (BEC), use code rate for performance metric, and…

Information Theory · Computer Science 2016-11-17 Vahid Jamali , Yasser Karimian , Johannes Huber , Mahmoud Ahmadian

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

This paper is concerned with optimum diversity receiver structure and its performance analysis of differential phase shift keying (DPSK) with differential detection over nonselective, independent, nonidentically distributed, Rayleigh fading…

Information Theory · Computer Science 2007-07-13 Hua Fu , Pooi Yuen Kam

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

A joint scheme for the channel coding and spectrum spreading communication system is proposed in this paper. The Bit Error Rate (BER) performance of the joint proposed scheme is evaluated and compared with the case of channel coding scheme…

Information Theory · Computer Science 2021-08-24 Hadi Khodaei Jooshin , Mahdi Nangir

We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove threshold saturation of the belief propagation decoding to the…

Information Theory · Computer Science 2014-07-23 Alexandre Graell i Amat , Iryna Andriyanova , Amina Piemontese

This paper applies error-exponent and dispersion-style analyses to derive finite-blocklength achievability bounds for low-density parity-check (LDPC) codes over the point-to-point channel (PPC) and multiple access channel (MAC). The…

Information Theory · Computer Science 2020-05-14 Yuxin Liu , Michelle Effros

We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) code ensembles defined over the general linear group on the binary erasure channel. In particular, we prove threshold saturation of…

Information Theory · Computer Science 2016-04-05 Iryna Andriyanova , Alexandre Graell i Amat

The connections between variable nodes and check nodes have a great influence on the performance of low-density parity-check (LDPC) codes. Inspired by the unique structure of polar code's generator matrix, we proposed a new method of…

Information Theory · Computer Science 2019-12-06 Binbin Gao , Huarui Yin , Zhengdao Wang

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