75 citations · 130 across the 9 of their papers we have counts for
12 papers
A GCICA Grant-Free Random Access Scheme for M2M Communications in Crowded Massive MIMO Systems
Huimei Han, Lushun Fang, Weidang Lu +3
A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems.…
A novel random access scheme for M2M communication in crowded asynchronous massive MIMO systems
Huimei Han, Wenchao Zhai, Zhefu Wu +3
A new random access scheme is proposed to solve the intra-cell pilot collision for M2M communication in crowded asynchronous massive multiple-input multiple-output (MIMO) systems.…
User Activity Detection and Channel Estimation for Grant-Free Random Access in LEO Satellite-Enabled Internet-of-Things
Zhaoji Zhang, Ying Li, Chongwen Huang +4
With recent advances on the dense low-earth orbit (LEO) constellation, LEO satellite network has become one promising solution to providing global coverage for Internet-of-Things (…
Random NOMA With Cross-Slot Successive Interference Cancellation Packet Recovery
Zhaoji Zhang, Ying Li, Guanghui Song +2
Conventional power-domain non-orthogonal multiple access (NOMA) relies on precise power control, which requires real-time channel state information at transmitters. This requiremen…
DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access
Zhaoji Zhang, Ying Li, Chongwen Huang +3
In the upcoming Internet-of-Things (IoT) era, the communication is often featured by massive connection, sporadic transmission, and small-sized data packets, which poses new requir…
DNN-Aided Message Passing Based Block Sparse Bayesian Learning for Joint User Activity Detection and Channel Estimation
Zhaoji Zhang, Ying Li, Chongwen Huang +3
Faced with the massive connection, sporadic transmission, and small-sized data packets in future cellular communication, a grant-free non-orthogonal random access (NORA) system is…