Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Zhang, L.; Liu, W.; Langley, R.J. (2010)
Publisher: Elsevier
Languages: English
Types: Article
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.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [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.
    • [12] L. Wang, Y. Cai, and R. C. de Lamare, “Low-complexity adaptive step size constrained constant modulus SG-based algorithms for blind adaptive beamforming,” in IEEE Proceedings ICASSP, Las Vegas, NV, April 2008.
    • [13] Y. Cai and R. C. de Lamare, “Low-complexity variable step-size mechanism for code-constrained constant modulus stochastic gradient algorithms applied to CDMA interference suppression,” IEEE Transactions on Signal Processing, vol. 57, pp. 313- 323, 2009.
    • [14] J. Miguez and L. Castedo, “Linearly constrained constant modulus approach to blind adaptive multiuser interference suppression,” Communications Letters, vol. 2, pp. 217-219, 1998.
    • [15] K. C. Huarng and C. C. Yeh, “Adaptive beamforming with conjugate symmetric weights,” IEEE Transactions on Antennas and Propagation, vol. 39, no. 7, pp. 926- 932, 1991.
    • [16] J. Li and P. Stoica, Robust adaptive beamforming. & Sons, Inc., 2005.
    • [17] A. Leshem and A. J. van der Veen, “Blind source separation: The location of local minima in the case of finitely many samples,” IEEE Trans. Signal Processing, vol. 56, pp. 4340-4353, 2008.
    • [18] M. Honig, U. Madhow, and S. Verdu, “Blind adaptive multiuser detection,” IEEE Transactions on Information Theory, vol. 41, pp. 944-960, 1995.
    • [19] A. H. Sayed, Adaptive Filters. New Jersey, U.S.A.: John Wiley & Sons, Inc., 2008.
    • [20] J. B. Whitehead and F. Takawira, “Performance analysis of the linearly constrained constant-modulus algorithm-based multiuser detector,” IEEE Transactions on Signal Processing, vol. 53, pp. 643-653, 2005.
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

Share - Bookmark

Cite this article