Abstract
A fast preprocessing Least Square-Constant Modulus Algorithm (LS-CMA) is proposed for blind adaptive beamforming. This new preprocessing method precludes noise capture caused by the original LS-CMA with the preprocessing procedure controlled by the static Constant Modulus Algorithm (CMA). The simulation results have shown that the proposed fast preprocessing LS-CMA can effectively reject the co-channel interference, and quickly lock onto the constant modulus desired signal with only one snapshot in a highly corruptive environment.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Litva, et al., Digital Beamforming in Wireless Communications, Boston, London, 1996.
J. R. Treichler, et al., A new approach to multipath correction of constant modulus signals, IEEE Trans. on ASSP, ASSP-31(1983)4, 459–472.
B. G. Agee, The Least Squares CMA: A new technique for rapid correction of constant modulus signals, Proc of ICASSP’86, 1986, 953–956.
J. Sheinvald, On blind beamforming for multiple non-Gaussian signals and the constant-modulus algorithm, IEEE Trans. on SP, SP-46(1998)7, 1878–1885.
Author information
Authors and Affiliations
About this article
Cite this article
Guo, Y., Fang, D., Wang, T.N.C. et al. A preprocessing LS-CMA in highly corruptive environment. J. of Electron.(China) 19, 248–254 (2002). https://doi.org/10.1007/s11767-002-0045-8
Issue Date:
DOI: https://doi.org/10.1007/s11767-002-0045-8