Autori: T. Abrudan, J. Eriksson, V. Koivunen

Editorial: Elsevier, Signal Processing (Elsevier), 89, p.1704-1714, 2009.

Rezumat:

In this paper we introduce a Riemannian algorithm for minimizing (or maximizing) a real-valued function {mathcal J} of complex-valued matrix argument {mathbf W} under the constraint that {mathbf W} is an n×n unitary matrix. This type of constrained optimization problem arises in many array and multi-channel signal processing applications.

We propose a conjugate gradient (CG) algorithm on the Lie group of unitary matrices $U(n)$. The algorithm fully exploits the group properties in order to reduce the computational cost. Two novel geodesic search methods exploiting the almost periodic nature of the cost function along geodesics on $U(n)$ are introduced. We demonstrate the performance of the proposed CG algorithm in a blind signal separation application. Computer simulations show that the proposed algorithm outperforms other existing algorithms in terms of convergence speed and computational complexity.

Cuvinte cheie: - // Optimization, Unitary matrix constraint, Array processing, Subspace estimation, Source separation

URL: http://www.sciencedirect.com/science/article/pii/S0165168409000814