By Topic

Maximum likelihood sequence estimation from the lattice viewpoint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wai Ho Mow ; Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong

Considers the problem of data detection in multilevel lattice-type modulation systems in the presence of intersymbol interference and additive white Gaussian noise. The conventional maximum likelihood sequence estimator using the Viterbi algorithm has a time complexity of O(mν+1) operations per symbol and a space complexity of O(δmν) storage elements, where m is the size of input alphabet, ν is the length of channel memory, and δ is the truncation depth. By revising the truncation scheme and viewing the channel as a linear transform, the authors identify the problem of maximum likelihood sequence estimation with that of finding the nearest lattice point. From this lattice viewpoint, the lattice sequence estimator for PAM systems is developed, which has the following desired properties: 1) its expected time-complexity grows as δ2 as SNR→∞; 2) its space complexity grow as δ; and 3) its error performance is effectively optimal for sufficiently large m. A tight upper bound on the symbol error probability of the new estimator is derived, and is confirmed by the simulation results of an example channel. It turns out that the estimator is effectively optimal for m⩾4 and the loss in signal-to-noise ratio is less than 0.5 dB even for m=2. Finally, limitations of the proposed estimator are also discussed

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 5 )