.png){kind=icon}
返回
On Solving the Shortest Basis Problem Based on Sequential Reduction
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.3043499.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Low-complexity lattice reduction algorithms are generally not optimized for solving the shortest basis problem (SBP). We fill this blank by tweaking the recently introduced sequential reduction (SR). In a quest for developing a provable and low-complexity reduction algorithm under the SR framework, we propose to employ successive interference cancellation (SIC) as a subroutine inside SR, and the whole algorithm is referred to as SR-SIC. On the theoretical front, we prove that the upper bound on the basis length of SR-SIC is better than those of major Lenstra, Lenstra, and Lovasz (LLL) based variants when the dimension of the lattice basis is no larger than 4. In practice, we show by simulations that SR-SIC yields higher information rate than LLL when designing integer-forcing linear receivers, in which SR-SIC also enjoys lower computational complexity.
Keyword:
Sequential reduction
successive interference cancellation (SIC)
shortest basis problem (SBP)
integer-forcing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Economics of One Health: Costs and benefits of integrated West Nile virus surveillance in Emilia-Romagna.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容