A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design

Jinming Wen (1) , Xiao-Wen Chang (2)

1 ARIC - Arithmetic and Computing
2 McGill University = Université McGill [Montréal, Canada]

We propose an algorithm with expected complexity of O(nlogn) 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.

Mots clés: Shortest vector problem; Compute-and-forward; linearithmic time algorithm

Domaines: Informatique

Jinming Wen, Xiao-Wen Chang. A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design. 2016. ⟨hal-01403929⟩