English
Related papers

Related papers: Soft decoding without soft demapping with ORBGRAND

200 papers

The soft-aided bit-marking (SABM) algorithm is based on the idea of marking bits as highly reliable bits (HRBs), highly unreliable bits (HUBs), and uncertain bits to improve the performance of hard-decision (HD) decoders. The HRBs and HUBs…

Information Theory · Computer Science 2021-10-13 Yi Lei , Bin Chen , Gabriele Liga , Alexios Balatsoukas-Stimming , Kaixuan Sun , Alex Alvarado

This paper introduces the notion of soft bits to address the rate-distortion optimization for learning-based image compression. Recent methods for such compression train an autoencoder end-to-end with an objective to strike a balance…

Image and Video Processing · Electrical Eng. & Systems 2019-05-02 David Alexandre , Chih-Peng Chang , Wen-Hsiao Peng , Hsueh-Ming Hang

Within the family of guessing-based decoding algorithms, ordered reliability bits GRAND (ORBGRAND) has attracted considerable attention due to its efficient use of soft information and suitability for hardware implementation. It has also…

Information Theory · Computer Science 2026-05-05 Zhuang Li , Wenyi Zhang

We propose a novel soft-aided hard-decision decoding algorithm for general product-like codes. It achieves error correcting performance similar to that of a soft-decision turbo decoder for staircase and OFEC codes, while maintaining a low…

Information Theory · Computer Science 2024-05-01 Lukas Rapp , Sisi Miao , Laurent Schmalen

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

Power efficiency of noncoherent receivers for impulse-radio ultra-wideband (IR-UWB) transmission systems can significantly be improved, on the one hand, by employing multiple-symbol differential detection (MSDD), and, on the other hand, by…

Information Theory · Computer Science 2010-06-03 Andreas Schenk , Robert F. H. Fischer

Optimal modulation (OM) schemes for Gaussian channels with peak and average power constraints are known to require nonuniform probability distributions over signal points, which presents practical challenges. An established way to map…

Information Theory · Computer Science 2022-11-01 Basak Ozaydin , Muriel Médard , Ken Duffy

Soft demodulation is a basic module of traditional communication receivers. It converts received symbols into soft bits, that is, log likelihood ratios (LLRs). However, in the nonideal additive white Gaussian noise (AWGN) channel, it is…

Signal Processing · Electrical Eng. & Systems 2020-11-24 Shilian Zheng , Xiaoyu Zhou , Shichuan Chen , Peihan Qi , Xiaoniu Yang

We introduce and analyze a discrete soft-decision channel called the linear reliability channel (LRC) in which the soft information is the rank ordering of the received symbol reliabilities. We prove that the LRC is an appropriate…

Information Theory · Computer Science 2025-09-11 Alexander Mariona , Ken R. Duffy , Muriel Médard

The development of practical, high-performance decoding algorithms reduces the resource cost of fault-tolerant quantum computing. Here we propose a decoder for the surface code that finds low-weight correction operators for errors produced…

Quantum Physics · Physics 2025-02-19 Asmae Benhemou , Kaavya Sahay , Lingling Lao , Benjamin J. Brown

We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder uses one bit of soft information to improve its net coding gain by 0.2 dB, reaching 10.3-10.4 dB, which is similar to that of more complex…

Information Theory · Computer Science 2018-10-30 Christoffer Fougstedt , Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva , Per Larsson-Edefors

Recent semantic segmentation methods exploit encoder-decoder architectures to produce the desired pixel-wise segmentation prediction. The last layer of the decoders is typically a bilinear upsampling procedure to recover the final…

Computer Vision and Pattern Recognition · Computer Science 2019-04-08 Zhi Tian , Tong He , Chunhua Shen , Youliang Yan

Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and soft-detection error correction decoding algorithms that provide accurate decoding of any moderate redundancy code of any length. Here we establish a method through…

Information Theory · Computer Science 2023-08-11 Kevin Galligan , Peihong Yuan , Muriel Médard , Ken R. Duffy

Targeting always the best achievable bit error rate (BER) performance in iterative receivers operating over multiple-input multiple-output (MIMO) channels may result in significant waste of resources, especially when the achievable BER is…

Information Theory · Computer Science 2012-10-05 Konstantinos Nikitopoulos , Gerd Ascheid

Quantum error correction enables the preservation of logical qubits with a lower logical error rate than the physical error rate, with performance depending on the decoding method. Traditional error decoding approaches, relying on the…

The ability to efficiently detect the software protections used is at a prime to facilitate the selection and application of adequate deob-fuscation techniques. We present a novel approach that combines semantic reasoning techniques with…

Computation and Language · Computer Science 2019-11-19 Ramtine Tofighi-Shirazi , Irina Mariuca Asavoae , Philippe Elbaz-Vincent

We review the recently introduced soft-aided bit-marking (SABM) algorithm and its suitability for product codes. Some aspects of the implementation of the SABM algorithm are discussed. The influence of suboptimal channel soft information is…

Information Theory · Computer Science 2020-06-05 Alex Alvarado , Gabriele Liga , Yi Lei , Bin Chen , Alexios Balatsoukas-Stimming

Orthogonality is a much desired property for MIMO coding. It enables symbol-wise decoding, where the errors in other symbol estimates do not affect the result, thus providing an optimality that is worth pursuing. Another beneficial property…

Information Theory · Computer Science 2016-11-17 Risto Nordman

Products codes (PCs) are conventionally decoded with efficient iterative bounded-distance decoding (iBDD) based on hard-decision channel outputs which entails a performance loss compared to a soft-decision decoder. Recently, several hybrid…

Information Theory · Computer Science 2022-11-22 Sisi Miao , Lukas Rapp , Laurent Schmalen

Finding optimal correction of errors in generic stabilizer codes is a computationally hard problem, even for simple noise models. While this task can be simplified for codes with some structure, such as topological stabilizer codes,…

Quantum Physics · Physics 2019-06-05 Nishad Maskara , Aleksander Kubica , Tomas Jochym-O'Connor