Tensor-based techniques for the blind separation of DS-CDMA signals
Signal Processing
Blind PARAFAC signal detection for polarization sensitive array
EURASIP Journal on Applied Signal Processing
4D near-field source localization using cumulant
EURASIP Journal on Applied Signal Processing
Tensor-product approximation to operators and functions in high dimensions
Journal of Complexity
Computational Intelligence and Neuroscience - EEG/MEG Signal Processing
Blind Joint Symbol Detection and DOA Estimation for OFDM System with Antenna Array
Wireless Personal Communications: An International Journal
Two-dimensional subspace classifiers for face recognition
Neurocomputing
Linear algebra for tensor problems
Computing
Blind multiuser detection for MC-CDMA with antenna array
Computers and Electrical Engineering
Sequential unfolding SVD for tensors with applications in array signal processing
IEEE Transactions on Signal Processing
Imposing independence constraints in the CP model
ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation
The Journal of Machine Learning Research
Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar
IEEE Transactions on Signal Processing
Approximation of $2^d\times2^d$ Matrices Using Tensor Decomposition
SIAM Journal on Matrix Analysis and Applications
Second-Order blind identification of underdetermined mixtures
ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Robust model order reduction technique for MIMO systems via ANN-LMI-based state residualization
International Journal of Circuit Theory and Applications
| Hi-index | 0.01 |
The canonical decomposition of higher-order tensors is a key tool in multilinear algebra. First we review the state of the art. Then we show that, under certain conditions, the problem can be rephrased as the simultaneous diagonalization, by equivalence or congruence, of a set of matrices. Necessary and sufficient conditions for the uniqueness of these simultaneous matrix decompositions are derived. In a next step, the problem can be translated into a simultaneous generalized Schur decomposition, with orthogonal unknowns [A.-J. van der Veen and A. Paulraj, IEEE Trans. Signal Process., 44 (1996), pp. 1136--1155]. A first-order perturbation analysis of the simultaneous generalized Schur decomposition is carried out. We discuss some computational techniques (including a new Jacobi algorithm) and illustrate their behavior by means of a number of numerical experiments.