Channel Coding in Random Access Communication over Compound Channels
Information Theory
2011-10-11 v1 math.IT
Abstract
Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the time varying channel states with high precision. This paper investigates random multiple access communication over a compound wireless channel where channel realization is known neither at the transmitters nor at the receiver. An achievable rate and error probability tradeoff bound is derived under the non-asymptotic assumption of a finite codeword length. The results are then extended to the random multiple access system where the receiver is only interested in decoding messages from a user subset.
Cite
@article{arxiv.1110.1891,
title = {Channel Coding in Random Access Communication over Compound Channels},
author = {Zheng Wang and Jie Luo},
journal= {arXiv preprint arXiv:1110.1891},
year = {2011}
}