A Block Term Decomposition Model Based Algorithm for Tensor Completion of Multidimensional Harmonic Signals
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913666531590144 |
|---|---|
| author | Wang, Lei Gong, Xiao-Feng Liu, Xi-Yuan Feng, Wei Lin, Qiu-Hua |
| author_facet | Wang, Lei Gong, Xiao-Feng Liu, Xi-Yuan Feng, Wei Lin, Qiu-Hua |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_15166 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Block Term Decomposition Model Based Algorithm for Tensor Completion of Multidimensional Harmonic Signals Wang, Lei Gong, Xiao-Feng Liu, Xi-Yuan Feng, Wei Lin, Qiu-Hua Signal Processing 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. |
| title | A Block Term Decomposition Model Based Algorithm for Tensor Completion of Multidimensional Harmonic Signals |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2501.15166 |