Effective LLL reduction for lattice decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 196-200

  Ling, Cong ^a   Howgrave Graham, Nick ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b NTRU Cryptosystems   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; LLL-REDUCTION;

CYBERNETICS; INFORMATION THEORY; MIM DEVICES; TECHNICAL PRESENTATIONS; VECTORS;

DECODING;

EID: 51649098170     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557226     Document Type: Conference Paper

References (15)

1. W. H. Mow, "Maximum likelihood sequence estimation from the lattice viewpoint," IEEE Trans. Inform. Theory, vol. 40, pp. 1591-1600, Sept. 1994.
2. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999.
3. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, pp. 2201-2214, Aug. 2002.
4. J. Jalden and B. Ottersen, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Processing, vol. 53, pp. 1474-1484, Apr. 2005.
5. L. Babai, "On Lovász' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
6. H. Yao and G. W. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. Globecom'02, Taipei, China, Nov. 2002, pp. 17-21.
7. C. Windpassinger and R. F. H. Fischer, "Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction," in Proc. IEEE Information Theory Workshop, Paris, France, Mar. 2003, pp. 345-348.
8. A. K. Lenstra, J. H. W. Lenstra, and L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, pp. 515-534, 1982.
9. C. Ling, "Towards characterizing the performance of approximate lattice decoding in MIMO communications," in Proc. Int. Symp. Turbo Codes and ITG Conf. Source Channel Coding, Munich, Germany, Apr. 2006.
10. N. Howgrave-Graham, "Finding small roots of univariate modular equations revisited," in Proc. the 6th IMA Int. Conf. Crypt. Coding, 1997, pp. 131-142.
11. H. Daude and B. Vallee, "An upper bound on the average number of iterations of the LLL algoirthm," Theor. Comput. Sci., vol. 123, pp. 95-115, 1994.
12. P. Q. Nguyen and D. Stehle, "Floating-point LLL revisited," Lecture Notes in Computer Science, pp. 238-256.
13. P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers. Amsterdam, Netherlands: Elsevier, 1987.
14. A. Storjohann, "Faster algorithms for integer basis reduction," ETH-Zurich, Department of Computer Science, Zurich, Switzerland, Tech. Rep. 249, 1996.
15. N. Howgrave-Graham, "Computational mathematics inspired by RSA," PhD dissertation, University of Bath, Department of Computer Science, Bath, UK, 1998.