A Block Term Decomposition Model Based Algorithm for Tensor Completion of Multidimensional Harmonic Signals

• Published in: Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) pp. 1 - 5
• Main Authors: Wang, Lei, Gong, Xiao-Feng, Liu, Xi-Yuan, Feng, Wei, Lin, Qiu-Hua
• Format: Conference Proceeding
• Language: English
• Published: IEEE 06.04.2025
• Subjects: block term decomposition; hankelization; Harmonic analysis; Minimization; Multidimensional harmonic retrieval; Numerical models; Optimization; Signal processing; Signal processing algorithms; Speech processing; tensor completion; Tensors; Wireless communication; Wireless sensor networks
• ISSN: 2379-190X
• DOI: 10.1109/ICASSP49660.2025.10889338

We consider tensor data completion of an incomplete observation of multidimensional harmonic (MH) signals. Unlike existing tensor-based techniques for MH retrieval (MHR), which mostly adopt the canonical polyadic decomposition (CPD) to model the simple "one-to-one" correspondence among harmonics across difference modes, we herein use the more flexible block term decomposition (BTD) model that can be used to describe the complex mutual correspondences among several groups of harmonics across different modes. An optimization principle that aims to fit the BTD model in the least squares sense, subject to rank minimization of hankelized MH components, is set up for the tensor completion task, and an algorithm based on alternating direction method of multipliers is proposed, of which the effectiveness and applicability are validated through both numerical simulations and an application in sub-6GHz channel state information (CSI) completion.