skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Laplacian-ORBGRAND: Decoding for Impulsive Noise
While many communication systems experience extraneous noise that is well-modelled as Gaussian, experimental studies have shown that large values are more common when noise is impulsive and the Laplace distribution has been proposed as a more appropriate statistical model in that setting. Guessing Random Additive Noise Decoding is a class of forward error correction decoders that can avail of channel knowledge to improve decoding. Here we introduce a GRAND decoder that is specifically tailored to impulsive noise, which we call Laplace Ordered Reliability Bits GRAND (LORBGRAND). By adapting GRAND to the characteristics of Laplace noise we find an improvement of the order of ~1dB in block error rate, highlighting the benefits of noise-specific decoding strategies. Additionally, we extend the algorithm to provide soft output to indicate the probability estimation of correct decoding, which can be used to identify unreliable decoded signals.  more » « less
Award ID(s):
2128555
PAR ID:
10572511
Author(s) / Creator(s):
; ;
Publisher / Repository:
IEEE
Date Published:
ISSN:
2155-7586
ISBN:
979-8-3503-7423-0
Page Range / eLocation ID:
1 to 6
Format(s):
Medium: X
Location:
Washington, DC, USA
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, MILCOM IEEE Military Communications Conference)
    We introduce a novel approach to error correction decoding in the presence of additive alpha-stable noise, which serves as a model of interference-limited wireless systems. In the absence of modifications to decoding algorithms, treating alpha-stable distributions as Gaussian results in significant performance loss. Building on Guessing Random Additive Noise Decoding (GRAND), we consider two approaches. The first accounts for alpha-stable noise in the evaluation of log-likelihood ratios (LLRs) that serve as input to Ordered Reliability Bits GRAND (ORBGRAND). The second builds on an ORBGRAND variant that was originally designed to account for jamming that treats outlying LLRs as erasures. This results in a hybrid error and erasure correcting decoder that corrects errors via ORBGRAND and corrects erasures via Gaussian elimination. The block error rate (BLER) performance of both approaches are similar. Both outperform decoding assuming that the LLRs originated from Gaussian noise by ∼2 to ∼3 dB for [128,112] 5G NR CA-Polar and CRC codes. 
    more » « less
  2. ; ; (, IEEE LatinAmerican Conference on Communications)
    In this work, we discuss time-shift coding and GRAND ZigZag decoding for uncoordinated multiple access channels (MACs). Time-shift coding relies on the delay difference of the received packets to prevent fully overlapped collisions. Users transmit with different time-shifts in designated time slots until the receiver successfully decodes all messages. At the receiver side, ZigZag decoding is employed to separate packets with linear complexity in noiseless scenarios. For cases with noise, a guessing random additive noise decoding (GRAND)-based algorithm is utilized to identify the most probable noise vector in conjunction with ZigZag decoding. Simulation results demonstrate that time-shift coding significantly reduces collision probabilities, thereby enhancing system throughput in noiseless scenarios. In the context of Gaussian MAC, the GRAND ZigZag decoding method outperforms successive interference cancellation (SIC)-based schemes in high signal-to-noise ratio (SNR) regimes. 
    more » « less
  3. ; ; (, IEEE)
    Quantum low-density parity-check codes are a promising approach to fault-tolerant quantum computation, offering potential advantages in rate and decoding efficiency. Quantum Margulis codes are a new class of QLDPC codes derived from Margulis’ classical LDPC construction via the two-block group algebra framework. We show that quantum Margulis codes, unlike bivariate bicycle codes, which require ordered statistics decoding for effective error correction, can be efficiently decoded using a standard min-sum decoder with linear complexity, when decoded under depolarizing noise. This is attributed to their Tanner graph structure, which does not exhibit group symmetry, thereby mitigating the well-known problem of error degeneracy in QLDPC decoding. To further enhance performance, we propose an algorithm for constructing 2BGA codes with controlled girth, ensuring a minimum girth of 6 or 8, and use it to generate several quantum Margulis codes of length 240 and 642. We validate our approach through numerical simulations, demonstrating that quantum Margulis codes behave significantly better than BB codes in the error floor region, under min-sum decoding. 
    more » « less
  4. ; ; (, IEEE)
    Quantum low-density parity-check (LDPC) codes are a promising family of quantum error-correcting codes for fault tolerant quantum computing with low overhead. Decoding quantum LDPC codes on quantum erasure channels has received more attention recently due to advances in erasure conversion for various types of qubits including neutral atoms, trapped ions, and superconducting qubits. Belief propagation with guided decimation (BPGD) decoding of quantum LDPC codes has demonstrated good performance in bit-flip and depolarizing noise. In this work, we apply BPGD decoding to quantum erasure channels. Using a natural modification, we show that BPGD offers competitive performance on quantum erasure channels for multiple families of quantum LDPC codes. Furthermore, we show that the performance of BPGD decoding on erasure channels can sometimes be improved significantly by either adding damping or adjusting the initial channel log-likelihood ratio for bits that are not erased. More generally, our results demonstrate BPGD is an effective general-purpose solution for erasure decoding across the quantum LDPC landscape. 
    more » « less
  5. ; ; (, Research Square Preprint)
    Ising machines have recently been attracting attention due to their apparent ability to solve5 difficult combinatorial problems using analog operational principles. Oscillator Ising Machines6 (OIM) are especially attractive because they can be implemented easily as integrated circuits (ICs)7 in standard CMOS electronics. We explore the performance of OIM for decoding noisy Multi-User8 MIMO signals, a problem of considerable interest in modern telecommunications. Our results9 indicate that OIM-based decoding achieves error rates almost as good as the optimal Maximum10 Likelihood method, over a wide range of practical signal-to-noise (SNR) values. At high SNR11 values, OIM achieves ~20x fewer errors than LMMSE, a decoding method used widely in industry12 today. We also investigate the influence of parameter precision on decoding performance, finding13 that using 6 or more bits of precision largely retains OIM’s advantages across all SNR values. We14 estimate that straightforward CMOS OIM implementations can easily solve MU-MIMO decoding15 problems in under 10ns, more than 100x faster than current industrial requirements. We conclude16 that oscillator Ising machines can be effective for real-world applications, possibly serving as an17 important enabler for future telecommunication standards. Our results and data provide guidance18 for designing hardware OIM prototypes specialized for MU-MIMO decoding. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email