2010
DOI: 10.1109/tap.2010.2078458
|View full text |Cite
|
Sign up to set email alerts
|

Approximate Kernel Orthogonalization for Antenna Array Processing

Abstract: Abstract-We present a method for kernel antenna array processing using Gaussian kernels as basis functions. The method firs identifie the data clusters by using a modifie sparse greedy matrix approximation. Then, the algorithm performs model reduction in order to try to reduce the fina size of the beamformer. The method is tested with simulations that include two arrays made of two and seven printed half wavelength thick dipoles, in scenarios with 4 and 5 users coming from different angles of arrival. The ante… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 35 publications
(39 reference statements)
0
4
0
Order By: Relevance
“…The optimal directive gain of adaptive array is determined by the optimality of the weights applied to the individual elements excitation signals. Least Mean Square (LMS) algorithm is one of the most popular algorithms to determine these optimal weights [10][11][12][13]. The LMS algorithm is a gradient-based approach, and it incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vector which eventually leads to the minimum mean square error at the current time [10][11][12][13].…”
Section: Weight Estimation For Beam Steering Using Lms Algorithm and mentioning
confidence: 99%
See 1 more Smart Citation
“…The optimal directive gain of adaptive array is determined by the optimality of the weights applied to the individual elements excitation signals. Least Mean Square (LMS) algorithm is one of the most popular algorithms to determine these optimal weights [10][11][12][13]. The LMS algorithm is a gradient-based approach, and it incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vector which eventually leads to the minimum mean square error at the current time [10][11][12][13].…”
Section: Weight Estimation For Beam Steering Using Lms Algorithm and mentioning
confidence: 99%
“…At the (n + 1)th iteration, the array operates with weights w(n) computed at the previous iteration; however, the array signal vector is x(n + 1); the reference signal sample is r(n + 1); and the array output is as given in Equation (10).…”
Section: Weight Estimation For Beam Steering Using Lms Algorithm and mentioning
confidence: 99%
“…Least Mean Square (LMS) algorithm is one of the most popular algorithms to determine these optimal weights. The LMS algorithm is a gradient-based approach and it incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vector which eventually leads to the minimum mean square error at the current time [11].…”
Section: Weight Estimation Using Lms Algorithmmentioning
confidence: 99%
“…The applications of such arrays span a wide spectrum, including commercial wireless systems such as long-term evolution (LTE) and IEEE 802. 16, radar for beam scanning, mobile system, satellite system, and multiple-input multiple-output (MIMO) systems [8][10]. The benefits of adopting adaptive antenna array beamforming encompass enhancements in mean square error (MSE), signal to interference plus noise ratio (SINR), interference mitigation, counteraction of multipath fading, and directive gain [11][13].…”
mentioning
confidence: 99%