By Topic

Adaptive linearly constrained inverse QRD-RLS beamformer for multiple jammers suppression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chung-Yao Chang ; Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; Shiunn-Jang Chern

A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the “fast” RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm

Published in:

Wireless Communications, 2001. (SPAWC '01). 2001 IEEE Third Workshop on Signal Processing Advances in

Date of Conference: