.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or preprocessing) and search. This paper presents a reduction algorithm and a search algorithm. Unlike the typical reduction algorithms, which use only the information of the lattice generator matrix, the new reduction algorithm also uses the information of the given input vector and the box constraint and is very effective for search. The new search algorithm overcomes some shortcomings of the existing search algorithms and gives some other improvement. Simulation results indicate the combination of the new reduction algorithm and the new search algorithm can be much more efficient than the existing algorithms, in particular when the least squares residual is large.
Keyword:
decoding
detection
integer least squares
lattice
MIMO channels
reduction
search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
One-pot synthesis of mixed superphanes with CpCo-capped cyclobutadiene- and cyclopentadienone rings.png)
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏Entropy Generation Methodology for Defect Analysis of Electronic and Mechanical Components—A Review.png)
Entropy
OAAI
EntropyIF0
OAAI分享收藏
查看更多内容