Computing the Voronoi cell of a lattice: the diamond-cutting algorithm

DOI10.1109/18.481786zbMath0853.68166OpenAlexW2104242142WikidataQ63961292 ScholiaQ63961292MaRDI QIDQ4879998

Ezio Biglieri, Emanuele Viterbo

Publication date: 2 June 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.481786

zbMATH Keywords

Voronoi celladditive white Gaussian noise channellattice constellation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Channel models (including quantum) in information and communication theory (94A40)

Related Items (4)

The Optimal Lattice Quantizer in Nine Dimensions ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ Investigation of medical 3D-rendering algorithms

This page was built for publication: Computing the Voronoi cell of a lattice: the diamond-cutting algorithm