English
Related papers

Related papers: Efficient Network for Non-Binary QC-LDPC Decoder

200 papers

A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of…

Information Theory · Computer Science 2017-01-24 A. Tasdighi , M. R. Sadeghi

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most…

Information Theory · Computer Science 2016-11-17 Mayur Punekar , Pascal O. Vontobel , Mark F. Flanagan

The goal of the paper is to study specific properties of nonbinary low-density parity-check (NB LDPC) codes when used in coded modulation systems. The paper is focused on the practically important NB LDPC codes over extensions of the Galois…

Information Theory · Computer Science 2022-05-25 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek

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

Low density parity check (LDPC) lattices are obtained from Construction D' and a family of nested binary LDPC codes. We consider an special case of these lattices with one binary LDPC code as underlying code. This special case of LDPC…

Information Theory · Computer Science 2016-08-15 Hassan Khodaiemehr , Dariush Kiani , Mohammad-Reza Sadeghi

We study LDPC codes for the channel with input ${x}\in \mathbb{F}_q^m$ and output ${y}={x}+{z}\in \mathbb{F}_q^m$. The aim of this paper is to evaluate decoding performance of $q^m$-ary non-binary LDPC codes for large $m$. We give density…

Information Theory · Computer Science 2014-01-29 Koji Tazoe , Kenta Kasai , Kohichi Sakaniwa

Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low…

Information Theory · Computer Science 2012-04-13 Zhiqiang Cui , Zhongfeng Wang , Xinmiao Zhang

Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes. However, a limited number of short to moderate-length QLDPC codes have been designed and their decoding…

Information Theory · Computer Science 2024-05-07 Sisi Miao , Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly…

Information Theory · Computer Science 2012-07-30 Yue Zhao , Francis C. M. Lau

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

We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation. Our methodology starts by defining a new class of "hierarchical" quasi-cyclic…

Information Theory · Computer Science 2016-11-17 Yige Wang , Stark C. Draper , Jonathan S. Yedidia

The error correction performance of low-density parity-check (LDPC) codes under iterative message-passing decoding is degraded by the presence of certain harmful objects existing in their Tanner graph representation. Depending on the…

Information Theory · Computer Science 2019-04-16 Massimo Battaglioni , Franco Chiaraluce , Marco Baldi , David Mitchell

We propose a hybrid coded modulation scheme which composes of inner and outer codes. The outer-code can be any standard binary linear code with efficient soft decoding capability (e.g. low-density parity-check (LDPC) codes). The inner code…

Information Theory · Computer Science 2022-02-07 Sung Hoon Lim , Jiyong Han , Wonjong Noh , Yujae Song , Sang-Woon Jeon

This paper uses the reconstruction-computation-quantization (RCQ) paradigm to decode low-density parity-check (LDPC) codes. RCQ facilitates dynamic non-uniform quantization to achieve good frame error rate (FER) performance with very low…

Signal Processing · Electrical Eng. & Systems 2022-02-10 Linfang Wang , Caleb Terrill , Maximilian Stark , Zongwang Li , Sean Chen , Chester Hulse , Calvin Kuo , Richard Wesel , Gerhard Bauch , Rekha Pitchumani

Rate-matching of low-density parity-check (LDPC) codes enables a single code description to support a wide range of code lengths and rates. In 5G NR, rate matching is accomplished by extending (lifting) a base code to a desired target…

Information Theory · Computer Science 2024-10-29 Reinhard Wiesmayr , Darja Nonaca , Chris Dick , Christoph Studer

Recently, neural networks have improved MinSum message-passing decoders for low-density parity-check (LDPC) codes by multiplying or adding weights to the messages, where the weights are determined by a neural network. The neural network…

Signal Processing · Electrical Eng. & Systems 2023-12-06 Linfang Wang , Caleb Terrill , Richard Wesel , Dariush Divsalar

We derive two families of EA-QC quantum LDPC (EA-QC-QLDPC) codes by tiling permutation matrices of prime and composite orders. The unassisted portion of the Tanner graphs corresponding to these codes, constructed from two distinct classical…

Information Theory · Computer Science 2025-11-04 Pavan Kumar , Abhi Kumar Sharma , Shayan Srinivasa Garani

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

Quantum low-density parity-check (QLDPC) codes with good parameters are promising candidates for low-overhead fault-tolerant quantum computing, but their non-local stabilizers require long-range connectivity and frequent qubit movement,…

Quantum Physics · Physics 2026-04-29 Swayangprabha Shaw , Narayanan Rengaswamy
‹ Prev 1 4 5 6 7 8 10 Next ›