A Low-Complexity GA-WSF Algorithm for Narrow-Band DOA Estimation

Abstract EN

This paper proposes a low-complexity estimation algorithm for weighted subspace fitting (WSF) based on the Genetic Algorithm (GA) in the problem of narrow-band direction-of-arrival (DOA) finding.

Among various solving techniques for DOA, WSF is one of the highest estimation accuracy algorithms.

However, its criteria is a multimodal nonlinear multivariate optimization problem.

As a result, the computational complexity of WSF is very high, which prevents its application to real systems.

The Genetic Algorithm (GA) is considered as an effective algorithm for finding the global solution of WSF.

However, conventional GA usually needs a big population size to cover the whole searching space and a large number of generations for convergence, which means that the computational complexity is still high.

To reduce the computational complexity of WSF, this paper proposes an improved Genetic algorithm.

Firstly a hypothesis technique is used for a rough DOA estimation for WSF.

Then, a dynamic initialization space is formed around this value with an empirical function.

Within this space, a smaller population size and smaller amount of generations are required.

Consequently, the computational complexity is reduced.

Simulation results show the efficiency of the proposed algorithm in comparison to many existing algorithms.