English
Related papers

Related papers: Binary Message Passing Decoding of Product-like Co…

200 papers

We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the…

Quantum Physics · Physics 2021-11-24 Pavel Panteleev , Gleb Kalachev

In this paper, we apply deep learning for communication over dispersive channels with power detection, as encountered in low-cost optical intensity modulation/direct detection (IM/DD) links. We consider an autoencoder based on the recently…

Information Theory · Computer Science 2019-10-03 Boris Karanov , Gabriele Liga , Vahid Aref , Domaniç Lavery , Polina Bayvel , Laurent Schmalen

New algorithms for efficient decoding of polar codes (which may be CRC-augmented), transmitted over either a binary erasure channel (BEC) or an additive white Gaussian noise channel (AWGNC), are presented. We start by presenting a new…

Information Theory · Computer Science 2021-07-14 Yonatan Urman , Guy Mogilevsky , David Burshtein

This paper proposes a belief propagation (BP) message passing algorithm based joint multiple symbol differential detection (MSDD) and channel decoding scheme for noncoherent differential ultra-wideband impulse radio (UWB-IR) systems. MSDD…

Information Theory · Computer Science 2015-05-27 Taotao Wang , Tiejun Lv , Hui Gao , Shengli Zhang

The joint transmission scheme of polar codes and sparse code multiple access (SCMA) has been regarded as a promising technology for future wireless communication systems. However, most of the existing polar-coded SCMA (PC-SCMA) systems…

Information Theory · Computer Science 2022-04-01 Shufeng Li , Mingyu Cai , Libiao Jin , Yao Sun , Hongda Wu , Ping Wang

In this paper, we present an adaptive reweighted sparse belief propagation (AR-SBP) decoder for polar codes. The AR-SBP technique is inspired by decoders that employ the sum-product algorithm for low-density parity-check codes. In…

Information Theory · Computer Science 2024-04-09 R. M. Oliveira , R. C. de Lamare

The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic cosets. Which subset is chosen determines the dimension, the minimum distance and the weight distribution of the BCH code. We construct…

Information Theory · Computer Science 2022-06-23 Martin Bossert , Rebekka Schulz , Sebastian Bitzer

A new approach for combining non-binary low-density parity-check (NB-LDPC) codes with higher-order modulation and probabilistic amplitude shaping (PAS) is presented. Instead of symbol-metric decoding (SMD), a bit-metric decoder (BMD) is…

Information Theory · Computer Science 2018-09-12 Fabian Steiner , Georg Böcherer , Gianluigi Liva

In this paper, we propose a new decoder, called the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for Quantum Low-Density Parity-Check (QLDPC) codes. It extends the Multiple-Bases Belief-Propagation (MBBP) framework, originally…

Information Theory · Computer Science 2025-11-06 Sheida Rabeti , Hessam Mahdavifar

An iterative detection and decoding (IDD) scheme is proposed for multiuser multiple-antenna systems assisted by an active or a passive Reconfigurable Intelligent Surface (RIS). The proposed approach features an IDD strategy that…

Information Theory · Computer Science 2024-12-17 R. Porto , R. C. de Lamare

In this paper, we shed light on how an adaptive, efficient error coding in the transport layer helps ensure the application requirements. We recap the use of MDS codes and show that binary coding can significantly reduce the complexity and…

Information Theory · Computer Science 2022-02-22 Pablo Gil Pereira , Thorsten Herfet

In decoding linear block codes, it was shown that noticeable reliability gains can be achieved by introducing learnable parameters to the Belief Propagation (BP) decoder. Despite the success of these methods, there are two key open…

Information Theory · Computer Science 2023-04-13 Sravan Kumar Ankireddy , Hyeji Kim

Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric…

Information Theory · Computer Science 2016-11-17 David Declercq , Bane Vasic , Shiva Kumar Planjery , Erbao Li

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

An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in the literature. The…

We introduce new reliability definitions for bit and check nodes. Maximizing global reliability, which is the sum reliability of all bit nodes, is shown to be equivalent to minimizing a decoding metric which is closely related to the…

Information Theory · Computer Science 2010-01-15 Chi-Yuan Chang , Yu T. Su , Yu-Liang Chen , Yin-Chen Liu

Data center networks (DCNs) require a low-cost, low-power optical transceiver to handle increased traffic from generative artificial intelligence, video streaming services, and more. Improving the required signal-to-noise ratio (RSNR) by…

Signal Processing · Electrical Eng. & Systems 2025-09-09 Takeshi Kakizaki , Masanori Nakamura , Fukutaro Hamaoka , Shuto Yamamoto , Etsushi Yamazaki

One of the challenges often faced with wireless communication systems is its limited range and data-rate. Distributed Transmit Beamforming (DTB) techniques are being developed to address these two issues to provide reliable connectivity…

Signal Processing · Electrical Eng. & Systems 2018-07-18 Ismail Shakeel , Ishtiaq Ahmad , Hajime Suzuki

Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is $\mathbf{GF}(2)$, and the side information alphabet…

Information Theory · Computer Science 2015-03-20 Jin Meng , En-Hui Yang

Guessing Random Additive Noise Decoding (GRAND) is a universal decoding algorithm that can be used to perform maximum likelihood decoding. It attempts to find the errors introduced by the channel by generating a sequence of possible error…

Information Theory · Computer Science 2022-07-26 Carlo Condo