Fast quantizing and decoding and algorithms for lattice quantizers and codes

For each of the lattices <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Aₙ(n ≥ 1), Dₙ(n ≥ 2), E₆, E₇, E₈</tex> , and their duals a very fast algorithm is given for finding the closest lattice point to an arbitrary point. If these lattices are used for vector quantizing of uniformly distributed data, the algorithm finds the minimum distortion lattice point. If the lattices are used as codes for a Gaussian channel, the algorithm performs maximum likelihood decoding.