Collaborative Research: CIF: Small: Low-Complexity Algorithms for Unsourced Multiple Access and Compressed Sensing in Large Dimensions

合作研究：CIF：小型：大维度无源多址和压缩感知的低复杂度算法

• 批准号: 2131115
• 负责人: Yury Polyanskiy
• 金额: $ 17.5万
• 依托单位: Massachusetts Institute of Technology
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2021
• 资助国家: 美国
• 起止时间: 2021-10-01 至 2024-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2131115&HistoricalAwards=false
• 关键词: Collaborative; Research; CIF; Small; Low

Wireless traffic is increasingly heterogeneous, with growth coming primarily from unattended devices. While early implementations of wireless communication systems have focused on voice telephony, subsequent generations of cellular infrastructures have enabled users to connect more broadly with the Internet, in support of applications such as gaming, browsing, and video watching. Looking into the future, unattended devices are predicted to grow rapidly and to generate a significant portion of the wireless data traffic. This evolution represents a formidable challenge for current infrastructures because such devices interact with the Internet in fundamentally different ways than humans. Individuals tend to establish sustained connections through their phones or computers, whereas machines often sporadically transmit status updates or control decisions with very short payloads. Without a fundamental redesign of the medium access control layer, wireless infrastructures will be unable to efficiently carry machine-type traffic, thereby creating a bottleneck for growth and innovation. The main goal of this research effort is to devise pragmatic random access schemes for machine-type data, with an eye towards addressing the aforementioned issues associated with the digital traffic of tomorrow. Findings from this project are expected to (i) help strengthen digital infrastructures, by now unanimously recognized as a key driver of the economy; (ii) train competent engineers with skills attuned to societal needs; and (iii) broaden participation in science, technology, engineering, and mathematics through recruiting and mentoring. Close connections will be exploited between multiple-access communication, compressed sensing, and sparse graph inference. The crucial challenges and main innovations arise from the exceedingly large dimensionality of the engineering problems considered, compared to the state-of-the-art. The envisioned structures and algorithms for performing at such scales are rooted in the divide-and-conquer approaches of stochastic binning and splitting data. Techniques from graph-based codes to modern iterative methods and interference management are expected to play important roles in pushing the boundaries of unsourced random access and inference in large dimensions. The fundamental limits of complexity-constrained algorithms in wireless communications will be characterized by leveraging recently developed tools from finite-block-length information theory, statistical physics, and applied probability. Key attributes of the proposed models include uncoordinated access and the ability to operate without explicitly acquiring device identities. This departure from established schemes is crucial for eliminating a reliance on individualized feedback, which has enabled fast connections in the past but would now become cost-prohibitive as a mechanism for machine-type traffic. Likely outcomes for this project include near-optimum, low-complexity schemes for the next-generation of random access wireless systems, which will be broadly applicable to deal with inference in exceedingly large dimensions.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

无线流量的异构性越来越强，增长主要来自无人值守设备。虽然无线通信系统的早期实现集中于语音电话，但是随后的几代蜂窝基础设施已经使得用户能够更广泛地与因特网连接，以支持诸如游戏、浏览和视频观看的应用。展望未来，无人值守设备预计将迅速增长，并产生相当大一部分的无线数据流量。这种演变对当前的基础设施来说是一个巨大的挑战，因为这些设备与互联网的交互方式与人类完全不同。个人倾向于通过手机或电脑建立持续的联系，而机器通常会偶尔发送状态更新或控制决策，有效载荷非常短。如果不从根本上重新设计媒体访问控制层，无线基础设施将无法有效地承载机器类型的流量，从而造成增长和创新的瓶颈。这项研究工作的主要目标是为机器类型的数据设计实用的随机访问方案，着眼于解决上述问题与未来的数字交通。该项目的研究结果预计将（i）帮助加强数字基础设施，目前一致认为这是经济的关键驱动力;（ii）培养具有适应社会需求的技能的合格工程师;（iii）通过招聘和指导扩大科学，技术，工程和数学的参与。将利用多路访问通信，压缩传感和稀疏图推理之间的密切联系。关键的挑战和主要的创新来自于所考虑的工程问题的极大的维度，与最先进的相比。设想的结构和算法在这样的规模上执行植根于随机分箱和分裂数据的分治方法。从基于图的代码到现代迭代方法和干扰管理的技术预计将在推动无源随机访问和大维度推理的边界方面发挥重要作用。无线通信中复杂性约束算法的基本限制将通过利用最近开发的有限块长度信息理论、统计物理和应用概率工具来表征。所提出的模型的关键属性包括不协调的访问和操作的能力，而无需明确获取设备身份。这种对既定方案的偏离对于消除对个性化反馈的依赖至关重要，个性化反馈在过去实现了快速连接，但现在作为机器类型流量的机制，成本过高。该项目的可能成果包括下一代随机接入无线系统的接近最佳、低复杂度的方案，该方案将广泛适用于处理超大尺寸的推理。该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals

• DOI: 10.1109/globecom48099.2022.10001513
• 发表时间: 2022-09
• 期刊: GLOBECOM 2022 - 2022 IEEE Global Communications Conference
• 作者: A. Lancho;A. Weiss;Gary C. F. Lee;Jennifer Tang;Yuheng Bu;Yury Polyanskiy;G. Wornell

On the Advantages of Asynchrony in the Unsourced MAC

论异步在无源MAC中的优点

• DOI: 10.1109/isit54713.2023.10206586
• 发表时间: 2023
• 期刊: IEEE
• 作者: Fengler, Alexander;Lancho, Alejandro;Narayanan, Krishna;Polyanskiy, Yury
• 通讯作者: Polyanskiy, Yury

Empirical Bayes via ERM and Rademacher complexities: the Poisson model

• 发表时间: 2023-07
• 期刊: Frontiers in Veterinary Science
• 影响因子: 3.2
• 作者: Soham Jana;Yury Polyanskiy;Anzo Teh;Yihong Wu

Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation

• DOI: 10.1109/mlsp55214.2022.9943311
• 发表时间: 2022-08
• 期刊: 2022 IEEE 32nd International Workshop on Machine Learning for Signal Processing (MLSP)
• 作者: Gary C. F. Lee;A. Weiss;A. Lancho;Jennifer Tang;Yuheng Bu;Yury Polyanskiy;G. Wornell

Capacity of Noisy Permutation Channels

噪声排列通道的容量

• DOI: 10.1109/tit.2023.3247812
• 发表时间: 2023
• 期刊: IEEE Transactions on Information Theory
• 影响因子: 2.5
• 作者: Tang, Jennifer;Polyanskiy, Yury
• 通讯作者: Polyanskiy, Yury