Design and Implementation of An Improved K-Best Detection Algorithm

0Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In MIMO system, with high modulation order and large number of antennas, the complexity of the traditional K-Best detection algorithm is still high. For solving this problem, the theory of the inter-layer reservation in the algorithm is further extended, and propose a new child node expansion strategy which is based on Euclidean distance sorting. By reducing the access nodes, get a low-complexity improved algorithm.Considering the performance of the algorithm, a fast sorting QR decomposition based on SINR is introduced for the pre-detection preprocessing. The simulation proves that the improved algorithm performs well while reducing the complexity.Then design a parallel pipeline of the detector which is implemented by Xilinx XC7Z045 FPGA.The results show that this scheme performs well and has less hardware resource consumption. Now it has been applied to the LTE-A air interface monitoring instrument project.

Cite

CITATION STYLE

APA

Zhu, J., Xi, B., & Zhang, Z. (2019). Design and Implementation of An Improved K-Best Detection Algorithm. In IOP Conference Series: Materials Science and Engineering (Vol. 490). Institute of Physics Publishing. https://doi.org/10.1088/1757-899X/490/7/072017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free