A class of constant modulus algorithms for uniform linear arrays with a conjugate symmetric constraint

Article English OPEN
Zhang, L. ; Liu, W. ; Langley, R.J. (2010)
  • Publisher: Elsevier

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. (C) 2010 Elsevier B.V. All rights reserved.
  • References (19)
    19 references, page 1 of 2

    [1] R. Gooch and J. Lundell, “CM array: an adaptive beamformer for constant modulus signals,” in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing, New York, NY, 1986, pp. 2523-2526.

    [2] H. Krim and M. Viberg, “Two decades of array signal processing research: the parametric approach,” IEEE Signal Processing Magazine, vol. 13, no. 4, pp. 67-94, July 1996.

    [4] C. R. Johnson, P. Schniter, T. J. Endres, J. D. Behm, D. R. Brown, and R. A. Casas, “Blind equalization using the constant modulus criterion: A review,” Proceedings of the IEEE, vol. 86, no. 10, pp. 1927-1950, October 1998.

    [5] S. Chen, A. Wolfgang, and L. Hanzo, “Constant modulus algorithm aided soft decision directed scheme for blind space-time equalisation of simo channels,” Signal Processing, vol. 87, pp. 2587-2599, 2007.

    [6] B. G. Agee, “Least-squares CMA: A new technique for rapid correction of constant modulus signals,” in ICASSP, 1986.

    [7] T. E. Biedka, W. H. Tranter, and J. H. Reed, “Convergence Analysis of the Least Squares Constant Modulus Algorithm in Interference Cancellation Applications,” IEEE Transactions on Communications, vol. 48, no. 3, pp. 491-501, March 2000.

    [8] Y. Chen, T. Le-Ngoc, B. Champagne, and X. Changjiang, “Recursive least squares constant modulus algorithm for blind adaptive array,” IEEE Transactions on Signal Processing, vol. 52, pp. 1452 - 1456, 2004.

    [9] R. C. de Lamare and R. Sampaio-Neto, “Blind adaptive code-constrained constant modulus algorithms for CDMA interference suppression in multipath channels,” IEEE Communications Letters, vol. 9, pp. 334 - 336, 2005.

    [10] R. C. de Lamare, M. Haardt, and R. Sampaio-Neto, “Blind adaptive constrained reduced-rank parameter estimation based on constant modulus design for CDMA interference suppression,” IEEE Transactions on Signal Processing, vol. 52, pp. 2470 - 2482, 2008.

    [11] R. C. de Lamare and R. Sampaio-Neto, “Low-complexity variable step-size mechanisms for stochastic gradient algorithms in minimum variance CDMA receivers,” IEEE Transactions on Signal Processing, vol. 54, pp. 2302-2317, 2006.

  • Metrics
    views in OpenAIRE
    views in local repository
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    White Rose Research Online - IRUS-UK 0 18
Share - Bookmark