.png){kind=icon}
.png){kind=icon}
Return
Collision Resolution for Random Access
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2021.3122016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As a building block toward a simple and scalable solution for massive random access, we introduce collision-resolution algorithms using successive interference cancellation (SIC) based on the received signals, with no need for any coordination or codebook differentiation. We first consider two-user multiple access with the ZigZag algorithm. We prove that the original ZigZag and a modified version of it, called double-zipper ZigZag, attain the same performance as the optimal coordinated time-sharing in the high signal to noise ratio (SNR) regime, even in the presence of channel state information (CSI) errors. We then extend the results to the case of arbitrary number of users employing delay-domain processing. Specifically, we introduce delay-domain zero forcing and its regularized version, which are able to cancel and suppress the interference among users, respectively. By obtaining a post-processing system model and characterizing the accumulated noise during the decoupling process, we also derive bounds on the achievable sum-rates of the proposed algorithm for both cases of perfect and imperfect CSI. Simulation results show that the newly proposed approach have comparable performance with coordinated time-sharing at high SNRs.
Keywords:
Receivers
Delays
Silicon carbide
Interference cancellation
Signal resolution
Inference algorithms
Throughput
ZigZag algorithm
collision resolution
interference cancellation
delay domain processing
massive random access
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W