Universal lattice decoding: A review and some recent results

IEEE International Conference on Communications

Volumn 5, Issue , 2004, Pages 2842-2846

  Mow, Wai Ho ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; INTEGER PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING; SIGNAL TO NOISE RATIO; VECTORS;

BOUNDARY ERRORS; GAUSSIAN RANDOM VARIABLES; LATTICE VECTOR PROBLEMS; UNIVERSAL LATTICE DECODING;

DECODING;

EID: 4143061506     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. W. H. Mow. Maximum Likelihood Sequence Estimation from the Lattice Viewpoint. M.Phil. Thesis, Dept. of Information Engineering, the Chinese University of Hong Kong, June 1991; downloadable at http://www.ee.ust.hk/ ~eewhmow.
2. W. H. Mow. Maximum Likelihood Sequence Estimation from the Lattice Viewpoint. IEEE Trans. Inform. Theory 1994; 40(5): 1591-1600.
3. E. Viterbo, J. Boutros. A universal lattice code decoder for fading channels. IEEE Trans. Inform. Theory 1999; 45(5): 1639-1642.
4. M. O. Damen, A. Chkeif, J.-C. Belfiore. Lattice code decoder for space-time codes. IEEE Commun. Lett. 2000; 4(5): 161-163.
5. L. Brunel, J. J. Boutros. Lattice Decoding for Joint Detection in Direct-Sequence CDMA Systems. IEEE Trans. Inform. Theory 2003; 49(4): 1030-1037.
6. H. Vikalo, B. Hassibi. Maximum-Likelihood Sequence Detection of Multiple Antenna Systems over Dispersive Channels via Sphere Decoding. EURASIP Journal on Applied Signal Processing 2002; 2002(5), 525-531.
7. R. Kannan. Minkowski's Convex Body Theorem and Integer Programming. Math. Oper. Research 1987; 12: 415-440.
8. A. K. Lenstra, H. W. Lenstra, L. Lovász. Factoring Polynomials with Rational Coefficients. Math. Ann. 1982, 261: 513-534.
9. A. Shamir. A Polynomial Time Algorithm for Breaking the Merkle-Hellman Cryptosystem. In Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982; 145-152.
10. L. Lovász. An Algorithmic Theory of Numbers, Graphs and Convexity. Capital City Press, Montpelier, Vermont, 1986.
11. L. Babai. On Lovász' lattice reduction and the nearest lattice point problem. Combinatoria 1986, 6(1): 1-13.
12. G. J. Foschini. Layered space-time architecture for wireless communication in a fading environment when using multielement antennas. Bell Labs Technical Journal 1996; 1(2): 41-59.
13. U. Fincke, M. Pohst. Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis. Math. Comp. 1985; 44:463-471.
14. H. Yao, G. W. Wornell. Lattice-Reduction-Aided Detectors for MIMO Communication Systems. In Proc. IEEE Globecom, Taipei, November 17-21, 2002.
15. C. P. Schnorr, M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Mathematical Programming 1994; 66: 181-191.
16. E. Agrell, T. Eriksson. A. Vardy, K. Zeger. Closest Point Search in Lattices. IEEE Trans. Inform. Theory 2002, 48: 2201-2213.
17. B. Hassibi, H. Vikalo. On the Expected Complexity of Sphere Decoding. In Proc. Asilomar Conf. Signals, Systems and Computers 2001; 2: 1051-1055.
18. W. H. Mow. Universal Lattice Decoding: Principle and Recent Advances. Wireless Communications and Mobile Computing 2003; 3(5): 553-569.