English
Related papers

Related papers: Performance-Complexity-Latency Trade-offs of Conca…

200 papers

We present a low-complexity and low-latency decoding algorithm for a class of Reed-Muller (RM) subcodes that are defined based on the product of smaller RM codes. More specifically, the input sequence is shaped as a multi-dimensional array,…

Information Theory · Computer Science 2022-02-09 Mohammad Vahid Jamali , Mohammad Fereydounian , Hessam Mahdavifar , Hamed Hassani

In this work, an integrated performance evaluation of a decode-and-forward (DF) multi-hop wireless communication system is undertaken over the non-linear generalized $\alpha-\kappa-\mu$ and $\alpha-\kappa-\mu$-Extreme fading models.…

Information Theory · Computer Science 2019-03-25 Tau Raphael Rasethuntsa , Sandeep Kumar , Manpreet Kaur

The work establishes fundamental limits with respect to rate, reliability and computational complexity, for a general setting of outage-limited MIMO communications. In the high-SNR regime, the limits are optimized over all encoders, all…

Information Theory · Computer Science 2010-06-24 Petros Elia , Joakim Jalden

The performance of algebraic soft-decision decoding of Reed-Solomon codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies of algebraic soft-decision decoding with infinite cost are first studied…

Information Theory · Computer Science 2008-08-05 Jing Jiang , Krishna R. Narayanan

We propose an improved soft-aided decoding scheme for product codes that approaches the decoding performance of conventional soft-decision TPD with only a 0.2 dB gap while keeping the complexity and internal decoder data flow similarly low…

Information Theory · Computer Science 2022-07-12 Sisi Miao , Lukas Rapp , Laurent Schmalen

Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low…

Information Theory · Computer Science 2016-02-22 Mehnaz Rahman , Gwan S. Choi

By inserting interleavers between intermediate stages of the polar encoder, a new class of polar codes, termed interleaved polar (i-polar) codes, is proposed. By the uniform interleaver assumption, we derive the weight enumerating function…

Information Theory · Computer Science 2019-08-05 Mao-Ching Chiu

We consider an approach to fault tolerant quantum computing based on a simple error detecting code operating as the substrate for a conventional surface code. We develop a customised decoder to process the information about the likely…

Quantum Physics · Physics 2019-12-11 Xiaosi Xu , Qi Zhao , Xiao Yuan , Simon C. Benjamin

Modern spacecraft communication systems rely on concatenated error correction schemes, typically combining convolutional and Reed-Solomon (RS) codes. This paper presents a decoder-side method that uses a machine learning model to estimate…

Information Theory · Computer Science 2025-09-12 Michael Greenwood , Robert Hunter

The performance of an error correcting code is evaluated by its error probability, rate, and en/decoding complexity. The performance of a series of codes is evaluated by, as the block lengths approach infinity, whether their error…

Information Theory · Computer Science 2021-07-15 Hsin-Po Wang

This letter introduces a novel channel coding design framework for short-length codewords that permits balancing the tradeoff between the bit error rate floor and waterfall region by modifying a single real-valued parameter. The proposed…

Information Theory · Computer Science 2016-11-17 Mikel Hernaez , Pedro M. crespo , Javier Del Ser

State-constrained signal codes directly encode modulation signals using signal processing filters, the coefficients of which are constrained over the rings of formal power series. Although the performance of signal codes is defined by these…

Information Theory · Computer Science 2019-01-08 Manato Takai , Koji Ishibashi

This paper proposes the Symbolic-Stochastic Chase Decoding Algorithm (S-SCA) for the Reed-Solomon (RS) and BCH codes. By efficient usage of void space between constellation points for $q$-ary modulations and using soft information at the…

Information Theory · Computer Science 2017-07-17 Hossein Mani , Saied Hemati

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed…

Information Theory · Computer Science 2017-03-17 Ilya Dumer , Kirill Shabunov

The sparse Mixture-of-Experts (MoE) architecture is increasingly favored for scaling Large Language Models (LLMs) efficiently, but it depends on heterogeneous compute and memory resources. These factors jointly affect system Cost, Accuracy,…

The sparse Mixture-of-Experts (MoE) architecture is increasingly favored for scaling Large Language Models (LLMs) efficiently, but it depends on heterogeneous compute and memory resources. These factors jointly affect system Cost, Accuracy,…

Decoders that provide an estimate of the probability of a logical failure conditioned on the error syndrome ("soft-output decoders") can reduce the overhead cost of fault-tolerant quantum memory and computation. In this work, we construct…

Quantum Physics · Physics 2024-06-04 Nadine Meister , Christopher A. Pattison , John Preskill

The interpolation based algebraic decoding for Reed-Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic soft decoding (ASD) further improves the decoding…

Information Theory · Computer Science 2018-05-18 Jiongyue Xing , Li Chen , Martin Bossert

With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state…

Information Theory · Computer Science 2017-06-06 Sebastian Schiessl , Hussein Al-Zubaidy , Mikael Skoglund , James Gross