An Efficient Optimal Algorithm for the Successive Minima Problem

Abstract

In many applications, including integer-forcing linear multiple-input and multiple-output (MIMO) receiver design, one needs to solve a successive minima problem (SMP) on an n-dimensional lattice to get an optimal integer coefficient matrix A* ∈ Z <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n×n</sup> . In this paper, we first propose an efficient optimal SMP algorithm with an O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) memory complexity. The main idea behind the new algorithm is it first initializes with a suitable suboptimal solution, which is then updated via a novel algorithm with only O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) flops in each updating, until A* is obtained. Different from existing algorithms which find A* column by column through using a sphere decoding search strategy n times, the new algorithm uses a search strategy once only. We then rigorously prove the optimality of the proposed algorithm. Furthermore, we theoretically analyze its complexity. In particular, we not only show that the new algorithm is Ω(n) times faster than the most efficient existing algorithm with polynomial memory complexity, but also assert that it is even more efficient than the most efficient existing algorithm with exponential memory complexity. Finally, numerical simulations are presented to illustrate the optimality and efficiency of our novel SMP algorithm.