.png){kind=icon}
.png){kind=icon}
Return
Self-Coupling Data Transmission for Random Multiple Access Communications
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.2982388.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a technique for multiple access communications based on the spatial graph coupling principle. Contrary to the existing approaches that require regularized packet transmission times to create a chain of temporally-coupled packets we present a construction of a self-coupling packet. Each transmitted data packet is encoded and modulated in a way that allows the receiver to perform successful cancellation of the inter-packet interference for the case when the packets are transmitted at random times. We show that the overall system throughput can approach the channel capacity limit. Numerical results demonstrate superior bit-error rates achieved by the self-coupling system compared to the temporal-coupling system.
Keywords:
Interference cancellation
Couplings
Receivers
Iterative decoding
Channel capacity
Error correction codes
Transmitters
Multiple access
random access
self-coupling
spatial graph coupling
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W