A Blind Antenna Selection Scheme for Single-Cell Uplink Massive MIMO

Handle URI:
http://hdl.handle.net/10754/623775
Title:
A Blind Antenna Selection Scheme for Single-Cell Uplink Massive MIMO
Authors:
Elkhalil, Khalil ( 0000-0001-7656-3246 ) ; Kammoun, Abla ( 0000-0002-0195-3159 ) ; Al-Naffouri, Tareq Y. ( 0000-0003-2843-5084 ) ; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
This paper considers the uplink of a single-cell large-scale multiple-input multiple output (MIMO) system in which m mono-antenna users communicate with a base station (BS) outfitted by n antennas. We assume that the number of antennas at the BS and that of users take large values, as envisioned by large-scale MIMO systems. This allows for high spectral efficiency gains but obviously comes at the cost of higher complexity, a fact that becomes all the more critical as the number of antennas grows large. To solve this issue is to choose a subset of the available n antennas. The subset must be carefully chosen to achieve the best performance. However, finding the optimal subset of antennas is usually a difficult task, requiring one to solve a high dimensional combinatorial optimization problem. In this paper, we approach this problem in two ways. The first one consists in solving a convex relaxation of the problem using standard convex optimization tools. The second technique solves the problem using a greedy approach. The main advantages of the greedy approach lies in its wider scope, in that, unlike the first approach, it can be applied irrespective of the considered performance criterion. As an outcome of this feature, we show that the greedy approach can be applied even when only the channel statistics are available at the BS, which provides blind way to perform antenna selection.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Elkhalil K, Kammoun A, Al-Naffouri TY, Alouini M-S (2016) A Blind Antenna Selection Scheme for Single-Cell Uplink Massive MIMO. 2016 IEEE Globecom Workshops (GC Wkshps). Available: http://dx.doi.org/10.1109/GLOCOMW.2016.7848801.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2016 IEEE Globecom Workshops (GC Wkshps)
Conference/Event name:
2016 IEEE Globecom Workshops, GC Wkshps 2016
Issue Date:
9-Feb-2017
DOI:
10.1109/GLOCOMW.2016.7848801
Type:
Conference Paper
Sponsors:
This work was supported by the King Abdulaziz City of Science and Technology (KACST) under Grant AT-34-345.
Additional Links:
http://ieeexplore.ieee.org/document/7848801/
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorElkhalil, Khalilen
dc.contributor.authorKammoun, Ablaen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2017-05-31T11:23:04Z-
dc.date.available2017-05-31T11:23:04Z-
dc.date.issued2017-02-09en
dc.identifier.citationElkhalil K, Kammoun A, Al-Naffouri TY, Alouini M-S (2016) A Blind Antenna Selection Scheme for Single-Cell Uplink Massive MIMO. 2016 IEEE Globecom Workshops (GC Wkshps). Available: http://dx.doi.org/10.1109/GLOCOMW.2016.7848801.en
dc.identifier.doi10.1109/GLOCOMW.2016.7848801en
dc.identifier.urihttp://hdl.handle.net/10754/623775-
dc.description.abstractThis paper considers the uplink of a single-cell large-scale multiple-input multiple output (MIMO) system in which m mono-antenna users communicate with a base station (BS) outfitted by n antennas. We assume that the number of antennas at the BS and that of users take large values, as envisioned by large-scale MIMO systems. This allows for high spectral efficiency gains but obviously comes at the cost of higher complexity, a fact that becomes all the more critical as the number of antennas grows large. To solve this issue is to choose a subset of the available n antennas. The subset must be carefully chosen to achieve the best performance. However, finding the optimal subset of antennas is usually a difficult task, requiring one to solve a high dimensional combinatorial optimization problem. In this paper, we approach this problem in two ways. The first one consists in solving a convex relaxation of the problem using standard convex optimization tools. The second technique solves the problem using a greedy approach. The main advantages of the greedy approach lies in its wider scope, in that, unlike the first approach, it can be applied irrespective of the considered performance criterion. As an outcome of this feature, we show that the greedy approach can be applied even when only the channel statistics are available at the BS, which provides blind way to perform antenna selection.en
dc.description.sponsorshipThis work was supported by the King Abdulaziz City of Science and Technology (KACST) under Grant AT-34-345.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/document/7848801/en
dc.subjectMIMO communicationen
dc.subjectantenna arraysen
dc.subjectcellular radioen
dc.subjectcombinatorial mathematicsen
dc.subjectconvex programmingen
dc.subjectgreedy algorithmsen
dc.subjectstatistical analysisen
dc.subjectwireless channelsen
dc.subjectComplexity theoryen
dc.subjectGreedy algorithmsen
dc.subjectMIMOen
dc.subjectMeasurementen
dc.subjectReceiving antennasen
dc.subjectUplinken
dc.titleA Blind Antenna Selection Scheme for Single-Cell Uplink Massive MIMOen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journal2016 IEEE Globecom Workshops (GC Wkshps)en
dc.conference.date2016-12-04 to 2016-12-08en
dc.conference.name2016 IEEE Globecom Workshops, GC Wkshps 2016en
dc.conference.locationWashington, DC, USAen
kaust.authorElkhalil, Khalilen
kaust.authorKammoun, Ablaen
kaust.authorAl-Naffouri, Tareq Y.en
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.