Call for Paper - August 2020 Edition
IJCA solicits original research papers for the August 2020 Edition. Last date of manuscript submission is July 20, 2020. Read More

Blind Adaptive Equalization of Complex Signals based on the Constant Modulus Algorithm

Print
PDF
International Journal of Computer Applications
© 2010 by IJCA Journal
Number 5 - Article 3
Year of Publication: 2010
Authors:
D.R. Srinivas
K.E. Sreenivasa Murthy
10.5120/1580-2113

D R Srinivas and Sreenivasa K E Murthy. Article:Blind Adaptive Equalization of Complex Signals based on the Constant Modulus Algorithm. International Journal of Computer Applications 11(5):10–13, December 2010. Published By Foundation of Computer Science. BibTeX

@article{key:article,
	author = {D.R. Srinivas and K.E. Sreenivasa Murthy},
	title = {Article:Blind Adaptive Equalization of Complex Signals based on the Constant Modulus Algorithm},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {11},
	number = {5},
	pages = {10--13},
	month = {December},
	note = {Published By Foundation of Computer Science}
}

Abstract

The paper discuss, applicability of the second-order Newton gradient descent method for blind equalization of complex signals based on the Constant Modulus Algorithm (CMA). The Constant Modulus (CM) loss function is real with complex valued arguments, and, hence, non-analytic. The Hessian for noiseless FIR channels and rederive the known fact that the full Hessian of the CM loss function is always singular in a simpler manner. The channel model shows that the perfectly equalizing solutions are stationary points of the CM loss function and also evaluate the bit error rate. The paper also discuss of the full Newton method. Finally, to validate the proposed algorithm, simulation studies have been carried out and results are presented and compared. The simulation results show the effectiveness of the proposed algorithm.

Reference

  • Y. Sato, “A method of self-recovering equalization for ultilevel amplitude- modulation systems,” IEEE Trans. Commun., vol. 23, no. 6, pp.679–682, Jun. 1975.
  • D. N. Godard, “Self-recovering equalization and carrier tracking in two-dimensional data communications systems,” IEEE Trans. Commun., vol. 28, no. 11, pp. 1867–1875, Nov. 1980.
  • J. R. Treichler and B. G. Agee, “A new approach to multipath correction of constant modulus signals,” IEEE Trans. Acoust., Speech, Signal Process., vol. 31, no. 2, pp. 459–472, Apr. 1983.
  • G. H. Golub and C. F. van Loan, Matrix Computations,3rd ed. Baltimore, MD: Johns Hopkins Univ. Press, 1996.
  • O. Dabeer and E. Masry, “Convergence analysis of the constant modulus Algorithm Onkar Dabeer, member,” IEEE Trans. Inf. Theory, vol. 49, no. 6, pp. 1447–1464, Jun. 2003.
  • M. T. M. Silva and M. D. Miranda, “Tracking issues of some blind equalization algorithms,” IEEE Signal Process. Lett., vol. 11, no. 9 pp. 760–763, Sep. 2004.
  • C. R. Johnson, Jr., P. Schniter, T. J. Edres, J. D. Behm, D. R. Brown, and R. A. Casas, “Blind equalization using the constant modulus criterion: A review,” Proc. IEEE, vol. 86, no. 10, pp. 1927–1950, Oct. 1998.
  • G. Yan and H. Fan, “A Newton-like algorithm for complex variables with applications in blind equalization,” IEEE Trans. Signal Process. vol. 48, no. 2, pp. 553–556, Feb. 2000.