کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
562865 875453 2010 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A class of constant modulus algorithms for uniform linear arrays with a conjugate symmetric constraint
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر پردازش سیگنال
پیش نمایش صفحه اول مقاله
A class of constant modulus algorithms for uniform linear arrays with a conjugate symmetric constraint
چکیده انگلیسی

A class of constant modulus algorithms (CMAs) subject to a conjugate symmetric constraint is proposed for blind beamforming based on the uniform linear array structure. The constraint is derived from the beamformer with an optimum output signal-to-interference-plus-noise ratio (SINR). The effect of the additional constraint is equivalent to adding a second step to the original adaptive algorithms. The proposed approach is general and can be applied to both the traditional CMA and its all kinds of variants, such as the linearly constrained CMA (LCCMA) and the least squares CMA (LSCMA) as two examples. With this constraint, the modified CMAs will always generate a weight vector in the desired form for each update and the number of adaptive variables is effectively reduced by half, leading to a much improved overall performance.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Signal Processing - Volume 90, Issue 9, September 2010, Pages 2760–2765
نویسندگان
, , ,