Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition—Part II: Algorithm and Multirate Sampling
نویسندگان
چکیده
منابع مشابه
Almost sure identifiability of multidimensional harmonic retrieval
Two-dimensional (2-D) and, more generally, multidimensional harmonic retrieval is of interest in a variety of applications, including transmitter localization and joint time and frequency offset estimation in wireless communications. The associated identifiability problem is key in understanding the fundamental limitations of parametric methods in terms of the number of harmonics that can be re...
متن کاملFast Algorithms for Multidimensional Harmonic Retrieval
Classic multidimensional harmonic retrieval is the estimation problem in a variety of practical applications, including sensor array processing, radar, mobile communications, multiple-input multiple-output (MIMO) channel estimation and nuclear magnetic resonance spectroscopy. Numerous parametric subspace approaches have been proposed recently to solve this problem, among which the so-called ESP...
متن کاملA multidimensional irregular sampling algorithm and applications
For a given spiral, a bandwidth B can be chosen and a sequence S can be constructed on the spiral with the property that all nite energy signals having bandwidth B can be reconstructed from sampled values on S. The bandwidth can be expanded as desired, and reconstruction is attained by constructing sampling sets on interleaving spirals. This solves a problem in MRI; and the algorithm can be mod...
متن کاملCanonical Polyadic Decomposition with Orthogonality Constraints
Canonical Polyadic Decomposition (CPD) of a higher-order tensor is an important tool in mathematical engineering. In many applications at least one of the matrix factors is constrained to be column-wise orthonormal. We first derive a relaxed condition that guarantees uniqueness of the CPD under this constraint and generalize the result to the case where one of the factor matrices has full colum...
متن کاملTensor subspace Tracking via Kronecker structured projections (TeTraKron) for time-varying multidimensional harmonic retrieval
We present a framework for Tensor-based subspace Tracking via Kronecker-structured projections (TeTraKron). TeTraKron allows to extend arbitrary matrix-based subspace tracking schemes to track the tensor-based subspace estimate. The latter can be computed via a structured projection applied to the matrix-based subspace estimate which enforces the multi-dimensional structure in a computationally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2017
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2614797