English
Related papers

Related papers: Improving the Decoding Threshold of Tailbiting Spa…

200 papers

We address noisy message-passing decoding of lowdensity parity-check (LDPC) codes over additive white Gaussian noise channels. Message-passing decoders in which certain processing units iteratively exchange messages are common for decoding…

Information Theory · Computer Science 2015-06-02 Alla Tarighati , Hamed Farhadi , Farshad Lahouti

A new polar coding scheme for higher order modulation is presented. The proposed scheme is based on multi-level coding (MLC) with natural labeling, where the bit-level corresponding to the sign-bit is generated in dependence on the previous…

Information Theory · Computer Science 2019-10-30 Onurcan İşcan , Ronald Böhnke , Wen Xu

Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to…

Information Theory · Computer Science 2022-04-05 Aimin Li , Shaohua Wu , Jian Jiao , Ning Zhang , Qinyu Zhang

It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We…

Information Theory · Computer Science 2011-08-03 Vahid Aref , Rüdiger L. Urbanke

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

We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a-priori…

Information Theory · Computer Science 2012-01-17 Shrinivas Kudekar , Tom Richardson , Ruediger Urbanke

In this paper we investigate the behavior of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called ``waterfall region." We show that the performance curves in this region follow a very basic…

Information Theory · Computer Science 2007-07-13 Abdelaziz Amraoui , Andrea Montanari , Tom Richardson , Ruediger Urbanke

This paper considers density evolution for lowdensity parity-check (LDPC) and multi-edge type low-density parity-check (MET-LDPC) codes over the binary input additive white Gaussian noise channel. We first analyze three singleparameter…

Information Theory · Computer Science 2016-05-17 Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Lawrence Ong , Gottfried Lechner , Sarah J. Johnson

Protograph-based, off-the-shelf low-density parity-check (LDPC) codes are optimized for higher-order modulation and quantized sum-product decoders. As an example, for the recently proposed LDPC code from the upcoming IEEE 802.3ca standard…

Information Theory · Computer Science 2018-10-02 Fabian Steiner , Gerhard Kramer

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

Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation…

Information Theory · Computer Science 2013-01-25 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword. LDPC codes…

Information Theory · Computer Science 2024-10-30 Beomkyu Shin , Seokbeom Hong , Hosung Park , Jong-Seon No , Dong-Joon Shin

An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian…

Information Theory · Computer Science 2023-05-24 Thomas Wiegart , Linfang Wang , Diego Lentner , Richard D. Wesel

The recent development of deep learning methods provides a new approach to optimize the belief propagation (BP) decoding of linear codes. However, the limitation of existing works is that the scale of neural networks increases rapidly with…

Information Theory · Computer Science 2021-02-11 Jincheng Dai , Kailin Tan , Zhongwei Si , Kai Niu , Mingzhe Chen , H. Vincent Poor , Shuguang Cui

We show in this work that reinforcement learning can be successfully applied to decoding short to moderate length sparse graph-based channel codes. Specifically, we focus on low-density parity check (LDPC) codes, which for example have been…

Information Theory · Computer Science 2020-10-20 Salman Habib , Allison Beemer , Joerg Kliewer

In this study, a novel coding scheme called highdensity coding based on high-density codebooks using a genetic local search algorithm is proposed. The high-density codebook maximizes the energy transfer capability by maximizing the ratio of…

Signal Processing · Electrical Eng. & Systems 2022-03-21 Dongheon Lee , Gyuyeol Kong , Jang-Won Lee , Sooyong Choi

It is proved in this work that exhaustively determining bad patterns in arbitrary, finite low-density parity-check (LDPC) codes, including stopping sets for binary erasure channels (BECs) and trapping sets (also known as near-codewords) for…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , Sanjeev R. Kulkarni , H. Vincent Poor

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

Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes that can be described by a $(2,3)$-regular compact graph. In this paper, we introduce a family of $(d_v,d_c)$-regular GLDPC codes with convolutional code…

Information Theory · Computer Science 2020-02-14 Muhammad Umar Farooq , Saeedeh Moloudi , Michael Lentmaier

Quantum error correction (QEC) is often implemented on hardware that experiences biased noise, where dephasing errors occur more frequently than other errors. This has motivated many recent efforts to develop bias-tailored QEC codes, such…

Quantum Physics · Physics 2026-05-28 Arianna Meinking , Julie Campos , Kenneth R. Brown