Title :
Near-Optimal Low Complexity MLSE Equalization
Author :
Myburgh, HC ; Olivier, Jan C.
Author_Institution :
Univ. of Pretoria, Tshwane
fDate :
March 31 2008-April 3 2008
Abstract :
An iterative maximum likelihood sequence estimation (MLSE) equalizer (detector) with hard outputs, that has a computational complexity quadratic in the data block and the channel length, is proposed. Its performance is compared to the Viterbi MLSE algorithm that has a computational complexity that is linear in the block length and exponential in the channel memory length. It is shown via computer simulation that the proposed iterative MLSE detector is able to detect binary phase-shift keying (BPSK) signals in systems with significantly larger channel length than what is possible with the Viterbi algorithm, for frequency selective Rayleigh fading channels.
Keywords :
Viterbi detection; computational complexity; equalisers; maximum likelihood sequence estimation; MLSE equalization; Viterbi MLSE algorithm; binary phase-shift keying signal detection; computational complexity; data block; iterative MLSE detector; iterative MLSE qualizer; maximum likelihood sequence estimation; selective Rayleigh fading channel; Computational complexity; Computer simulation; Equalizers; Iterative algorithms; Maximum likelihood detection; Maximum likelihood estimation; Phase detection; Phase frequency detector; Phase shift keying; Viterbi algorithm;
Conference_Titel :
Wireless Communications and Networking Conference, 2008. WCNC 2008. IEEE
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4244-1997-5
DOI :
10.1109/WCNC.2008.45
