.png){kind=icon}
返回
Lattice-Reduction-Aided Breadth-First Tree Searching Algorithm for MIMO Detection
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2017.2648783.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a lattice-reduction (LR)-aided breadthfirst tree searching algorithm for MIMO detection achieving nearoptimal performance with very low complexity. At each level of the tree in the search, only the paths whose accumulated metrics satisfy a particular restriction condition will be kept as the candidates. Furthermore, the number of child nodes expanded on each parent node, and the maximum number of candidates preserved at each level, are also restricted, respectively. All these measures ensure the proposed algorithm reaching a preset near-optimal performance and achieving very low average and maximum computational complexity. Simulation results verify the proposed algorithm's higher efficiency in terms of the performance/complexity tradeoff than the existing LR-aided K-best detectors and LR-aided fixed-complexity sphere decoders.
Keyword:
Lattice reduction
MIMO
breadth-first tree searching
sphere decoding
K-best detector
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Breadth-first signal decoder: A novel maximum-likelihood scheme for multi-input multi-output systems
PREAI
分享收藏LY354740 is a Potent and Highly Selective Group II Metabotropic Glutamate Receptor Agonist in Cells Expressing Human Glutamate ReceptorsLY354740是表达人类谷氨酸受体的细胞中有效且高度选择性的II组代谢型谷氨酸受体激动剂
PREAI
分享收藏分享收藏The acute impact of high-dose lipid-lowering treatment on endothelial progenitor cells in patients with coronary artery disease—The REMEDY-EPC early substudy.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容