Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/5971
Title: | Low-Complexity Near-Optimal Iterative Sequential Detection for Uplink Massive MIMO Systems |
Authors: | Bhatia, Vimal |
Keywords: | Bit error rate;Communication channels (information theory);Computational complexity;MIMO systems;Polynomials;Jacobi iteration;Matrix inversions;Multiple input multiple output system;Near optimal detection;Neumann series;Newton iterations;Polynomial expansion;Sequential detection;Iterative methods |
Issue Date: | 2017 |
Publisher: | Institute of Electrical and Electronics Engineers Inc. |
Citation: | Mandloi, M., & Bhatia, V. (2017). Low-complexity near-optimal iterative sequential detection for uplink massive MIMO systems. IEEE Communications Letters, 21(3), 568-571. doi:10.1109/LCOMM.2016.2637366 |
Abstract: | A novel low-complexity iterative sequential detection algorithm is proposed for near-optimal detection in uplink massive multiple-input multiple-output systems. In every iteration of the proposed algorithm, symbol transmitted from each user is detected sequentially while nulling the interference from all the other users. In contrast with recently proposed methods such as polynomial expansion, dual band Newton iteration, and Jacobi iteration, the proposed algorithm performs superior in terms of precision and computational complexity, and achieves better performance when the number of users increases. Simulation results validate superiority of the proposed algorithm over the recently reported methods. © 1997-2012 IEEE. |
URI: | https://doi.org/10.1109/LCOMM.2016.2637366 https://dspace.iiti.ac.in/handle/123456789/5971 |
ISSN: | 1089-7798 |
Type of Material: | Journal Article |
Appears in Collections: | Department of Electrical Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: