Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
We describe some improvements to a proposed algorithm which encodes the error due to motion compensation in a videoconferencing codec. The algorithm involves lattice quantization using the 8-dimensional E8 lattice. We show that by using a different but equivalent form of E8 based on the extended Hamming code, we can significantly reduce storage requirements and computational complexity at the receiver. We also show that it is easy to perform lattice quantization using the well known 24-dimensional Leech lattice, which is an even better quantizer than E8