Tensor polyadic decomposition for antenna array processing - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Tensor polyadic decomposition for antenna array processing


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.
Fichier principal
Vignette du fichier
articleConf9.pdf (130.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00986973 , version 1 (05-05-2014)


  • HAL Id : hal-00986973 , version 1


Souleymen Sahnoun, Pierre Comon. Tensor polyadic decomposition for antenna array processing. 21st International Conference on Computational Statistics (CompStat'2014), Aug 2014, Genève, Switzerland. ⟨hal-00986973⟩
525 View
284 Download


Gmail Facebook Twitter LinkedIn More