Almost-sure identifiability of multidimensional harmonic retrieval

DOI10.1109/78.942615zbMath1369.94423OpenAlexW2120186527MaRDI QIDQ5353539

Nicholas D. Sidiropoulos, Tao Jiang, Jos M. F. ten Berge

Publication date: 8 September 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.942615

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Sampling theory in information and communication theory (94A20)

Related Items (15)

Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL ⋮ New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors ⋮ AOD estimation in WSN localization system with synthetic aperture technique ⋮ Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method ⋮ High-order tensor estimation via trains of coupled third-order CP and Tucker decompositions ⋮ On the positivity set of a linear recurrence sequence ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ A multivariate generalization of Prony's method ⋮ Composition-aware spectroscopic tomography ⋮ MultiDimensional Sparse Super-Resolution ⋮ Prony's method under an almost sharp multivariate Ingham inequality ⋮ Super-Resolution of Positive Sources: The Discrete Setup ⋮ Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition ⋮ Spectrum blind reconstruction and direction of arrival estimation of multi-band signals at sub-Nyquist sampling rates ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness

This page was built for publication: Almost-sure identifiability of multidimensional harmonic retrieval