On Analysis Of Asynchronous Grant-Free Access With Rateless Codes.

This paper provides a theoretical analysis of a recently proposed Asynchronous Grant-Free access scheme with rateless codes (A-GF-rateless), which has been demonstrated via simulation the potential to reduce. An approximate expression of its average delay is provided. And it is proved that when the blocking effect is negligible, A-GF-rateless is stable for any parameter settings, indicating that high traffic load can be supported; and with the signal-to-noise ratio (SNR) per user decreasing, the energy efficiency of A-GF-rateless approaches the limit of random access schemes with Gaussian Multiple-Access (GMA) channel given any spectral efficiency, suggesting its advantages in low power consumption and high throughput scenarios.