Accurate and Computationally Efficient Tensor-Based Subspace Approach for Multidimensional Harmonic Retrieval
From MaRDI portal
Recommendations
- Tensor Approach for Eigenvector-Based Multi-Dimensional Harmonic Retrieval
- Higher-Order SVD-Based Subspace Estimation to Improve the Parameter Estimation Accuracy in Multidimensional Harmonic Retrieval Problems
- Mode-${\cal R}$ Subspace Projection of a Tensor for Multidimensional Harmonic Parameter Estimations
- Hankel tensor-based model and \(L_1\)-Tucker decomposition-based frequency recovery method for harmonic retrieval problem
- Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
- Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition—Part I: Model and Identifiability
- Harmonic decomposition of tensors - a spectral method
- Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition—Part II: Algorithm and Multirate Sampling
- Robust Harmonic Retrieval via Block Successive Upper-Bound Minimization
- Cumulant-based approach to the harmonic retrieval
Cited in
(2)
This page was built for publication: Accurate and Computationally Efficient Tensor-Based Subspace Approach for Multidimensional Harmonic Retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574034)