2000 character limit reached
Adaptive Blind Sparse-Channel Equalization
Published 5 Aug 2017 in cs.IT and math.IT | (1708.01824v1)
Abstract: In this article, a fractional-norm constrained blind adaptive algorithm is presented for sparse channel equalization. In essence, the algorithm improves on the minimization of the constant modulus (CM) criteria by adding a sparsity inducing (\ell_p)-norm penalty. Simulation results demonstrate that the proposed regularized equalizer exploits the inherent channel sparsity effectively and exhibits faster convergence compared to its counterparts.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.