An Asynchronous Massive Access Scheme with Dynamic Range Considerations

• Published in: Proceedings / IEEE International Symposium on Information Theory pp. 2009 - 2014
• Main Authors: Liu, Lina, Guo, Dongning
• Format: Conference Proceeding
• Language: English
• Published: IEEE 25.06.2023
• Subjects: Delay estimation; device identification; Dynamic range; Frequency estimation; Interference cancellation; near-far problem; OFDM; orthogonal frequency-division multiple-access (OFDMA); Performance evaluation; sparse graph codes; successive interference cancellation; Symbols; Upper bound
• ISSN: 2157-8117
• DOI: 10.1109/ISIT54713.2023.10206478

This paper studies the performance of a transmission and reception scheme for massive access under some practical challenges. One challenge is the near-far problem, i.e., an access point often receives signals from different transmitting devices at vastly different signal strengths. Another challenge is that the signals from different devices may be subject to arbitrary, analog, and heterogeneous delays. This paper considers a fully asynchronous model which is more realistic than the frame or symbol level synchrony needed in most existing work. A main theorem characterizes the asymptotic scaling of the codelength with the number of devices, a device delay upper bound, and the dynamic range of received signal strengths across devices. The scaling result suggests potential advantages of grouping devices with similar received signal strengths and letting the groups use time sharing. The performance of the proposed scheme is evaluated using simulations with and without grouping.