A linearithmic time algorithm for a shortest vector problem in compute-and-forward design

We modify the algorithm proposed by Sahraei et al. in 2015, resulting an algorithm with expected complexity of O(n log n) arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where n is the dimension of the channel vector. This algorithm is more efficient than the best known algorithms with proved complexity.