VNU-UET Repository

Fast adaptive PARAFAC decomposition algorithm with linear complexity

Viet Dung Nguyen and Karim Abed-Meraim and Linh Trung Nguyen (2016) Fast adaptive PARAFAC decomposition algorithm with linear complexity. In: 41th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 20-25 March, Shanghai, China.

[img] PDF - Published Version
Restricted to Registered users only


Official URL:


We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension growing with time. It has linear complexity, good convergence rate and good estimation accuracy. To deal with large-scale problems, a parallel implementation can be applied to reduce both computational complexity and storage. We illustrate the effectiveness of our algorithm in comparison with the state-of-the-art algorithms through simulation experiments.

Item Type:Conference or Workshop Item (Poster)
Subjects:Electronics and Communications
Divisions:Faculty of Electronics and Telecommunications (FET)
ID Code:2192
Deposited By: A/Prof. Linh Trung Nguyen
Deposited On:25 Dec 2016 16:57
Last Modified:25 Dec 2016 16:57

Repository Staff Only: item control page