TY - JOUR
T1 - Adaptive reduced-rank constrained constant modulus algorithms based on joint iterative optimization of filters for beamforming
AU - Wang, Lei
AU - De Lamare, Rodrigo C.
AU - Yukawa, Masahiro
PY - 2010/6
Y1 - 2010/6
N2 - 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 GramSchmidt (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.
AB - 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 GramSchmidt (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.
KW - Antenna array
KW - Beamforming
KW - Constrained constant modulus
KW - Reduced-rank
UR - http://www.scopus.com/inward/record.url?scp=77952558378&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952558378&partnerID=8YFLogxK
U2 - 10.1109/TSP.2010.2044250
DO - 10.1109/TSP.2010.2044250
M3 - Article
AN - SCOPUS:77952558378
SN - 1053-587X
VL - 58
SP - 2983
EP - 2997
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 6
M1 - 5419962
ER -