Adaptive Threshold-Aided K-Best Sphere Decoding for Large MIMO Systems
Source abstract
Abstract
This paper proposes an adaptive threshold-aided K-best sphere decoding (AKSD) algorithm for large multiple-input multiple-output systems. In the proposed scheme, to reduce the average number of visited nodes compared to the conventional K-best sphere decoding (KSD), the threshold for retaining the nodes is adaptively determined at each layer of the tree. Specifically, we calculate the adaptive threshold based on the signal-to-noise ratio and index of the layer. The ratio between the first and second smallest accumulated path metrics at each layer is also exploited to determine the threshold value. In each layer, in addition to the K paths associated with the smallest path metrics, we also retain the paths whose path metrics are within the threshold from the Kth smallest path metric. The simulation results show that the proposed AKSD provides nearly the same bit error rate performance as the conventional KSD scheme while achieving a significant reduction in the average number of visited nodes, especially at high signal-to-noise ratios.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced MIMO Systems Optimization · Advanced Wireless Communication Techniques · Cooperative Communication and Network Coding
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Electrical and Information Engineering, Seoul National University of Science and Technology, 232 Gongneung-ro, Nowon-gu, Seoul 01811, Korea
Department of Electrical and Information Engineering, Research Center for Electrical and Information Technology, Seoul National University of Science and Technology, 232 Gongneung-ro, Nowon-gu, Seoul 01811, Korea
Funding
Seoul National University of Science and Technology
References (14)
Show source-provided references
1. Large-scale MIMO detection for 3GPP LTE: Algorithms and FPGA implementations10.1109/JSTSP.2014.2313021 ↗
2. Scaling up MIMO: Opportunities and challenges with very large arrays10.1109/MSP.2011.2178495 ↗
3. An adaptive partial parallel multistage detection for MIMO systems10.1109/TCOMM.2005.844970 ↗
4. On the practical performance of VBLAST10.1109/LCOMM.2004.835324 ↗
5. Fixing the complexity of the sphere decoder for MIMO detection10.1109/TWC.2008.060378 ↗
6. Improved Sorting Architecture for K-Best MIMO Detection
7. Improved K-best sphere detection for uncoded and coded MIMO systems10.1109/WCL.2012.070312.120472 ↗
8. Algorithm and implementation of the K-best sphere decoding for MIMO detection10.1109/JSAC.2005.862402 ↗
9. A radius adaptive K-best decoder with early termination: Algorithm and VLSI architecture10.1109/TCSI.2010.2043017 ↗
10. A Semifixed Complexity Sphere Decoder for Uncoded Symbols for Wireless Communications
11. Geosphere: An Exact Depth-First, Sphere Decoder Architecture Scalable to Very Dense Constellations10.1109/ACCESS.2017.2684706 ↗
12. Sphere Decoding With a Probabilistic Tree Pruning10.1109/TSP.2008.923808 ↗
13. Sphere decoding algorithms with improved radius search10.1109/TCOMM.2005.851590 ↗
14. Weiliang, F., Yang, L., Zhijun, W., and Xinyu, M. (2014, January 23–25). A new dynamic K-best SD algorithm for MIMO detection. Proceedings of the 2014 International Conference on Wireless Communications and Signal Processing (WCSP), Hefei, China.