A Combined E-Approximation Blind Equalization Method Based on Automatic Modulation Recognition

epsiv -approximate blind equalization algorithm used to solve quadratic optimization problem was proposed recently. However, when the algorithm is concerned in the existing literatures, prior knowledge of finite alphabets set is asserted as a hypothesis. To break through this limitation, automatic modulation recognition technology based on cyclic cumulant is proposed in this article. Furthermore, combined with epsiv - approximation recursive algorithm, this method is designed to solve problem of blind equalization without any prior information on finite alphabets set especially in time-varying channel environment. Derivation and simulation show its validity and superiority.