The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Blind Algorithms with Decision Feedback based on Zero-Error Probability for Constant Modulus Errors

  • 김남용 (강원대학교 공학대학 전자정보통신공학부) ;
  • 강성진 (한국기술대학교 전기전자통신공학부)
  • Received : 2011.10.29
  • Accepted : 2011.12.07
  • Published : 2011.12.30
Download PDF
⟨ Previous Next ⟩

Abstract

The constant modulus algorithm (CMA) widely used in blind equalization applications minimizes the averaged power of constant modulus error (CME) defined as the difference between an instant output power and a constant modulus. In this paper, a decision feedback version of the linear blind algorithm based on maximization of the zero-error probability for CME is proposed. The Gaussian kernel of the maximum zero-error criterion is analyzed to have the property to cut out excessive CMEs that may be induced from severely distorted channel characteristics. Decision feedback approach to the maximum zero-error criterion for CME is developed based on the characteristic that the Gaussian kernel suppresses the outliers and this prevents error propagation to some extent. Compared to the linear algorithm based on maximum zero-error probability for CME in the simulation of blind equalization environments, the proposed decision feedback version has superior performance enhancement particularly in cases of severe channel distortions.

Keywords

References

  1. C. Johnson, Jr., "Blind equalization using the constant modulus criterion: A Review," Proc. of the IEEE, Vol. 86, pp. 1927-1950, Oct. 1998. https://doi.org/10.1109/5.720246
  2. J. Treichler and B. Agee, "A new approach to multipath correction of constant modulus signals," IEEE Trans. Acoust., Speech, Signal Process. Vol. 31, pp. 349-372, Nov. 1983. https://doi.org/10.1109/TASSP.1983.1164080
  3. L. He and S. Kassam, "Convergence analysis of blind equalization algorithms using constellation - matching," IEEE Trans. Communications, Vol. 56, No.11, pp. 1765-1768, Nov. 2008. https://doi.org/10.1109/TCOMM.2008.060370
  4. N. Kim, "Maximum probability criterion and a new constant modulus algorithm," The Journal of Korea Information and Communication Society, Vol. 34, pp. 85-90, Feb. 2009.
  5. E. Parzen, "On the estimation of a probability density function and the mode," Ann. Math. Stat. Vol. 33, p.1065, 1962. https://doi.org/10.1214/aoms/1177704472
  6. J. Principe, D. Xu, and J. Fisher, Information Theoretic Learning, in: S. Haykin, Unsupervised Adaptive Filtering, Wiley, New York, Vol. I, pp. 265-319, 2000.
  7. D. Erdogmus and J. Principe, "An entropy minimization algorithm for supervised Training of nonlinear systems," IEEE Trans. Signal Processing, Vol. 50, pp. 1780-1786, July, 2002 https://doi.org/10.1109/TSP.2002.1011217
  8. D. Erdogmus, Y. Rao, and J. Principe, "Supervised Training of Adaptive Systems with Partially Labeled Data," Proceedings of the International Conference on ASSP, pp. v321-v324, Apr. 2005.
  9. S. Haykin, Adaptive Filter Theory, Prentice Hall, Upper Saddle River, 4th edition, 2001.
  10. J. Proakis, Digital Communications, McGraw -Hill, NY, 1989.