Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/9999
Title: Deep Unfolded Sparse Refinement Network Based Detection in Uplink Massive MIMO
Authors: Datta, Arijit
Nema, Aneesh
Bhatia, Vimal
Issue Date: 2022
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Datta, A., Nema, A., & Bhatia, V. (2022). Deep unfolded sparse refinement network based detection in uplink massive MIMO. IEEE Transactions on Vehicular Technology, doi:10.1109/TVT.2022.3166399
Abstract: Massive multiple-input multiple-output (mMIMO) is a promising technique to realize the ever-increasing demand for high-speed data, quality of service (QoS), and energy efficiency for 5G and beyond wireless systems. However, the increased number of users in mMIMO systems significantly affects performance of the existing approximate matrix inversion based and matrix inversion less iterative symbol detection techniques. Conventional detection algorithms cannot learn the inter-relations of input-output parameters based on available data without having specific mathematical models of communication scenarios. Moreover, existing deep learning (DL) based symbol detection models lack in-network compression, resulting in large training time and high computational load while expected to be deployed in a low latency communication system. In this article, a sparse refinement architecture is proposed for symbol detection in uplink mMIMO. The proposed DL architecture requires less trainable parameters as compared to a conventional fully connected detection network and refines the estimated symbol vector in each layer. Convergence of the proposed symbol detection technique is analytically justified. An expression for the approximate upper bound on the BER is derived which is supported by simulations. The obtained results prove viability of the proposed symbol detection model as compared to the several existing state-of-the-art uplink mMIMO detection techniques, in terms of superior error performance and low computational complexity. IEEE
URI: https://dspace.iiti.ac.in/handle/123456789/9999
https://doi.org/10.1109/TVT.2022.3166399
ISSN: 1895-45
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: