Soft decoding without soft demapping with ORBGRAND

07/25/2022
by   Wei An, et al.
0

For spectral efficiency, higher order modulation symbols confer information on more than one bit. As soft detection forward error correction decoders assume the availability of information at binary granularity, however, soft demappers are required to compute per-bit reliabilities from complex-valued signals. Here we show that the recently introduced universal soft detection decoder ORBGRAND can be adapted to work with symbol-level soft information, obviating the need for energy expensive soft demapping. We establish that doing so reduces complexity while retaining the error correction performance achieved with the optimal demapper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2020

On the Performance under Hard and Soft Bitwise Mismatched-Decoding

We investigated a suitable auxiliary channel setting and the gap between...
research
02/08/2021

Max-log APP Detection for Non-bijective Symbol Constellations

A posteriori probability (APP) and max-log APP detection is widely used ...
research
10/08/2022

A General Security Approach for Soft-information Decoding against Smart Bursty Jammers

Malicious attacks such as jamming can cause significant disruption or co...
research
07/02/2019

"Machine LLRning": Learning to Softly Demodulate

Soft demodulation, or demapping, of received symbols back into their con...
research
07/25/2019

Improving HD-FEC decoding via bit marking

We review the recently introduced soft-aided bit-marking (SABM) algorith...
research
10/18/2016

A 9.52 dB NCG FEC scheme and 164 bits/cycle low-complexity product decoder architecture

Powerful Forward Error Correction (FEC) schemes are used in optical comm...
research
11/09/2016

A Brief Survey of Non-Residue Based Computational Error Correction

The idea of computational error correction has been around for over half...

Please sign up or login with your details

Forgot password? Click here to reset