Abstract
A novel adaptive blind equalization method based on sparse Bayesian learning (blind relevance vector machine (RVM) equalizer) is proposed. This paper incorporates a Godard or constant modulus algorithm (CMA)-like error function into a general Bayesian framework. This Bayesian frame work can obtain sparse solutions to regression tasks utilizing models linear in the parameters. By exploiting a probabilistic Bayesian learning framework, the sparse Bayesian learning provides the accurate model for the blind equalization, which typically utilizes fewer basis functions than the equalizer based on the popular and state-of-the-art support vector machine (SVM) - blind SVM equalizer. Simulation results show that the proposed blind RVM equalizer provides improved stability, performance and complexity compared to the blind SVM equalizer in terms of inter-symbol interference and bit error rate.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.