Multiple-antenna differential lattice decoding
From a lattice viewpoint, Clarkson, Sweldens and Zheng significantly reduced the complexity of multiantenna differential decoding. Their approximate decoding algorithm, however, has not unleashed the full potential of lattice decoding. In this paper, we present several improved algorithms, generally referred to as differential lattice decoding (DLD), for multiantenna communication. We first analyze two distinct approximate DLD algorithms, and then develop an algorithm that exactly finds the closest lattice point in the Euclidean space. This exact DLD is subsequently augmented by local search to compensate for the remaining approximation. The small amount of extra complexity of the exact or augmented DLD is rewarded by a clear performance gain. We find that employing basis reduction is very effective to reduce the overall decoding complexity for high lattice dimensions. Moreover, the dimension of the lattice defined in this paper is independent of the number of receive antennas, which results in not only lower complexity, but also better performance for a multiantenna receiver.