English
Related papers

Related papers: Characterization of Blind Code Rate Recovery in Li…

200 papers

In digital baseband processing, the forward error correction (FEC) unit belongs to the most demanding components in terms of computational complexity and power consumption. Hence, efficient implementation of FEC decoders is crucial for next…

Information Theory · Computer Science 2024-06-04 Claus Kestel , Lucas Johannsen , Norbert Wehn

High frame-corruption is widely observed in Long Range Wide Area Networks (LoRaWAN) due to the coexistence with other networks in ISM bands and an Aloha-like MAC layer. LoRa's Forward Error Correction (FEC) mechanism is often insufficient…

Information Theory · Computer Science 2021-07-20 Niloofar Yazdani , Nikolaos Kouvelas , R Venkatesha Prasad , Daniel E. Lucani

Low Density Parity Check (LDPC) codes are linear error correcting codes used in communication systems for Forward Error Correction (FEC). But, intensive computation is required for encoding and decoding of LDPC codes, making it difficult…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-13 Bhargav Gokalgandhi , Ivan Seskar

The FEC limit paradigm is the prevalent practice for designing optical communication systems to attain a certain bit-error rate (BER) without forward error correction (FEC). This practice assumes that there is an FEC code that will reduce…

Information Theory · Computer Science 2024-01-25 Alex Alvarado , Erik Agrell , Domanic Lavery , Robert Maher , Polina Bayvel

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti

In this paper, we present an optimal metric function on average, which leads to a significantly low decoding computation while maintaining the superiority of the polarization-adjusted convolutional (PAC) codes' error-correction performance.…

Information Theory · Computer Science 2020-12-11 Mohsen Moradi

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

Artificial intelligence (AI) provides an alternative way to design channel coding with affordable complexity. However, most existing studies can only learn codes for a given size and rate, typically defined by a fixed network architecture…

Signal Processing · Electrical Eng. & Systems 2024-11-28 Yukun Cheng , Wei Chen , Tianwei Hou , Geoffrey Ye Li , Bo Ai

We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in…

Information Theory · Computer Science 2016-11-15 Constantinos Daskalakis , Alexandros G. Dimakis , Richard M. Karp , Martin J. Wainwright

The design of optimal linear block codes capable of being efficiently decoded is of major concern, especially for short block lengths. As near capacity-approaching codes, Low-Density Parity-Check (LDPC) codes possess several advantages over…

Information Theory · Computer Science 2024-10-11 Yoni Choukroun , Lior Wolf

Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes \cite{Kschischang01}. An…

Information Theory · Computer Science 2009-08-27 Xudong Ma , En-hui Yang

We propose several improvements for Linear Programming (LP) decoding algorithms for High Density Parity Check (HDPC) codes. First, we use the automorphism groups of a code to create parity check matrix diversity and to generate valid cuts…

Information Theory · Computer Science 2016-11-18 Alex Yufit , Asi Lifshitz , Yair Be'ery

Inner and outer bounds are derived on the optimal performance of fixed length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First an inner bound is derived using a two phase encoding scheme with…

Information Theory · Computer Science 2020-01-03 Baris Nakiboglu , Lizhong Zheng

Visible light communication (VLC) could provide short-range optical wireless communication together with illumination using LED lighting. However, conventional forward error correction (FEC) codes for reliable communication do not have the…

Information Theory · Computer Science 2018-10-18 Junbin Fang , Zhen Che , Xiaolong Yu , Zhe Chen , Zoe L. Jiang , Siu-Ming Yiu , Kui Ren , Xiaoqing Tan

For a multiple-input multiple-output (MIMO) system with unknown channel state information (CSI), a novel low-density parity check (LDPC)-coded transmission (LCT) scheme with joint pilot and data channel estimation is proposed. To fine-tune…

Information Theory · Computer Science 2023-11-14 Binghui Shi , Yongpeng Wu , Peihong Yuan , Derrick Wing Kwan Ng , Xiang-Gen Xia , Wenjun Zhang

Future wireless applications such as high definition video streaming, wireless cloud radio access networks, and cellular data offload are bandwidth-hungry, which highlights the need for Wi-Fi links exceeding 1 Gb/s. This article discusses…

Information Theory · Computer Science 2019-01-08 A. G. D. Uchoa , R. C. de Lamare

Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive…

Information Theory · Computer Science 2018-11-07 Hossein Khoshnevis , Ian Marsland , Halim Yanikomeroglu

In Linear Programming (LP) decoding of a Low-Density-Parity-Check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over a relaxation of the polytope spanned by the codewords \cite{03FWK}. In…

Information Theory · Computer Science 2007-07-13 Michael Chertkov , Mikhail G. Stepanov

We consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In…

Information Theory · Computer Science 2015-03-19 Shrinivas Kudekar , Jason K. Johnson , Misha Chertkov

Efficient decoding is crucial to high-throughput and power-sensitive wireless communication scenarios. A theoretical analysis of the performance-complexity tradeoff toward low-complexity decoding is required for a better understanding of…

Information Theory · Computer Science 2025-11-12 Qingqing Peng , Dawei Yin , Dongxu Chang , Yuan Li , Huazi Zhang , Guiying Yan , Guanghui Wang