Show simple item record

dc.contributor.authorAlrashdi, Ayed
dc.contributor.authorKammoun, Abla
dc.contributor.authorMuqaibel, Ali H.
dc.contributor.authorAl-Naffouri, Tareq Y.
dc.date.accessioned2022-09-18T11:43:16Z
dc.date.available2022-09-18T11:43:16Z
dc.date.issued2022-09-15
dc.identifier.citationAlrashdi, A. M., Kammoun, A., Muqaibel, A. H., & Al-Naffouri, T. Y. (2022). Asymptotic Performance of Box-RLS Decoders under Imperfect CSI with Optimized Resource Allocation. IEEE Open Journal of the Communications Society, 1–1. https://doi.org/10.1109/ojcoms.2022.3206894
dc.identifier.issn2644-125X
dc.identifier.doi10.1109/ojcoms.2022.3206894
dc.identifier.urihttp://hdl.handle.net/10754/681574
dc.description.abstractThis paper considers the problem of symbol detection in massive multiple-input multiple-output (MIMO) wireless communication systems. We consider hard-thresholding preceded by two variants of the regularized least squares (RLS) decoder; namely the unconstrained RLS and the RLS with a box constraint, which is called Box-RLS. For all schemes, we focus on the evaluation of the mean squared error (MSE) and the symbol error probability (SEP) for M-ary pulse amplitude modulation (M-PAM) symbols transmitted over a massive MIMO system when the channel is estimated using linear minimum mean squared error (LMMSE) estimator. Under such circumstances, the channel estimation error is Gaussian which allows for the use of the convex Gaussian min-max theorem (CGMT) to derive asymptotic approximations for the MSE and SEP when the system dimensions and the coherence duration grow large with the same pace. The obtained expressions are then leveraged to derive the optimal power distribution between pilot and data under a total transmit energy constraint. In addition, we derive an asymptotic approximation of the goodput for all schemes which is then used to jointly optimize the number of training symbols and their associated power. Numerical results are presented to support the accuracy of the theoretical results.
dc.description.sponsorshipThis work was supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research under Award OSR-CRG2019-4041.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttps://ieeexplore.ieee.org/document/9893195/
dc.rightsArchived with thanks to IEEE Open Journal of the Communications Society under a Creative Commons license, details at: https://creativecommons.org/licenses/by/4.0/legalcode
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/legalcode
dc.titleAsymptotic Performance of Box-RLS Decoders under Imperfect CSI with Optimized Resource Allocation
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Science and Engineering (CEMSE) Division
dc.contributor.departmentElectrical and Computer Engineering Program
dc.identifier.journalIEEE Open Journal of the Communications Society
dc.eprint.versionPost-print
dc.contributor.institutionDepartment of Electrical Engineering, College of Engineering, University of Ha’il, Ha’il, Saudi Arabia
dc.contributor.institutionDepartment of Electrical Engineering, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
dc.identifier.pages1-1
kaust.personKammoun, Abla
kaust.personAl-Naffouri, Tareq Y.
kaust.grant.numberOSR-CRG2019-4041
refterms.dateFOA2022-09-18T11:44:04Z
kaust.acknowledged.supportUnitOffice of Sponsored Research


Files in this item

Thumbnail
Name:
Asymptotic_Performance_of_Box-RLS_Decoders_under_Imperfect_CSI_with_Optimized_Resource_Allocation.pdf
Size:
920.1Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record

Archived with thanks to IEEE Open Journal of the Communications Society under a Creative Commons license, details at: https://creativecommons.org/licenses/by/4.0/legalcode
Except where otherwise noted, this item's license is described as Archived with thanks to IEEE Open Journal of the Communications Society under a Creative Commons license, details at: https://creativecommons.org/licenses/by/4.0/legalcode