In this paper, we formulate the problem of blind equalization of constant modulus (CM) signals as a convex optimization problem. The convex formulation is obtained by performing an algebraic transformation on the direct formulation of the CM equalization problem. Using this transformation, the original nonconvex CM equalization formulation is turned into a convex semidefinite program (SDP) that can be efficiently solved using interior point methods. Our SDP formulation is applicable to baud spaced equalization as well as fractionally spaced equalization. Performance analysis shows that the expected distance between the equalizer obtained by the SDP approach and the optimal equalizer in the noise-free case converges to zero exponentially as the signal-to-noise ratio (SNR) increases. In addition, simulations suggest that our method performs better than standard methods while requiring significantly fewer data samples.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.