HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-01403929
Contributor : Gilles Villard Connect in order to contact the contributor
Submitted on : Monday, November 28, 2016 - 10:37:18 AM
Last modification on : Monday, May 16, 2022 - 4:58:02 PM

Links full text

Identifiers

  • HAL Id : hal-01403929, version 1
  • ARXIV : 1602.00169

Collections

Citation

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

Share

Metrics

Record views

79