A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2016

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

Abstract

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.

Dates and versions

hal-01403929 , version 1 (28-11-2016)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More