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.
Type de document :
Pré-publication, Document de travail
2016
Liste complète des métadonnées

https://hal.inria.fr/hal-01403929
Contributeur : Gilles Villard <>
Soumis le : lundi 28 novembre 2016 - 10:37:18
Dernière modification le : vendredi 20 avril 2018 - 15:44:26

Lien texte intégral

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

89