GRAND for Rayleigh Fading Channels

@article{Abbas2022GRANDFR,
  title={GRAND for Rayleigh Fading Channels},
  author={Syed Mohsin Abbas and Marwan Jalaleddine and Warren J. Gross},
  journal={ArXiv},
  year={2022},
  volume={abs/2205.00030}
}
—Guessing Random Additive Noise Decoding (GRAND) is a code-agnostic decoding technique for short-length and high-rate channel codes. GRAND tries to guess the channel noise by generating test error patterns (TEPs), and the sequence of the TEPs is the main difference between different GRAND variants. In this work, we extend the application of GRAND to multipath frequency non-selective Rayleigh fading communication channels, and we refer to this GRAND variant as Fading-GRAND. The proposed Fading… 

Figures and Tables from this paper

Symbol-Level GRAND for High-Order Modulation over Flat Fading Channels

Simulation results demonstrate that symbol- level GRAND produces estimates of the transmitted codewords notably faster than the original GRAND at the cost of a small increase in memory requirements.

GRAND for Fading Channels using Pseudo-soft Information

This work investigates the efficacy of pseudo-soft information extracted from linear zero-forcing and minimum mean square error equalization when fed to a hardware-friendly soft-GRAND (ORBGRAND).

URLLC with Coded Massive MIMO via Random Linear Codes and GRAND

This work proposes a coding and decoding scheme that, in combination with the high spectral efficiency attained by spatial signal processing, can provide URLLC over a fading wireless channel.

Soft-input, soft-output joint detection and GRAND

This work demonstrates how GRAND can leverage crude soft information in received symbols and channel state information to generate, through guesswork, soft bit reliability outputs in log-likelihood ratios (LLRs).

References

SHOWING 1-10 OF 24 REFERENCES

High-Throughput VLSI Architecture for GRAND

The first hardware architecture for the GRAND algorithm is proposed and compared with a decoder tailored for a (79, 64) BCH code show that the proposed architecture can achieve a slightly higher average throughput at high SNRs, while obtaining the same decoding performance.

Capacity-Achieving Guessing Random Additive Noise Decoding

An approximate ML decoding scheme where the receiver abandons the search after a fixed number of queries is introduced, an approach that is also capacity-achieving for an appropriate choice of abandonment threshold, and its complexity, error, and success exponents are characterized.

Optimum selection diversity for BPSK signals in Rayleigh fading channels

  • Young Gil KimS. W. Kim
  • Business, Computer Science
    2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications. ISSTA 2000. Proceedings (Cat. No.00TH8536)
  • 2000
It is shown that the proposed scheme provides the same BER provided by the maximal ratio combining (MRC) scheme for a dual diversity system, and is only 0.3 dB inferior to the MRC when the number of branches is four, in Rayleigh fading channels.

Guessing random additive noise decoding with soft detection symbol reliability information - SGRAND

  • K. DuffyM. Médard
  • Computer Science
    2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
SGRAND inherits desirable properties of GRAND, including being capacity achieving when used with random code-books, and having a complexity that reduces as the code-rate increases.

High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND

The first hardware architecture for ORBGRAND is reported, which achieves an average throughput of up to 42.5 Gb/s for a code length of 128 at a target frame error rate (FER) of 10 and can be used to decode any code as long as the length and rate constraints are met.

Keep the bursts and ditch the interleavers

It is established that certain well-known structured codes are ill-suited for use in bursty channels, but Random Linear Codes (RLCs) are robust to correlated noise, which suggests that the use of RLCs with GRAND-MO is a good candidate for applications requiring high throughput with low latency.

Fundamentals of Wireless Communication

This paper presents a meta-modelling architecture for multiuser communication based on the MIMO model, which combines spatial multiplexing, channel modeling, and diversity-multiplexing techniques.

Nonbinary BCH decoding (Abstr.)

The decoding of BCH codes readily reduces to the solution of a certain key equation. An iterative algorithm is presented for solving this equation over any field. Following a heuristic derivation of

Channel Coding for High Performance Wireless Control in Critical Applications: Survey and Analysis

A detailed analysis of currently used short packet coding schemes in industrial wireless sensor networks, including seven coding schemes and their possible variants, and proposes four principles to filter the most promising coding schemes.

Performance Comparison Among Conventional Selection Combining, Optimum Selection Combining and Maximal Ratio Combining

  • N. Kong
  • Business
    2009 IEEE International Conference on Communications
  • 2009
Close-form expressions for the SNR gaps among these three combining schemes are derived and the asymptotic BER for these three combine schemes as a function of DO for a fixed SNR is analyzed.