Open AccessNormalised frequency‐domain soft constraint satisfaction multimodulus blind algorithm
Author(s) -
Akande K.,
Iqbal N.,
Zerguine A.,
Chambers J.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.2845
Subject(s) - frequency domain , algorithm , constraint (computer aided design) , convergence (economics) , rate of convergence , computational complexity theory , constraint satisfaction , wireless broadband , computer science , wireless , reduction (mathematics) , domain (mathematical analysis) , constraint satisfaction problem , time domain , mathematical optimization , mathematics , telecommunications , wireless network , artificial intelligence , channel (broadcasting) , mathematical analysis , geometry , probabilistic logic , economics , computer vision , economic growth
A frequency‐domain implementation of the soft constraint satisfaction multimodulus blind algorithm is proposed. This leads to a significant reduction in the computational complexity, thus making it suitable for broadband wireless systems. The convergence of the developed algorithm is then improved by normalising each of the frequency bins in the weight update. Simulation results support the superior performance of the proposed algorithm over its time domain counterpart in terms of faster convergence rate.