Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Non-iterative solution for PARAFAC with a Toeplitz matrix factor

Alain Kibangou 1, 2 Gérard Favier 3 
Abstract : Recently, tensor signal processing has received an increased attention, particularly in the context of wireless communication applications. The so-called PARAllel FACtor (PARAFAC) decomposition is certainly the most used tensor tool. In general, the parameter estimation of a PARAFAC decomposition is carried out by means of the iterative ALS algorithm, which exhibits the following main drawbacks: convergence towards local minima, a high number of iterations for convergence, and difficulty to take, optimally, special matrix structures into account. In this paper, we propose a non-iterative parameter estimation method for a PARAFAC decomposition when one matrix factor has a Toeplitz structure, a situation that is commonly encountered in signal processing applications. We illustrate the proposed method by means of simulation results.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Alain Kibangou Connect in order to contact the contributor
Submitted on : Tuesday, June 23, 2009 - 12:20:28 PM
Last modification on : Saturday, June 25, 2022 - 11:01:34 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 6:24:58 PM


Files produced by the author(s)


  • HAL Id : hal-00397808, version 1


Alain Kibangou, Gérard Favier. Non-iterative solution for PARAFAC with a Toeplitz matrix factor. EUSIPCO 2009 - 17th European Signal Processing Conference, Aug 2009, Glasgow, United Kingdom. pp.691-695. ⟨hal-00397808⟩



Record views


Files downloads