Protograph LDPC Code Design for Asynchronous Random Access†
AbstractThis 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
Share & Cite This Article
Clazzer, F.; Matuz, B.; Jayasooriya, S.; Shirvanimoghaddam, M.; Johnson, S.J. Protograph LDPC Code Design for Asynchronous Random Access. Algorithms 2019, 12, 170.
Clazzer F, Matuz B, Jayasooriya S, Shirvanimoghaddam M, Johnson SJ. Protograph LDPC Code Design for Asynchronous Random Access. Algorithms. 2019; 12(8):170.Chicago/Turabian Style
Clazzer, Federico; Matuz, Balázs; Jayasooriya, Sachini; Shirvanimoghaddam, Mahyar; Johnson, Sarah J. 2019. "Protograph LDPC Code Design for Asynchronous Random Access." Algorithms 12, no. 8: 170.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.