Protograph LDPC code design for asynchronous random access (Q2005577)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7257790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Protograph LDPC code design for asynchronous random access |
scientific article; zbMATH DE number 7257790 |
Statements
Protograph LDPC code design for asynchronous random access (English)
0 references
8 October 2020
0 references
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.
0 references
medium access control
0 references
grant-free access
0 references
unequal error protection
0 references
successive interference cancellation
0 references
physical layer simulations
0 references
quantized density evolution
0 references
Gaussian interference channel
0 references
0 references
0.79061359167099
0 references
0.6839187741279602
0 references
0.6823928952217102
0 references
0.6786457300186157
0 references