English
Related papers

Related papers: A 588 Gbps LDPC Decoder Based on Finite-Alphabet M…

200 papers

In this paper, we introduce a new channel model we term the q-ary multi-bit channel (QMBC). This channel models a memory device, where q-ary symbols (q=2^s) are stored in the form of current/voltage levels. The symbols are read in a…

Information Theory · Computer Science 2017-06-29 Rami Cohen , Netanel Raviv , Yuval Cassuto

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2017-01-27 Laurent Schmalen , Vahid Aref , Fanny Jardel

A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet, and the variable nodes exploit soft information from the…

Information Theory · Computer Science 2018-10-12 Emna Ben Yacoub , Fabian Steiner , Balazs Matuz , Gianluigi Liva

In a previous work, we presented a parallel encoding algorithm for low-density parity-check (LDPC) codes by partitioning hypergraph representation for the LDPC codes. The aim of this research is to analyze the processing time of this…

Information Theory · Computer Science 2016-06-07 Takayuki Nozaki

We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this…

Information Theory · Computer Science 2014-04-08 Alexios Balatsoukas-Stimming , Andreas Burg

This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner sparse regression code (SPARC) whose respective field size and…

Information Theory · Computer Science 2024-10-28 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the…

Information Theory · Computer Science 2014-02-17 Stefan Schwandter , Alexandre Graell i Amat , Gerald Matz

In this paper, we formulate a new problem to cope with the transmission of extra bits over an existing coded transmission link (referred to as coded payload link) without any cost of extra transmission energy or extra bandwidth. This is…

Information Theory · Computer Science 2019-06-27 Suihua Cai , Shancheng Zhao , Xiao Ma

This paper proposes a new iterative gradient descent decoding method for real number parity codes. The proposed decoder, named Gradient Descent Symbol Update (GDSU), is used for a class of low-density parity-check (LDPC) real-number codes…

Information Theory · Computer Science 2024-11-26 Oana Boncalo , Alexandru Amaricai

We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-check (qLDPC) code and fault-tolerant quantum circuits. DTDs…

Quantum Physics · Physics 2025-02-25 Kai R. Ott , Bence Hetényi , Michael E. Beverland

This paper presents approaches to develop efficient network for non-binary quasi-cyclic LDPC (QC-LDPC) decoders. By exploiting the intrinsic shifting and symmetry properties of the check matrices, significant reduction of memory size and…

Hardware Architecture · Computer Science 2011-11-04 Chuan Zhang , Keshab K. Parhi

This paper presents a GPU-accelerated decoder for quantum low-density parity-check (QLDPC) codes that achieves sub-$63$ $\mu$s latency, below the surface code decoder's real-time threshold demonstrated on Google's Willow quantum processor.…

We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance…

Information Theory · Computer Science 2024-11-08 Thiago Bergamaschi , Fernando Granha Jeronimo , Tushant Mittal , Shashank Srivastava , Madhur Tulsiani

This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative…

Information Theory · Computer Science 2016-11-17 Byung-Hak Kim , Henry D. Pfister

We present a new family of low-density parity-check (LDPC) convolutional codes that can be designed using ordered sets of progressive differences. We study their properties and define a subset of codes in this class that have some desirable…

Information Theory · Computer Science 2012-12-21 Marco Baldi , Marco Bianchi , Giovanni Cancellieri , Franco Chiaraluce

In this paper, we consider the problem of iterative detection and decoding (IDD) for multi-antenna systems using low-density parity-check (LDPC) codes. The proposed IDD system consists of a soft-input soft-output parallel interference (PIC)…

Information Theory · Computer Science 2013-04-24 Jingjing Liu , Peng Li , Rodrigo C. de Lamare

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

In this paper a new message passing algorithm, which takes advantage of both tree-based re-parameterization and the knowledge of short cycles, is introduced for the purpose of decoding LDPC codes with short block lengths. The proposed…

Information Theory · Computer Science 2014-03-25 J. Li , R. C. de Lamare

Spiking neural networks (SNNs) are neural networks that enable energy-efficient signal processing due to their event-based nature. This paper proposes a novel decoding algorithm for low-density parity-check (LDPC) codes that integrates SNNs…

Signal Processing · Electrical Eng. & Systems 2024-10-16 Alexander von Bank , Eike-Manuel Edelmann , Sisi Miao , Jonathan Mandelbaum , Laurent Schmalen
‹ Prev 1 8 9 10 Next ›