Low Complexity Schemes For The Random Access Gaussian Channel
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)(2017)
摘要
We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly smaller than that required by popular solutions such as slotted-ALOHA and treating interference as noise.
更多查看译文
关键词
random access Gaussian channel,uncoordinated Gaussian multiple access channel,low complexity coding scheme,compute-and-forward,binary adder channel coding,slotted-ALOHA,noise interference
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络