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

preprint2016arXivOpen access

We propose an algorithm with expected complexity of $\bigO(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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0