Finding the Closest Lattice Point
This chapter describes algorithms which, given an arbitrary point of R n , find the closest point of some given lattice. The lattices discussed include the root lattices A n , D n , E 6 E 7, E 8 and their duals. These algorithms can be used for vector quantizing or for decoding lattice codes for a bandlimited channel.
KeywordsArbitrary Point Close Point Binary Code Decode Algorithm Coset Representative
Unable to display preview. Download preview PDF.