Protograph LDPC code design for asynchronous random access

DOI10.3390/A12080170MaRDI QIDQ2005577zbMATH OpenOpenAlexWikidataFDO

Authors Federico Clazzer, Balázs Matuz, Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Sarah J. Johnson

Publication date 8 October 2020

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1908.01607

zbMATH Keywords

Gaussian interference channelgrant-free accessmedium access controlphysical layer simulationsquantized density evolutionsuccessive interference cancellationunequal error protection

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

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.

Review text

Summary: 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.

Recommendations

• Modern random access protocols
• Limiting performance of frequency-hop random access
• Characterization and optimization of LDPC codes for the 2-user Gaussian multiple access channel
• scientific article; zbMATH DE number 2080804
• Capacity of the wireless packet collision channel without feedback

Cites work

• A perspective on multiaccess channels
• Channels with block interference
• Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
• Design of capacity-approaching irregular low-density parity-check codes
• High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
• Improved low-density parity-check codes using irregular graphs
• Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
• On linear unequal error protection codes
• Parallel concatenated codes with unequal error protection

Cited in

(1)

• Modern random access protocols

This page was built for publication: Protograph LDPC code design for asynchronous random access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005577)