English
Related papers

Related papers: Design and Analysis of E2RC Codes

200 papers

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

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that have excellent performance thanks to the degrees of freedom they offer. An SC code is designed by partitioning a base matrix into components, the number…

Information Theory · Computer Science 2026-05-11 Bade Aksoy , Doğukan Özbayrak , Ahmed Hareedy

Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is…

Information Theory · Computer Science 2007-07-13 Alexandre Graell i Amat , Fredrik Brannstrom , Lars K. Rasmussen

We introduce the Scattered Extrinsic Information Transfer (S-EXIT) chart as a tool for optimizing degree profiles of short length Low-Density Parity-Check (LDPC) codes under iterative decoding. As degree profile optimization is typically…

Information Theory · Computer Science 2018-04-09 Moustafa Ebada , Ahmed Elkelesh , Sebastian Cammerer , Stephan ten Brink

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the…

Information Theory · Computer Science 2020-12-25 Min Qiu , Xiaowei Wu , Alexandre Graell i Amat , Jinhong Yuan

It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only…

Information Theory · Computer Science 2016-11-18 Ioannis Chatzigeorgiou , Miguel R. D. Rodrigues , Ian J. Wassell , Rolando Carrasco

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

Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and…

Information Theory · Computer Science 2016-11-18 Asit Kumar Pradhan , Andrew Thangaraj , Arunkumar Subramanian

Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor…

Information Theory · Computer Science 2016-08-17 C. T. Healy , R. C. de Lamare

Continuous-variable quantum key distribution utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. One of the challenges is thereby the requirement of capacity approaching error…

Information Theory · Computer Science 2021-06-30 Hossein Mani , Tobias Gehring , Christoph Pacher , Ulrik Lund Andersen

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

Digital data transfer can be protected by means of suitable error correcting codes. Among the families of state-of-the-art codes, LDPC (Low Density Parity-Check) codes have received a great deal of attention recently, because of their…

Information Theory · Computer Science 2022-10-10 Massimo Battaglioni , Giovanni Cancellieri

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

For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic…

Information Theory · Computer Science 2016-11-18 Hosung Park , Seokbeom Hong , Jong-Seon No , Dong-Joon Shin

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

The demand for flexible broadband wireless services makes the pruning technique, including both shortening and puncturing, an indispensable component of error correcting codes. The analysis of the pruning process for structured lowdensity…

Signal Processing · Electrical Eng. & Systems 2020-03-26 Yuejun Wei , Yuhang Yang , Ming Jiang , Wen Chen , Lili Wei

The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes. However, the degree-two bit nodes preclude the possibility…

Information Theory · Computer Science 2013-05-22 Asit Kumar Pradhan , Arunkumar Subramanian , Andrew Thangaraj

Block-fading (BF) channel, also known as slow-fading channel, is a type of simple and practical channel model that can characterize the primary feature of a number of wireless-communication applications with low to moderate mobility.…

Information Theory · Computer Science 2021-07-22 Yi Fang , Pingping Chen , Guofa Cai , Francis C. M. Lau , Soung Chang Liew , Guojun Han

We propose a systematic design of protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with low error floor. We first characterize the trapping sets of such codes and demonstrate that the QC structure of the code…

Information Theory · Computer Science 2019-06-18 Bashirreza Karimi , Amir. H Banihashemi

Despite encouraging advances in the design of relay codes, several important challenges remain. Many of the existing LDPC relay codes are tightly optimized for fixed channel conditions and not easily adapted without extensive…

Information Theory · Computer Science 2016-11-18 Thuy Van Nguyen , Aria Nosratinia , Dariush Divsalar