NSIP'99 International Conference

ICA Algorithm Based On subspace approach.

Ali MANSOUR 1, Member of IEEE  and N. Ohnishi 1,2 Member of IEEE.
1 Bio-Mimetic Control Research Center (RIKEN),
 2271-130, Anagahora, Shimoshidami, Moriyama-ku,
 Nagoya 463 (JAPAN)

2 Department of Information Engineering,
 Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-01, Japan

abstract
Generally, the blind separation algorithms based on the subspace approach are very slow.
 In addition, they need a considerable computation effort and  time due to the estimation and the minimization of
  huge matrices.

Previously, we proposed an adaptive subspace criterion to
solve the blind separation problem in{mansour-dsp-98}. The criterion has been minimized
adaptively using a conjugate gradient
algorithm in{fu-ieee-95}. Unfortunately, the convergence of that algorithm needed
more than one hour of computational time using an ultra sparc 30
and "C" code program.

In this paper,  we improve that criterion by proposing a new
subspace adaptive algorithm. The new algorithm deals with
stationary signals. The experimental results show that the convergence
of the new algorithm is relatively fast due to the estimation by
bloc of the different matrices and the minimization of the cost
function using a generalized conjugate gradient method.