HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Electronic and Computer Engineering  >
ECE Journal/Magazine Articles >

Please use this identifier to cite or link to this item:
Title: Universal lattice decoding : principle and recent advances
Authors: Mow, Wai Ho
Keywords: Basis reduction
Nearest lattice point
Sphere decoder
Maximum likelihood detection
Optimal performance
Issue Date: Aug-2003
Citation: Wireless communications and mobile computing, v. 3, iss. 5, August 2003, p. 553-569
Series/Report no.: Special Issue on Coding and Its Applications in Wireless CDMA Systems
Abstract: The idea of formulating the detection of a lattice-type modulation, such as M-PAM and M-QAM, transmitted over a linear channel as the so-called universal lattice decoding problem dates back to at least the early 1990s. The applications of such lattice decoders have proliferated in the last few years because of the growing importance of some linear channel models, such as multiple-antenna fading channels and multi-user CDMA channels. The principle of universal lattice decoding can trace its roots back to the theory and algorithms developed for solving the shortest/closest lattice vector problem for integer programming and cryptoanalysis applications. In this semi-tutorial paper, such a principle as well as some related recent advances will be reviewed and extended. It will be shown that the lattice basis reduction algorithm of Lenstra, Lenstra and Lov\'{a}sz can significantly improve the performance of suboptimal lattice decoders, such as the zero-forcing and VBLAST detectors. In addition, new implementation of the optimal lattice decoder that is particularly efficient at moderate to high signal-to-noise ratios will also be presented.
Appears in Collections:ECE Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
LatticeDecodeWCMC.dvi110KbTeX dviView/Open
LatticeDecodeWCMC.pdfpre-published version282KbAdobe PDFView/Open

Find published version via OpenURL Link Resolver

All items in this Repository are protected by copyright, with all rights reserved.