Order-Optimal Multiple-Access Channel for Massive MIMO via Group Testing Decoding

George Vershinin,Asaf Cohen,Omer Gurewitz

IEEE Transactions on Communications(2024)

引用 0|浏览1
暂无评分
摘要
The number of wireless devices continues to grow, and more antennas per device are added, increasing the challenge of efficient resource allocation, especially for uplink streams. To address this, we propose a novel massive multiple-user multiple-input-multiple-output (MU-MIMO) scheme based on Group Testing (GT) with non-cooperative self-scheduling users, reducing the required overhead and complexity. Specifically, we show that out of a population of N devices with M messages each, it is possible for the base station (BS) to jointly identify and decode up to K devices, unknown in advance, simultaneously without the BS applying any scheduling algorithm or collecting channel state information. The BS efficiently decodes the transmissions with vanishing error probability using only O ( K log NM ) antennas, which implies order–optimal number of antennas.
更多
查看译文
关键词
Massive MIMO,Multiple-Access Channel,Group Testing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要