Computing the Voronoi Cell of a Lattice: The Diamond-Cutting Algorithm

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 161-171

  Viterbo, Emanuele ^b   Biglieri, Ezio ^a,b  

^a IEEE

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Computational geometry; Covering; Error probability; Lattice; Lattice constellation; Packing; Quantization; Quantizing constant; Voronoi region

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; ERROR ANALYSIS; PERFORMANCE; PROBABILITY; SIGNAL THEORY; VECTORS; WHITE NOISE;

DIAMOND CUTTING ALGORITHMS; ERROR PROBABILITY; LATTICE CONSTELLATION; QUANTIZATION; QUANTIZING CONSTANT; VORONOI CELL;

INFORMATION THEORY;

EID: 0029770922     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481786     Document Type: Article

References (18)

1. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. Berlin, Germany: Springer-Verlag, 1992.
2. P. Erdös, P. M. Gruber, and J. Hammer, Lattice Points. Essex, England: Longman, 1989.
3. H. Edelsbrunner, Algorithms in Combinatorial Geometry. Berlin, Germany: Springer-Verlag, 1987.
4. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vul. 44,pp. 463-471, Apr. 1985.
5. P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers, 2nd ed. Amsterdam, The Netherlands: North-Holland, 1987.
6. P. M. Gruber, "Geometry of numbers," in Handbook of Convex Geometry, vol. B, P. M. Gruber and J. M. Wills, Eds. Amsterdam, The Netherlands: Elsevier. 1993, pp. 737-764.
7. E. Schulte, "Tilings," in Handbook of Convex Geometry, vol. B, P. M. Gruber and J. M. Wills, Eds. Amsterdam, The Netherlands: Elsevier, 1993, pp. 899-932.
8. G. D. Forney, "Multidimensional constellations-Part II: Voronoi constellations," IEEE J. Select. Areas Commun., vol. 7, no. 6,pp. 941-958, Aug. 1989.
9. _, "Geometrically uniform codes," IEEE Trans. Inform. Theory,vol. 37, no. 5,pp. 1241-1260, Sept. 1991.
10. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, no. 3, May 1959.
11. E. Biglieri, A. Sandri, and A. Spalvieri, "Computing upper bounds to error probability of coded modulation schemes," in Proc. ICC'94 (New Orleans, LA, May 1994), pp. 650-654.
12. D. Coulson, "The dual lattice of an extreme six-dimensional lattice," J. Australian Math. Soc. (Ser. A),vol. 50,pp. 373-383, 1991.
13. J. H. Conway and N. J. A. Sloane, "On the Voronoi regions of certain lattices," SIAM J. Algebr. Discr. Meth., vol. 5, no. 3,pp. 294-305, Sept. 1984.
14. 6*," J. Australian Math. Soc. (Ser. A),vol. 43,pp. 268-278, 1987.
15. 7*," SIAM J. Discr. Math., vol. 1, no. 1,pp. 134-141, Feb. 1988.
16. T. J. Dickson, "The extreme coverings of 4-space by spheres," J. Australian Math. Soc., vol. 7,pp. 490-4196, 1967.
17. E. S. Barnes and D. W. Trenerry,."A class of extreme lattice-coverings of re-space by spheres," J. Australian Math. Soc., vol. 14,pp. 247-256, 1972.
18. A. M. McLoughlin, "The complexity of computing the covering radius of a code," IEEE Trans. Inform. Theory, vol. IT 30, no. 5,pp. 800-804, 1984.