SURVEYS AND REVIEWS
ZHENG Hang, SHI Zhi-guo, WANG Yong, ZHOU Cheng-wei
With the continuous construction of new information infrastructures, multi-dimensional array signal processing plays a fundamental role in the filed of radar, wireless communication, remote sensing and so on. Multidimensional array signals contain rich spatial/temporal/frequentiol/polarization parametric information, offering great economic and social values. To deal with the problem of structural information loss inherent in traditional vector/matrix models, the tensor algebra has been adopted to effectively retrieve multi-dimensional signal features. However, as the dimension of signals increases, the tensor signal volume following the Nyquist sampling theorem exponentially expands. Unfortunately, computation resources of the system are approaching the physical limit, resulting in computational overload and high latency. Concerning these issues, the sparse sensing theory has been developed to exploit the spatial sparsity of signals for sub-Nyquist processing. The extension from one-dimensional sparse sensing to multi-dimensional sparse sensing becomes a promising solution to efficient tensor signal processing. Meanwhile, by imposing structured sparse sensing paradigm such as coprime and nested sensing, the performance of the system can be enhanced via augmented coarray signal processing. Thus, to pursue the high economy of multi-dimensional array signal processing, this paper endeavors to the research onStructured Sparse Tensor Signal Processing for Sensor Arrays. In particular, the paper introduces the statistical theory of sub-Nyquist tensor signals. By deriving the augmented coarray tensor model and devising the corresponding strategy of source identifiability enhancement, this theory facilitates Nyquist matching in the virtual domain and underdetermined parameter estimation. Based upon this theory, this paper introduces a coarray tensor completion algorithm for sparse array DOA estimation, exploiting the full information of the discontinuous virtual array to achieve high accuracy and resolution. Meanwhile, this paper introduces a coprime tensor weights optimization algorithm for sparse array beamforming, which yields a beampatten with a sharper mainlobe and lower sidelobes, and increases the output signal-to-interference-plus-noise ratio. Furthermore, this paper introduces a resource-efficient tensorized neural network for robust sparse tensor signal processing, which compensates the performance deterioration for the model-driven methods in non-ideal conditions by efficiently learning tensor signal features.