2019 International Conference on Range Technology (ICORT) 2019
DOI: 10.1109/icort46471.2019.9069636
|View full text |Cite
|
Sign up to set email alerts
|

A comparison between different adaptive beamforming techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 16 publications
(12 citation statements)
references
References 5 publications
0
12
0
Order By: Relevance
“…The constrained NLMS (CNLMS) method is widely used in sparse array beamforming and has a higher convergence rate than other ABF algorithms [13], [14]. The convergence hindrance can also be overcome through the sample matrix inversion (SMI) method, which, although better in convergence rate than the LMS one [15], it may be prone to misleading outcomes due to potential singularities and the fact that the correlation matrix may be ill-conditioned [11]. Moreover, several ABF algorithms have been examined in [15], where it is shown that the recursive least square (RLS) method can converge faster (at the expense of additional complexity) than the LMS scheme.…”
Section: Algorithms Applied To Smart Antennasmentioning
confidence: 99%
See 1 more Smart Citation
“…The constrained NLMS (CNLMS) method is widely used in sparse array beamforming and has a higher convergence rate than other ABF algorithms [13], [14]. The convergence hindrance can also be overcome through the sample matrix inversion (SMI) method, which, although better in convergence rate than the LMS one [15], it may be prone to misleading outcomes due to potential singularities and the fact that the correlation matrix may be ill-conditioned [11]. Moreover, several ABF algorithms have been examined in [15], where it is shown that the recursive least square (RLS) method can converge faster (at the expense of additional complexity) than the LMS scheme.…”
Section: Algorithms Applied To Smart Antennasmentioning
confidence: 99%
“…The convergence hindrance can also be overcome through the sample matrix inversion (SMI) method, which, although better in convergence rate than the LMS one [15], it may be prone to misleading outcomes due to potential singularities and the fact that the correlation matrix may be ill-conditioned [11]. Moreover, several ABF algorithms have been examined in [15], where it is shown that the recursive least square (RLS) method can converge faster (at the expense of additional complexity) than the LMS scheme. In comparison to the LMS and RLS methods, the SMI method has higher computational cost due to the correlation matrix inversion involved in the SMI process, especially in cases of large numbers of antenna array elements.…”
Section: Algorithms Applied To Smart Antennasmentioning
confidence: 99%
“…SMI algorithm can suppress an unknown interference based on an MMSE manner [15]. Compared to other interference suppression algorithms such as LMS and RLS, SMI has higher computational complexity due to the matrix inversion operation but has excellent interference suppression performance [26]. The weight of MMSE is obtained by solving the following optimization problem.…”
Section: Sample Matrix Inversion (Smi)mentioning
confidence: 99%
“…From (26), the proposed weight can be designed with relatively small computational complexity operations less than the conventional NSE. Summation of the correlation matrices…”
Section: Proposed Schemementioning
confidence: 99%
See 1 more Smart Citation