Tight Upper Bounds on the Error Probability of Spinal Codes over Fading Channels

04/27/2023
by   Xiaomeng Chen, et al.
0

Spinal codes, a family of rateless codes introduced in 2011, have been proved to achieve Shannon capacity over both the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we derive explicit tight upper bounds on the error probability of Spinal codes under maximum-likelihood (ML) decoding and perfect channel state information (CSI) over three typical fading channels, including the Rayleigh channel, the Nakagami-m channel and the Rician channel. Simulation results verify the tightness of the derived upper bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2019

Maximum Likelihood Decoding of Convolutionally Coded Noncoherent ASK Signals in AWGN Channels

In this work we develop the maximum likelihood detection (MLD) algorithm...
research
01/20/2021

Spinal Codes Optimization: Error Probability Analysis and Transmission Scheme Design

Spinal codes are known to be capacity achieving over both the additive w...
research
05/18/2018

Maximum Likelihood Upper Bounds on the Capacities of Discrete Information Stable Channels

Motivated by a greedy approach for generating information stable process...
research
03/15/2020

On Approximation, Bounding Exact Calculation of Block Error Probability for Random Codes

This paper presents a method to calculate the exact block error probabil...
research
12/19/2017

Algebraic lattice codes for linear fading channels

In the decades following Shannon's work, the quest to design codes for t...
research
01/13/2021

On a Class of Time-Varying Gaussian ISI Channels

This paper studies a class of stochastic and time-varying Gaussian inter...

Please sign up or login with your details

Forgot password? Click here to reset