Tensor polyadic decomposition for antenna array processing

Souleymen Sahnoun 1 Pierre Comon 1, *
* Auteur correspondant
1 GIPSA-CICS - CICS
GIPSA-DIS - Département Images et Signal
Abstract : In the present framework, a tensor is understood as a multi-way array of complex numbers indexed by three (or more) indices. The decomposition of such tensors into a sum of decomposable (i.e. rank-1) terms is called ''Polyadic Decomposition'' (PD), and qualified as ''canonical'' (CPD) if it is unique up to trivial indeterminacies. The idea is to use the CPD to identify the location of radiating sources in the far-field from several sensor subarrays, deduced from each other by a translation in space. The main difficulty of this problem is that noise is present, so that the measurement tensor must be fitted by a low-rank approximate, and that the infimum of the distance between the two is not always reached. Our contribution is three-fold. We first propose to minimize the latter distance under a constraint ensuring the existence of the minimum. Next, we compute the Cram{é}r-Rao bounds related to the localization problem, in which nuisance parameters are involved (namely the translations between subarrays). Then we demonstrate that the CPD-based localization algorithm performs better than ESPRIT when more than 2 subarrays are used, performances being the same for 2 subarrays. Some inaccuracies found in the literature are also pointed out.
Type de document :
Communication dans un congrès
The International Statistical Institute - International Association for Statistical Computing. 21st International Conference on Computational Statistics (CompStat'2014), Aug 2014, Genève, Switzerland. 2014
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00986973
Contributeur : Pierre Comon <>
Soumis le : lundi 5 mai 2014 - 15:27:58
Dernière modification le : lundi 9 avril 2018 - 12:22:48
Document(s) archivé(s) le : mardi 5 août 2014 - 11:45:47

Fichier

articleConf9.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00986973, version 1

Collections

Citation

Souleymen Sahnoun, Pierre Comon. Tensor polyadic decomposition for antenna array processing. The International Statistical Institute - International Association for Statistical Computing. 21st International Conference on Computational Statistics (CompStat'2014), Aug 2014, Genève, Switzerland. 2014. 〈hal-00986973〉

Partager

Métriques

Consultations de la notice

668

Téléchargements de fichiers

283