Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication

05/13/2020
by   Yuxin Liu, et al.
0

This paper applies error-exponent and dispersion-style analyses to derive finite-blocklength achievability bounds for low-density parity-check (LDPC) codes over the point-to-point channel (PPC) and multiple access channel (MAC). The error-exponent analysis applies Gallager's error exponent to bound achievable symmetrical and asymmetrical rates in the MAC. The dispersion-style analysis begins with a generalization of the random coding union (RCU) bound from random code ensembles with i.i.d. codewords to random code ensembles in which codewords may be statistically dependent; this generalization is useful since the codewords of random linear codes such as random LDPC codes are dependent. Application of the RCU bound yields improved finite-blocklength error bounds and asymptotic achievability results for i.i.d. random codes and new finite-blocklength error bounds and achievability results for LDPC codes. For discrete, memoryless channels, these results show that LDPC codes achieve first- and second-order performance that is optimal for the PPC and identical to the best-prior results for the MAC.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2020

Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels

An asynchronous multiple access error exponent result implicates a new r...
research
10/04/2022

Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing

We present finite-blocklength achievability bounds for the unsourced A-c...
research
03/15/2022

Concentration Properties of Random Codes

This paper studies the concentration properties of random codes. Specifi...
research
03/04/2019

Error Exponents of Typical Random Trellis Codes

In continuation to an earlier work, where error exponents of typical ran...
research
01/23/2018

On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback

We derive a lower and upper bound on the reliability function of discret...
research
01/21/2019

A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure Channel

A lower bound on the maximum likelihood (ML) decoding error exponent of ...
research
03/29/2022

Typical Error Exponents: A Dual Domain Derivation

This paper shows that the probability that the error exponent of a given...

Please sign up or login with your details

Forgot password? Click here to reset