Adaptive reduced-rank constrained constant modulus algorithms based on joint iterative optimization of filters for beamforming

Authors:
Lei Wang;Rodrigo C. de Lamare;Masahiro Yukawa
Affiliations:
Department of Electronics, University of York, York, UK;Department of Electronics, University of York, York, UK;Laboratory for Mathematical Neuroscience, BSI, Riken, Saitama, Japan
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 20
Cited 2

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
A network for recursive extraction of canonical coordinates

Neural Networks - 2003 Special issue: Advances in neural networks research — IJCNN'03
Adaptive MC-CDMA receiver with constrained constant modulus IQRD-RLS algorithm for MAI suppression

Signal Processing - Special section: Security of data hiding technologies
Low-complexity adaptive step size constrained constant modulus SG algorithms for adaptive beamforming

Signal Processing
Adaptive reduced-rank LCMV beamforming algorithms based on joint iterative optimization of filters: Design and analysis

Signal Processing
Adaptive reduced-rank processing based on joint and iterative interpolation, decimation, and filtering

IEEE Transactions on Signal Processing
Blind adaptive MIMO receivers for space-time block-coded DS-CDMA systems in multipath channels using the constant modulus criterion

IEEE Transactions on Communications
A fast least-squares algorithm for linearly constrained adaptivefiltering

IEEE Transactions on Signal Processing
Experimental performance of adaptive beamforming in a sonarenvironment with a towed array and moving interfering sources

IEEE Transactions on Signal Processing
Subspace Expansion and the Equivalence of Conjugate Direction and Multistage Wiener Filters

IEEE Transactions on Signal Processing - Part II
Reduced-rank adaptive filtering

IEEE Transactions on Signal Processing
Two-channel constrained least squares problems: solutions using power methods and connections with canonical coordinates

IEEE Transactions on Signal Processing
On the Relationship Between Robust Minimum Variance Beamformers With Probabilistic and Worst-Case Distortionless Response Constraints

IEEE Transactions on Signal Processing
Recursive least squares constant modulus algorithm for blind adaptive array

IEEE Transactions on Signal Processing
An iterative algorithm for the computation of the MVDR filter

IEEE Transactions on Signal Processing
Blind Adaptive Constrained Reduced-Rank Parameter Estimation Based on Constant Modulus Design for CDMA Interference Suppression

IEEE Transactions on Signal Processing
Low-complexity variable step-size mechanisms for stochastic gradient algorithms in minimum variance CDMA receivers

IEEE Transactions on Signal Processing - Part I
Blind multiuser detection: a subspace approach

IEEE Transactions on Information Theory
A multistage representation of the Wiener filter based on orthogonal projections

IEEE Transactions on Information Theory
On the equivalence of three reduced rank linear estimators with applications to DS-CDMA

IEEE Transactions on Information Theory

A fast adaptive reduced rank transformation for minimum variance beamforming

Signal Processing
Review: A unified framework for regularized linear estimation in communication systems

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

This paper proposes a robust reduced-rank scheme for adaptive beamforming based on joint iterative optimization (JIO) of adaptive filters. The novel scheme is designed according to the constant modulus (CM) criterion subject to different constraints. The proposed scheme consists of a bank of full-rank adaptive filters that forms the transformation matrix,and an adaptive reduced-rank filter that operates at the output of the bank of filters to estimate the desired signal. We describe the proposed scheme for both the direct-form processor (DFP) and the generalized sidelobe canceller (GSC) structures. for each structure, we derive stochastic gradient (SG) and recursive least squares (RLS) algorithms for its adaptive implementation.The Gram-Schmidt (GS) technique is applied to the adaptive algorithms for reformulating the transformation matrix and improving the performance. An automatic rank selection technique is developed and employed to determine the most adequate rank for the derived algorithms. A detailed complexity study and a convexity analysis are carried out. Simulation results show that the proposed algorithms outperform the existing full-rank and reduced-rank methods in convergence and tracking performance.