{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T13:56:05Z","timestamp":1777125365136,"version":"3.51.4"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62471084"],"award-info":[{"award-number":["62471084"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62471082"],"award-info":[{"award-number":["62471082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.sigpro.2026.110637","type":"journal-article","created":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T08:56:54Z","timestamp":1775897814000},"page":"110637","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Block term decomposition based tensor completion of multidimensional harmonic signals with applications"],"prefix":"10.1016","volume":"246","author":[{"given":"Lei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8360-8107","authenticated-orcid":false,"given":"Xiao-Feng","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi-Yuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0145-7136","authenticated-orcid":false,"given":"Qiu-Hua","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.sigpro.2026.110637_bib0001","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/78.127959","article-title":"Multiple invariance ESPRIT","volume":"40","author":"Swindlehurst","year":"1992","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110637_bib0002","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/78.651206","article-title":"Simultaneous Schur decomposition of several nonsymmetric matrices to achieve automatic pairing in multidimensional harmonic retrieval problems","volume":"46","author":"Haardt","year":"1998","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"10.1016\/j.sigpro.2026.110637_bib0003","doi-asserted-by":"crossref","first-page":"2377","DOI":"10.1109\/78.852018","article-title":"Parallel factor analysis in sensor array processing","volume":"48","author":"Sidiropoulos","year":"2000","journal-title":"IEEE Trans. Signal Process."},{"issue":"7","key":"10.1016\/j.sigpro.2026.110637_bib0004","doi-asserted-by":"crossref","first-page":"3198","DOI":"10.1109\/TSP.2008.917929","article-title":"Higher-order SVD-based subspace estimation to improve the parameter estimation accuracy in multidimensional harmonic retrieval problems","volume":"56","author":"Haardt","year":"2008","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110637_bib0005","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/TSP.2016.2614797","article-title":"Multidimensional harmonic retrieval via coupled canonical polyadic decomposition\u2014Part II: algorithm and multirate sampling","volume":"65","author":"S\u00f8rensen","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"issue":"22","key":"10.1016\/j.sigpro.2026.110637_bib0006","doi-asserted-by":"crossref","first-page":"5507","DOI":"10.1109\/TSP.2013.2276416","article-title":"Blind signal separation via tensor decomposition with vandermonde factor: canonical polyadic decomposition","volume":"61","author":"S\u00f8rensen","year":"2013","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110637_bib0007","series-title":"Proc. IEEE Sen. Array and Multichannel Signal Process. Workshop (SAM)","first-page":"1","article-title":"Rectified ALS algorithm for multidimensional harmonic retrieval","author":"Boyer","year":"2016"},{"key":"10.1016\/j.sigpro.2026.110637_bib0008","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/TSP.2023.3246231","article-title":"An ESPRIT-based supervised channel estimation method using tensor train decomposition for mmWave 3-D MIMO-OFDM systems","volume":"71","author":"Gong","year":"2023","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"10.1016\/j.sigpro.2026.110637_bib0009","doi-asserted-by":"crossref","first-page":"5693","DOI":"10.1109\/TSP.2010.2058802","article-title":"Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar","volume":"58","author":"Nion","year":"2010","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110637_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2022.108716","article-title":"Multistatic MIMO radar target localization via coupled canonical polyadic decomposition","volume":"201","author":"Gong","year":"2022","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110637_bib0011","series-title":"Proc. 7th Int Conf. Digital Signal Process.","first-page":"149","article-title":"Target localization based on multi-site sparse arrays: a coupled canonical polyadic decomposition approach","author":"Liu","year":"2023"},{"key":"10.1016\/j.sigpro.2026.110637_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2025.110099","article-title":"Target localization with coprime multistatic MIMO radar via coupled canonical polyadic decomposition based on joint eigenvalue decomposition","volume":"238","author":"Liao","year":"2026","journal-title":"Signal Process."},{"issue":"17","key":"10.1016\/j.sigpro.2026.110637_bib0013","doi-asserted-by":"crossref","DOI":"10.1016\/j.jfranklin.2025.108129","article-title":"Target localization with bistatic MIMO radar based on Vandermonde constrained canonical polyadic decomposition","volume":"362","author":"Liao","year":"2025","journal-title":"J. Frankl. Inst."},{"issue":"14","key":"10.1016\/j.sigpro.2026.110637_bib0014","doi-asserted-by":"crossref","first-page":"3702","DOI":"10.1109\/TSP.2017.2695566","article-title":"Hankel matrix nuclear norm regularized tensor completion for N-dimensional exponential signals","volume":"65","author":"Ying","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"issue":"22","key":"10.1016\/j.sigpro.2026.110637_bib0015","doi-asserted-by":"crossref","first-page":"5956","DOI":"10.1109\/TSP.2018.2872012","article-title":"Direction-of-arrival estimation for coprime array via virtual array interpolation","volume":"66","author":"Zhou","year":"2018","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"10.1016\/j.sigpro.2026.110637_bib0016","doi-asserted-by":"crossref","first-page":"6576","DOI":"10.1109\/TIT.2014.2343623","article-title":"Robust spectral compressed sensing via structured matrix completion","volume":"60","author":"Chen","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.sigpro.2026.110637_bib0017","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.acha.2016.02.003","article-title":"Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction","volume":"41","author":"Cai","year":"2016","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"21","key":"10.1016\/j.sigpro.2026.110637_bib0018","doi-asserted-by":"crossref","first-page":"5761","DOI":"10.1109\/TSP.2014.2358961","article-title":"A new frequency estimation method for equally and unequally spaced data","volume":"62","author":"Andersson","year":"2014","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110637_bib0019","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1137\/070690729","article-title":"Decompositions of a higher-order tensor in block terms\u2014Part II: definitions and uniqueness","volume":"30","author":"De Lathauwer","year":"2008","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110637_bib0020","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1137\/040608830","article-title":"A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization","volume":"28","author":"De Lathauwer","year":"2006","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110637_bib0021","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/140956853","article-title":"Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-(Lr,n, Lr,n, 1) terms\u2014Part I: uniqueness","volume":"36","author":"S\u00f8rensen","year":"2015","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"13","key":"10.1016\/j.sigpro.2026.110637_bib0022","doi-asserted-by":"crossref","first-page":"3475","DOI":"10.1109\/TSP.2018.2830317","article-title":"Double coupled canonical polyadic decomposition for joint blind source separation","volume":"66","author":"Gong","year":"2018","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110637_bib0023","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.image.2018.10.006","article-title":"Double coupled canonical polyadic decomposition of third-order tensors: algebraic algorithm and relaxed uniqueness conditions","volume":"73","author":"Gong","year":"2019","journal-title":"Signal Process. Image Commun."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110637_bib0024","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/140956865","article-title":"Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank- (Lr,n, Lr,n, 1) terms\u2014Part II: algorithms","volume":"36","author":"S\u00f8rensen","year":"2015","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110637_bib0025","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1137\/070690730","article-title":"Decompositions of a higher-order tensor in block terms\u2014Part III: alternating least squares algorithms","volume":"30","author":"De Lathauwer","year":"2008","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110637_bib0026","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/120868323","article-title":"Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(Lr, Lr, 1) terms, and a new generalization","volume":"23","author":"Sorber","year":"2013","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110637_bib0027","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.chemolab.2004.07.003","article-title":"PARAFAC and missing values","volume":"75","author":"Tomasi","year":"2005","journal-title":"Chemometr. Intell. Lab. Syst."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110637_bib0028","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.chemolab.2010.08.004","article-title":"Scalable tensor factorizations for incomplete data","volume":"106","author":"Acar","year":"2011","journal-title":"Chemometr. Intell. Lab. Syst."},{"key":"10.1016\/j.sigpro.2026.110637_bib0029","series-title":"Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP)","first-page":"2915","article-title":"Rank-revealing block-term decomposition for tensor completion","author":"Rontogiannis","year":"2021"},{"issue":"5","key":"10.1016\/j.sigpro.2026.110637_bib0030","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","article-title":"Efficient tensor completion for color image and video recovery: low-rank tensor train","volume":"26","author":"Bengua","year":"2017","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110637_bib0031","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1109\/TNNLS.2022.3181378","article-title":"Noisy tensor completion via low-rank tensor ring","volume":"35","author":"Qiu","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.sigpro.2026.110637_bib0032","unstructured":"3rd Generation Partnership Project (3GPP), Study on channel model for frequencies from 0.5 to 100 GHz, Technical Report (TR), 38.901, Version 16.1.0 (Rel-16), 2019."},{"key":"10.1016\/j.sigpro.2026.110637_bib0033","doi-asserted-by":"crossref","DOI":"10.1016\/j.dsp.2024.104755","article-title":"Block-term tensor decomposition in array signal processing","volume":"156","author":"Kofidis","year":"2025","journal-title":"Digital Signal Process."},{"key":"10.1016\/j.sigpro.2026.110637_bib0034","series-title":"Proc. IEEE\/CIC Int. Conf. Commun. China (ICCC)","first-page":"213","article-title":"Multipath DOA estimation via vandermonde constrained block term decomposition","author":"Luo","year":"2024"},{"issue":"4","key":"10.1016\/j.sigpro.2026.110637_bib0035","doi-asserted-by":"crossref","first-page":"1562","DOI":"10.1109\/TSP.2007.910469","article-title":"Blind deconvolution of DS-CDMA signals by means of decomposition in rank-(1, L, L) terms","volume":"56","author":"De Lathauwer","year":"2008","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110637_bib0036","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1137\/100805510","article-title":"Blind separation of exponential polynomials and the decomposition of a tensor in rank-(Lr, Lr, 1) terms","volume":"32","author":"De Lathauwer","year":"2011","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110637_bib0037","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/JSTSP.2016.2535182","article-title":"Hankel low-rank matrix completion: performance of the nuclear norm relaxation","volume":"10","author":"Usevich","year":"2016","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110637_bib0038","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM J. Optim."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110637_bib0039","doi-asserted-by":"crossref","first-page":"335","DOI":"10.4310\/MAA.2013.v20.n4.a2","article-title":"Fast singular value thresholding without singular value decomposition","volume":"20","author":"Cai","year":"2013","journal-title":"Methods Appl. Anal."},{"key":"10.1016\/j.sigpro.2026.110637_bib0040","series-title":"Matrix Computations - 4th Ed\u2024","author":"Golub","year":"2013"},{"issue":"6","key":"10.1016\/j.sigpro.2026.110637_bib0041","doi-asserted-by":"crossref","first-page":"3242","DOI":"10.1109\/TAP.2014.2310220","article-title":"QuaDRiGa: a 3-D multi-cell channel model with time evolution for enabling virtual field trials","volume":"62","author":"Jaeckel","year":"2014","journal-title":"IEEE Trans. Antennas Propag."},{"key":"10.1016\/j.sigpro.2026.110637_bib0042","series-title":"Technical Report","article-title":"QuaDRiGa - Quasi Deterministic Radio Channel Generator, User Manual and Documentation","author":"Jaeckel","year":"2017"},{"issue":"3","key":"10.1016\/j.sigpro.2026.110637_bib0043","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/JSTSP.2021.3051488","article-title":"Block-term tensor decomposition: model selection and computation","volume":"15","author":"Rontogiannis","year":"2021","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110637_bib0044","first-page":"5472","article-title":"Coarray tensor completion for DOA estimation","volume":"59","author":"Zheng","year":"2023","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"issue":"11","key":"10.1016\/j.sigpro.2026.110637_bib0045","doi-asserted-by":"crossref","first-page":"17381","DOI":"10.1109\/TVT.2025.3576803","article-title":"Efficient DOA estimation method for extended-aperture moving coprime arrays based on ANM-ADMM","volume":"74","author":"Wang","year":"2025","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110637_bib0046","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1109\/TASSP.1985.1164649","article-title":"On spatial smoothing for direction-of-arrival estimation of coherent signals","volume":"33","author":"Shan","year":"1985","journal-title":"IEEE Trans. Acoust., Speech Signal Process."},{"key":"10.1016\/j.sigpro.2026.110637_bib0047","doi-asserted-by":"crossref","DOI":"10.1155\/2022\/1961988","article-title":"The DOA estimation for a mixture of uncorrelated and coherent sources via decomposing the coprime array","volume":"2022","author":"Jiang","year":"2022","journal-title":"Wirel. Commun. Mob. Comput."},{"issue":"7","key":"10.1016\/j.sigpro.2026.110637_bib0048","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1109\/29.32276","article-title":"ESPRIT-estimation of signal parameters via rotational invariance techniques","volume":"37","author":"Roy","year":"1989","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110637_bib0049","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/29.17564","article-title":"MUSIC, maximum likelihood, and Cramer-Rao bound","volume":"37","author":"Stoica","year":"1989","journal-title":"IEEE Trans. Acoust. Speech, Signal Process."},{"key":"10.1016\/j.sigpro.2026.110637_bib0050","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/LSP.2020.2982769","article-title":"Direction-of-arrival estimation of coherent signals via coprime array interpolation","volume":"27","author":"Zheng","year":"2020","journal-title":"IEEE Signal Process. Lett."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426001519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426001519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T13:31:56Z","timestamp":1777123916000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168426001519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":50,"alternative-id":["S0165168426001519"],"URL":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110637","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Block term decomposition based tensor completion of multidimensional harmonic signals with applications","name":"articletitle","label":"Article Title"},{"value":"Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110637","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"110637"}}