计算-正演设计中最短向量问题的线性时间算法
A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design
摘要:
我们提出了一个算法,以预期的复杂度的$\bigO(n\log n)$算术运算,以解决一个特殊的最短向量问题中出现的计算机和正向设计,其中$n$是尺寸的信道向量。该算法是更有效的比最好的已知的算法,证明了复杂性。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。