Linear-time nearest point algorithms for Coxeter lattices

IEEE Transactions on Information Theory

Volumn 56, Issue 3, 2010, Pages 1015-1022

  McKilliam, Robby G ^a   Smith, Warren D ^b   Clarkson, I Vaughan L ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b Center for Range Voting   (United States)

Author keywords

Channel coding; Lattice theory; Nearest point algorithm; Quantization

Indexed keywords

ARITHMETIC COMPLEXITY; LATTICE THEORIES; NEAREST POINT; NEAREST POINT ALGORITHM; WORST CASE; WORST-CASE COMPLEXITY;

CHANNEL CODING; SIGNAL RECONSTRUCTION;

ALGORITHMS;

EID: 77949498407     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2039090     Document Type: Article

References (38)

1. I. V. L. Clarkson, "An algorithm to compute a nearest point in the lattice A*n," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Karlsruhe, Germany: Springer, 1999, vol.1719, Lecture Notes in Computer Science, pp. 104-120.
2. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed. New York: Springer, 1998.
3. M. Ajtai, "Generating hard instances of lattice problems," in Proc. 28th ACM Symp. Theory Computing, May 1996, pp. 99-108.
4. M. Ajtai and C. Dwork, "A public-key cryptosystem with worst-case/ average-case equivalence," in Proc. 29th ACM Symp. Theory of Computing, May 1997, pp. 284-293.
5. L. Brunel and J. J. Boutros, "Lattice decoding for joint detection in direct-sequence CDMA systems," IEEE Trans. Inf. Theory, vol.49, pp. 1030-1037, 2003.
6. D. J. Ryan, I. V. L. Clarkson, I. B. Collings, and W. Heath, Jr, "Performance of vector perturbation multiuser MIMO systems with limited feedback," IEEE Trans. Commun., Sep. 2008.
7. R. G. McKilliam and I. V. L. Clarkson, "Identifiability and aliasing in polynomial-phase signals, accepted for," IEEE Trans. Signal Process., 2009.
8. R. G. McKilliam, B. G. Quinn, I. V. L. Clarkson, and B. Moran, "Frequency estimation by phase unwrapping," IEEE Trans. Signal Process., 2009, submitted for publication.
9. I. V. L. Clarkson, "Approximate maximum-likelihood period estimation from sparse, noisy timing data," IEEE Trans. Signal Process., vol.56, no.5, pp. 1779-1787, May 2008.
10. R. G. McKilliam, I. V. L. Clarkson, D. J. Ryan, and I. B. Collings, "Linear-time block noncoherent detection of PSK," in Proc. Int. Conf. Acoust. Speech Signal Process., Apr. 2009, pp. 2465-2468.
11. R. G. McKilliam and I. V. L. Clarkson, "Maximum-likelihood period estimation from sparse, noisy timing data," in Proc. Int. Conf. Acoust. Speech Signal Process., Mar. 2008, pp. 3697-3700.
12. J. H. Conway and N. J. A. Sloane, "Fast quantizing and decoding and algorithms for lattice quantizers and codes," IEEE Trans. Inf. Theory, vol.28, pp. 227-232, Mar. 1982.
13. D. Micciancio, "The hardness of the closest vector problem with preprocessing," IEEE Trans. Inf. Theory, vol.47, pp. 1212-1215, 2001.
14. P. van Emde Boas, Another NP-Complete Partition Problem and the Complexity of Computing Short Vectors in a Lattice Mathematisch Instituut, Amsterdam, The Netherlands, 1981, Tech. Rep..
15. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol.48, pp. 2201-2214, Aug. 2002.
16. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol.45, pp. 1639-1642, Jul. 1999.
17. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications," SIGSAM Bull., vol.15, no.1, pp. 37-44, 1981.
18. R. Kannan, "Minkowski's convex body theorem and integer programming," Math. Oper. Res., vol.12, no.3, pp. 415-440, 1987.
19. J. H. Conway and N. J. A. Sloane, "Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice," IEEE Trans. Inf. Theory, vol.32, pp. 41-50, Jan. 1986.
20. R. G. McKilliam, I. V. L. Clarkson, and B. G. Quinn, "An algorithm to compute the nearest point in the lattice A*n," IEEE Trans. Inf. Theory, vol.54, pp. 4378-4381, Sep. 2008.
21. R. G. McKilliam, I. V. L. Clarkson, W. D. Smith, and B. G. Quinn, "A linear-time nearest point algorithm for the lattice A*n," in Int. Symp. Inf. Theory and its Appl., Dec. 2008.
22. H. S. M. Coxeter, "Extreme forms," Canad. J. Math., vol.3, pp. 391-441, 1951.
23. J. Martinet, Perfect Lattices in Euclidean Spaces. New York: Springer, 2003.
24. A. R. Calderbank and N. J. A. Sloane, "An eight-dimensional trellis code," Proc. IEEE, vol.74, pp. 757-759, May 1986.
25. L.-F. Wei, "Trellis-coded modulation with multidimensional constellations," IEEE Trans. Inf. Theory, vol.33, pp. 483-501, Jul. 1987.
26. G. D. Forney, Jr, "Coset codes I: Introduction and geometrical classification," IEEE Trans. Inf. Theory, vol.34, pp. 1123-1151, Sep. 1988.
27. G. D. Forney, Jr, "Coset codes II: Binary lattices and related codes," IEEE Trans. Inf. Theory, vol.34, pp. 1152-1187, Sep. 1988.
28. J. H. Conway and N. J. A. Sloane, "Voronoi regions of lattices, second moments of polytopes, and quantization," IEEE Trans. Inf. Theory, vol.28, pp. 211-226, Mar. 1982.
29. M. S. Postol, "Some newlattice quantization algorithms for video compression coding," IEEE Trans. Circuits Syst., vol.12, no.1, pp. 53-60, Jan. 2002.
30. N. Secord and R. de Buda, "Demodulation of a Gosset lattice code having a spectral null at DC," IEEE Trans. Inf. Theory, vol.35, pp. 472-477, Mar. 1989.
31. I. V. L. Clarkson, "Frequency estimation, phase unwrapping and the nearest lattice point problem," in Proc. Int. Conf. Acoust. Speech Signal Process., Mar. 1999, vol.3, pp. 1609-1612.
32. B. G. Quinn, "Estimating the mode of a phase distribution," in Proc. Asilomar Conf. Signals, Syst. Comput., Nov. 2007, pp. 587-591.
33. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, U.K.: MIT Press, 2001.
34. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan, "Time bounds for selection," J. Comput. Syst. Sci., vol.7, no.4, pp. 448-461, 1973.
35. R. W. Floyd and R. L. Rivest, "The algorithm SELECT-For finding the ith smallest of- elements," Commun. ACM, vol.18, no.3, pp. 173-173, 1975.
36. R. W. Floyd and R. L. Rivest, "Expected time bounds for selection," Commun. ACM, vol.18, pp. 165-172, Mar. 1975.
37. D. E. Knuth, The Art of Computer Programming, 3rd ed. Reading, MA: Addison-Wesley, 1997, vol.2, Seminumerical Algorithms.
38. T. Burger, P. Gritzmann, and V. Klee, "Polytope projection and projection polytopes," The Amer. Math. Monthly, vol.103, no.9, pp. 742-755, Nov. 1996.