Discrete Topology of (An*) Optimal Sampling Grids. Interest in Image Processing and Visualization
Journal of Mathematical Imaging and Vision
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 754.84 |
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