Robust Blind Adaptive Channel Equalization in Chaotic Communication Systems
-
Abstract
Based on the bounded property and statistics of chaotic signal and the idea of set-membership identification, we propose a set-membership generalized least mean square (SM-GLMS) algorithm with variable step size for blind adaptive channel equalization in chaotic communication systems. The steady state performance of the proposed SM-GLMS algorithm is analysed, and comparison with an extended Kalman filter (EKF)-based adaptive algorithm and variable gain least mean square (VG-LMS) algorithm is performed for blind adaptive channel equalization. Simulations show that the proposed SM-GLMS algorithm can provide more significant steady state performance improvement than the EKF-based adaptive algorithm and VG-LMS algorithm.
Article Text
-
-
-
About This Article
Cite this article:
ZHANG Jia-Shu. Robust Blind Adaptive Channel Equalization in Chaotic Communication Systems[J]. Chin. Phys. Lett., 2006, 23(12): 3187-3189.
ZHANG Jia-Shu. Robust Blind Adaptive Channel Equalization in Chaotic Communication Systems[J]. Chin. Phys. Lett., 2006, 23(12): 3187-3189.
|
ZHANG Jia-Shu. Robust Blind Adaptive Channel Equalization in Chaotic Communication Systems[J]. Chin. Phys. Lett., 2006, 23(12): 3187-3189.
ZHANG Jia-Shu. Robust Blind Adaptive Channel Equalization in Chaotic Communication Systems[J]. Chin. Phys. Lett., 2006, 23(12): 3187-3189.
|