Sparsely connected neural network for massive MIMO detection

G Gao, C Dong, K Niu - 2018 IEEE 4th International …, 2018 - ieeexplore.ieee.org
Deeping learning can achieve high parallelism and robustness, which is especially suitable
for massive multiple-input multiple-output (MIMO) detection. There are already some well …

Improved K-best sphere detection for uncoded and coded MIMO systems

S Han, T Cui, C Tellambura - IEEE Wireless Communications …, 2012 - ieeexplore.ieee.org
The conventional K-best sphere decoder (KSD) keeps the best K nodes at each level of the
search tree. In addition to retaining the best K nodes, we also consider all the nodes whose …

A 4× 4 64-QAM reduced-complexity K-best MIMO detector up to 1.5 Gbps

PY Tsai, WT Chen, XC Lin… - Proceedings of 2010 …, 2010 - ieeexplore.ieee.org
In this paper, a VLSI architecture of a reduced-complexity K-best sphere decoder is
designed, which aims to solve the 4× 4 64-QAM multiple-input multiple-output (MIMO) signal …

Variation of the fixed-complexity sphere decoder

KC Lai, CC Huang, JJ Jia - IEEE Communications Letters, 2011 - ieeexplore.ieee.org
The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial
multiplexing scheme. The search tree is statically divided into a full expansion stage and a …

An Efficient K-Best MIMO Detector for Large Modulation Constellations

YX Liu, SJ Jihang, YL Ueng - IEEE Open Journal of Circuits and …, 2023 - ieeexplore.ieee.org
For K-best multiple-input multiple-output (MIMO) detection using real-valued decomposition
(RVD), we need to obtain the surviving candidates from candidates, where is the modulation …

Robust fixed-complexity sphere decoders for rank-deficient MIMO systems

Y Ding, Y Wang, JF Diouris… - IEEE transactions on …, 2013 - ieeexplore.ieee.org
Sphere decoder (SD) has variable complexity, and the traditional fixed-complexity sphere
decoder (FSD) is not applicable for rank-deficient (NT> NR) multiple input multiple output …

Low-complexity lattice reduction algorithm for MIMO detectors with tree searching

H Kim, H Lee, J Koo, J Kim - EURASIP Journal on Wireless …, 2017 - Springer
In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input
multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are …

Step reduced K-best sphere decoding

X Mao, Y Cheng, L Ma, H Xiang - 2012 IEEE Vehicular …, 2012 - ieeexplore.ieee.org
We propose an algorithm that reduces the complexity of the K-best sphere decoding (K-best
SD) algorithm, which is a powerful parallel detection algorithm for multiple-input multiple …

MIMO 系统中低功耗性能最优的球译码

钱荣荣, 漆渊, 彭涛, 王文博 - 北京邮电大学学报, 2011 - journal.bupt.edu.cn
针对球译码中性能与复杂度无法兼顾的问题, 提出了消除固定复杂度球译码算法复杂度冗余的
方法. 该方法以满分集度为性能基准, 经过合理的半径构造, 使发送向量落在超球体外的概率足够 …

[HTML][HTML] 基於改良精化雅可比法與雙脈動陣列架構之軟性輸出的巨量多輸入多輸出偵測器設計

CK Huang - 2021 - ir.lib.ncu.edu.tw
摘要(中) 隨著行動流量呈等比級數增長, 巨量多輸入多輸出(Massive Multi-Input-Multi-Output)
系統被視為下一代無線通訊系統中一項關鍵的技術, 相較於傳統MIMO 系統在頻譜效率, 可靠性 …