Low-complexity variable forgetting factor constant modulus RLS-based algorithm for blind adaptive beamforming

In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism to enhance the performance of recursive least squares (RLS) algorithms for adaptive blind beamforming. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the propose...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Conference record - Asilomar Conference on Signals, Systems, & Computers s. 171 - 175
Hlavní autoři:	Boya Qin, Yunlong Cai, Champagne, Benoit, Minjian Zhao, Yousefi, Siamak
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.11.2013
Témata:	Adaptive blind beamforming Algorithm design and analysis Array signal processing Arrays constrained constant modulus Convergence Signal processing algorithms Steady-state variable forgetting factor Vectors
ISSN:	1058-6393
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism to enhance the performance of recursive least squares (RLS) algorithms for adaptive blind beamforming. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed algorithm operates in the generalized sidelobe canceler (GSC) structure for implementation. The proposed variable forgetting factor mechanism employs a new component updated by the time average of the constant modulus (CM) cost function, to adjust the forgetting factor. A complexity comparison is provided to show its advantages over existing methods. The study of the steady-state analysis is carried out. Simulation results which are presented for a nonstationary scenario illustrate that the proposed variable forgetting factor mechanism achieves a superior performance compared to existing algorithms.
ISSN:	1058-6393
DOI:	10.1109/ACSSC.2013.6810253