论文标题
覆盖雷达通信系统的双盲反卷积
Dual-Blind Deconvolution for Overlaid Radar-Communications Systems
论文作者
论文摘要
越来越拥挤的频谱刺激了共享硬件资源并有效使用射频频谱的联合雷达通信系统的设计。我们研究了一般光谱共存方案,其中接收器的雷达和通信系统的通道和传输信号是未知的。在这个双盲反卷积(DBD)问题中,一个常见的接收器承认了一个多携带者无线通信信号,该信号与雷达信号覆盖的多个目标反映了多个目标。通信和雷达通道由多个传输路径和多个目标的连续值范围时间和多普勒速度表示。我们利用两个通道的稀疏性来解决高度不良的DBD问题,通过将其施放到多元原子规范(SOMAN)最小化中。我们设计了一个半决赛程序,以使用阳性 - 高质三角多项式(PHTP)的理论来估计未知目标和通信参数。我们的理论分析表明,接近完美恢复所需的最小样本数取决于雷达目标和通信路径的最大数量的对数,而不是其总和。我们表明,我们的SOMAN方法和PHTP公式也适用于更通用的情况,例如非同步传输,噪声的存在和多个发射器。数值实验表明,在不同情况下,参数恢复期间的性能提高了。
The increasingly crowded spectrum has spurred the design of joint radar-communications systems that share hardware resources and efficiently use the radio frequency spectrum. We study a general spectral coexistence scenario, wherein the channels and transmit signals of both radar and communications systems are unknown at the receiver. In this dual-blind deconvolution (DBD) problem, a common receiver admits a multi-carrier wireless communications signal that is overlaid with the radar signal reflected off multiple targets. The communications and radar channels are represented by continuous-valued range-time and Doppler velocities of multiple transmission paths and multiple targets. We exploit the sparsity of both channels to solve the highly ill-posed DBD problem by casting it into a sum of multivariate atomic norms (SoMAN) minimization. We devise a semidefinite program to estimate the unknown target and communications parameters using the theories of positive-hyperoctant trigonometric polynomials (PhTP). Our theoretical analyses show that the minimum number of samples required for near-perfect recovery is dependent on the logarithm of the maximum of number of radar targets and communications paths rather than their sum. We show that our SoMAN method and PhTP formulations are also applicable to more general scenarios such as unsynchronized transmission, the presence of noise, and multiple emitters. Numerical experiments demonstrate great performance enhancements during parameter recovery under different scenarios.