CIF: Small: Fundamental limits and coding for massive wireless random-access

CIF：小：大规模无线随机访问的基本限制和编码

基本信息

批准号：
1717842
负责人：
Yury Polyanskiy
金额：
$ 45万
依托单位：
Massachusetts Institute of Technology
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2017
资助国家：
美国
起止时间：
2017-07-01 至 2022-06-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1717842&HistoricalAwards=false
关键词：
CIF Small Fundamental limits coding

项目摘要

The key expected innovation of the next generation of radio-access networks (such as cellular) is their ability to service vast numbers of active devices as envisioned in the so-called "Internet-of-Things". Unfortunately, current networks were designed with the human-type communication in mind, and this led to a focus on the operating regime of a (relatively) few simultaneously active users. More specifically, present systems employ centralized resource allocation, thus orthogonalizing the access from different users. This solution is not acceptable for machine-type communication, as it relies on a significant control-layer overhead thereby incurring a significant penalty in latency and energy efficiency. Consequently, there is a strong economical demand for a new solution in both the unlicensed spectrum (so called, low-power wide-area networks) and the licensed spectrum (5G).The goal of this work is to provide theoretical guidance for the design of the multiple-access layer in the next generation of wireless networks. Classical work on the topic lacks several specific details, making it inadequate: ignoring the control-layer overhead in network analytic literature, and ignoring delay in information theory. Consequently, this work aims to provide necessary contemporary modifications: (a) a gigantic number of idle (inactive) users; (b) a still large number of active users; (c) short packets; (d) high energy-efficiency (low energy-per-bit). This project introduces a new paradigm of random-access coding that separates data communication from user identification, for which fundamental limits are going to be derived and the low-complexity practical solutions studied. Performance of the currently available solutions will be contrasted with the non-asymptotic fundamental limits and new solutions developed. In addition to information-theoretic and communication-theoretic parts, the work involves a combinatorial-theoretic component in the form of constructing Sidon sets, B2-sequences and superimposed codes.

下一代无线电访问网络（例如蜂窝）的关键预期创新是它们在所谓的“ Things Internet”中设想的大量主动设备的能力。不幸的是，当前的网络是考虑到人类型通信的设计，这导致着眼于（相对）同时活跃的用户的操作制度。更具体地说，当前系统采用集中资源分配，从而正交从不同用户那里访问。对于机器型通信，该解决方案是不可接受的，因为它依赖于大量的控制层开销，从而产生了延迟和能源效率的重大惩罚。因此，在未经许可的光谱（所谓的低功率宽面积网络）和有执照的频谱（5G）中，对新解决方案的经济需求很大。这项工作的目的是为下一代无线网络的多级访问层设计理论指导。该主题的古典工作缺乏几个具体细节，因此不足：忽略网络分析文献中的控制层开销，而忽略信息理论的延迟。因此，这项工作旨在提供必要的当代修改：（a）庞大的闲置（无活动）用户；（b）仍然有大量活跃用户；（c）短包；（d）高能效率（低能量）。该项目介绍了一个随机访问编码的新范式，该编码将数据通信与用户识别区分开来，该数据将得出基本限制，并研究了低复杂性实用解决方案。当前可用的解决方案的性能将与非反应基本限制和开发的新解决方案形成对比。除了信息理论和通信理论部分外，该作品还涉及组合理论组件的形式，其形式是构建Sidon集，B2序列和叠加的代码。