Abstract
In this work, a sequential estimation algorithm based on branch metric is used as channel equalizer to combat intersymbol interference in frequency-selective wireless communication channels. The bit error rate (BER) and computational complexity of the algorithm are compared with those of the maximum likelihood sequence estimation (MLSE), the recursive least squares (RLS) algorithm, the Fano sequential algorithm, the stack sequential algorithm, list-type MAP equalizer, soft-output sequential algorithm (SOSA) and maximum-likelihood soft-decision sequential decoding algorithm (MLSDA). The BER results have shown that whilst the sequential estimation algorithm has a close performance to the MLSE using the Viterbi algorithm, its performance is better than the other algorithms. Beside, the sequential estimation algorithm is the best in terms of computational complexity among the algorithms mentioned above, so it performs the channel equalization faster. Especially in M-ary modulated systems, the equalization speed of the algorithm increases exponentially when compared to those of the other algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
