A low-complexity variable forgetting factor constant modulus RLS algorithm for blind adaptive beamforming
In this paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operate...
Uloženo v:
| Vydáno v: | Signal processing Ročník 105; s. 277 - 282 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
01.12.2014
Elsevier |
| Témata: | |
| ISSN: | 0165-1684, 1872-7557 |
| 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!
|
| Shrnutí: | In this paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operates in the generalized sidelobe canceler (GSC) structure. A detailed study of its operating properties is carried out, including a convexity analysis and a mean squared error (MSE) analysis of its steady-state behavior. The results of numerical experiments demonstrate that the proposed VFF mechanism achieves a superior learning and tracking performance compared to other VFF mechanisms.
•A low-complexity variable forgetting factor mechanism is proposed for adaptive CCM beamforming.•The convexity analysis and the steady-state mean-square error analysis are carried out.•The numerical results demonstrate that the proposed algorithm achieves a superior performance. |
|---|---|
| ISSN: | 0165-1684 1872-7557 |
| DOI: | 10.1016/j.sigpro.2014.06.003 |