DocumentCode
1245270
Title
Computing the Voronoi cell of a lattice: the diamond-cutting algorithm
Author
Viterbo, Emanuele ; Biglieri, Ezio
Author_Institution
Dipartimento di Elettronica, Politecnico di Torino, Italy
Volume
42
Issue
1
fYear
1996
fDate
1/1/1996 12:00:00 AM
Firstpage
161
Lastpage
171
Abstract
Numerical evaluation of some typical lattice parameters such as density, thickness, dimensionless second moment (quantizing constant), etc., are considered. Computational complexity grows exponentially with the dimension of the lattices and all known results rely on the very regular structure of some of these. In the paper the authors present a general algorithm which enables computation of all the common parameters for any given lattice by means of a complete description of its Voronoi cell. Using this algorithm, they have computed previously unknown values of the quantizing constants of some particularly interesting lattices. These results can be used to evaluate the performance of lattice quantizers and lattice signal constellations for the Gaussian channel. As an application they evaluate a tight upper bound for the error probability of a lattice constellation used for transmission over the additive white Gaussian noise channel
Keywords
Gaussian channels; computational complexity; computational geometry; error statistics; lattice theory; parameter estimation; quantisation (signal); Gaussian channel; Voronoi cell; additive white Gaussian noise channel; computational complexity; density; diamond-cutting algorithm; dimension; dimensionless second moment; error probability; lattice parameters; lattice quantizers; lattice signal constellations; quantizing constant; thickness; Additive white noise; Closed-form solution; Constellation diagram; Error probability; Gaussian channels; Helium; Lattices; Monte Carlo methods; Quantization; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.481786
Filename
481786
Link To Document