Blind equalization with a deterministic constant modulus cost-a set-membership filtering approach

This paper presents the blind equalization problem in the novel deterministic framework of set-membership filtering (SMF). An adaptive algorithm based on a deterministic version of the constant modulus criterion is derived to seek the set-membership blind equalization solution. The proposed set-membership constant modulus (SM-CM) algorithm incorporates selection of data-dependent optimal step-size at every time and a selective update strategy. The performance and features of the proposed SM-CM algorithm are compared with those of the conventional CMA. Results indicate that the SM-CM algorithm outperforms the CMA in convergence speed, steady-state performance and average computational complexity. Furthermore, unlike the conventional CMA, the proposed algorithm does not require the step-size to be set heuristically