English
Related papers

Related papers: Extended Non-Binary Low-Density Parity-Check Codes…

200 papers

We investigate the reasons behind the superior performance of belief propagation decoding of non-binary LDPC codes over their binary images when the transmission occurs over the binary erasure channel. We show that although decoding over…

Information Theory · Computer Science 2016-11-15 Aman Bhatia , Aravind R. Iyengar , Paul H. Siegel

In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes…

Signal Processing · Electrical Eng. & Systems 2020-03-04 Yang Yu , Wen Chen , Lili Wei

We propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analysis tools such as…

Information Theory · Computer Science 2008-01-24 Hamid Saeedi , Amir H. Banihashemi

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

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

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

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 introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC).…

Information Theory · Computer Science 2016-11-18 H. Tavakoli , M. Ahmadian Attari , M. Reza Peyghami

In this paper, we design the optimal rate capacity approaching irregular Low-Density Parity-Check code ensemble over Binary Erasure Channel, by using practical Semi-Definite Programming approach. Our method does not use any relaxation or…

Information Theory · Computer Science 2012-11-28 H. Tavakoli , M. Ahmadian , M. Reza Peyghami

In this paper, we first introduce the extended binary representation of non-binary codes, which corresponds to a covering graph of the bipartite graph associated with the non-binary code. Then we show that non-binary codewords correspond to…

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

The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary…

Information Theory · Computer Science 2016-11-17 Ian P. Mulholland , Enrico Paolini , Mark F. Flanagan

In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The…

Information Theory · Computer Science 2015-05-20 Hironori Uchikawa , Kenta Kasai , Kohichi Sakaniwa

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

In this paper we analyze the performance of several bit-interleaving strategies applied to Non-Binary Low-Density Parity-Check (LDPC) codes over the Rayleigh fading channel. The technique of bit-interleaving used over fading channel…

Information Theory · Computer Science 2013-01-21 Valentin Savin , David Declercq

Non-binary low-density parity-check (LDPC) codes have some advantages over their binary counterparts, but unfortunately their decoding complexity is a significant challenge. The iterative hard- and soft-reliability based majority-logic…

Information Theory · Computer Science 2015-06-22 Chenrong Xiong , Zhiyuan Yan

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

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

In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed…

Information Theory · Computer Science 2016-11-17 Dung Viet Nguyen , Bane Vasic , Michael W. Marcellin

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
‹ Prev 1 2 3 10 Next ›