English

Protograph LDPC Code Design for Asynchronous Random Access

Information Theory 2019-08-06 v1 math.IT

Abstract

This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define a surrogate channel model and propose different protograph low-density parity-check code designs. The proposed codes are both tested in a setup where the physical layer is abstracted, as well as on a more realistic channel model, where finite-length physical layer simulations of the entire asynchronous random access scheme, including decoding are carried out. We find that the abstracted physical layer model overestimates the performance when short blocks are considered. Additionally, the optimized codes show gains in supported channel traffic - a measure of the number of terminals that can be concurrently accommodated on the channel - of around 17% at a packet loss rate of 10^{-2} w.r.t. off-the-shelf codes.

Keywords

Cite

@article{arxiv.1908.01607,
  title  = {Protograph LDPC Code Design for Asynchronous Random Access},
  author = {Federico Clazzer and Balazs Matuz and Sachini Jayasooriya and Mahyar Shirvanimoghaddam and Sarah J. Johnson},
  journal= {arXiv preprint arXiv:1908.01607},
  year   = {2019}
}

Comments

29 pages, 9 Figures, Submitted for possible publication to MDPI Journal Algorithms