Scaling laws for simple user selection algorithm in MIMO broadcast channels

M. Arif Khan

doi:10.1109/MTTW.2019.8897238

Scaling laws for simple user selection algorithm in MIMO broadcast channels

M. Arif Khan

Research output: Book chapter/Published conference paper › Conference paper › peer-review

1 Citation (Scopus)

Abstract

This paper discusses the scaling laws of sum capacity for simple user selection algorithm in MIMO broadcast channels. We present an efficient user selection algorithm, named as simple user selection algorithm (or just simple algorithm). This algorithm is based on the top N_I users selected from N_u total users in the system. The asymptotic behavior of throughput for MU-MIMO BC (Multi User MIMO Broadcast) system with simple algorithm is studied. It is shown that the upper bound on sum capacity remains unchanged as that of DPC (Dirty Paper Coding). The simple algorithm takes N_I largest power users, reducing the search subset for scheduling from N_u to N_I , while achieving the same upper bound. This is an important result in the large number of users regime (or devices for IoT scenario) where users try to get the scared communication resource. In the end, we showed that by reducing the search subset does not reduce the degrees of freedom in the system.

Original language	English
Title of host publication	Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019
Editors	Arturs Aboltins, Anna Litvinenko
Place of Publication	United States
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	76-81
Number of pages	6
ISBN (Electronic)	9781728144733
DOIs	https://doi.org/10.1109/MTTW.2019.8897238
Publication status	Published - 14 Nov 2019
Event	2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019 - Scientific Library of Riga Technical University, Riga, Latvia Duration: 01 Oct 2019 → 02 Oct 2019 http://mttw.org/ http://mttw.org/program.php (full program) https://ieeexplore.ieee.org/xpl/conhome/8891845/proceeding (proceedings)

Publication series

Name	Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019

Conference

Conference	2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019
Country/Territory	Latvia
City	Riga
Period	01/10/19 → 02/10/19
Internet address	http://mttw.org/ http://mttw.org/program.php (full program) https://ieeexplore.ieee.org/xpl/conhome/8891845/proceeding (proceedings)

Access to Document

10.1109/MTTW.2019.8897238

Cite this

Khan, M. A. (2019). Scaling laws for simple user selection algorithm in MIMO broadcast channels. In A. Aboltins, & A. Litvinenko (Eds.), Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019 (pp. 76-81). Article 8897238 (Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019). IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/MTTW.2019.8897238

Khan, M. Arif. / Scaling laws for simple user selection algorithm in MIMO broadcast channels. Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019. editor / Arturs Aboltins ; Anna Litvinenko. United States : IEEE, Institute of Electrical and Electronics Engineers, 2019. pp. 76-81 (Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019).

@inproceedings{bb93df857dbe49cbb99c4ede4833e5d6,

title = "Scaling laws for simple user selection algorithm in MIMO broadcast channels",

abstract = "This paper discusses the scaling laws of sum capacity for simple user selection algorithm in MIMO broadcast channels. We present an efficient user selection algorithm, named as simple user selection algorithm (or just simple algorithm). This algorithm is based on the top NI users selected from Nu total users in the system. The asymptotic behavior of throughput for MU-MIMO BC (Multi User MIMO Broadcast) system with simple algorithm is studied. It is shown that the upper bound on sum capacity remains unchanged as that of DPC (Dirty Paper Coding). The simple algorithm takes NI largest power users, reducing the search subset for scheduling from Nu to NI , while achieving the same upper bound. This is an important result in the large number of users regime (or devices for IoT scenario) where users try to get the scared communication resource. In the end, we showed that by reducing the search subset does not reduce the degrees of freedom in the system.",

keywords = "Broadcast Channel (BC), Conventional MIMO, Internet of Things (IoT), Massive MIMO, Scaling Laws, Sum-Capacity",

author = "Khan, {M. Arif}",

year = "2019",

month = nov,

day = "14",

doi = "10.1109/MTTW.2019.8897238",

language = "English",

series = "Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

pages = "76--81",

editor = "Arturs Aboltins and Anna Litvinenko",

booktitle = "Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019",

address = "United States",

note = "2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019 ; Conference date: 01-10-2019 Through 02-10-2019",

url = "http://mttw.org/, http://mttw.org/program.php, https://ieeexplore.ieee.org/xpl/conhome/8891845/proceeding",

}

Khan, MA 2019, Scaling laws for simple user selection algorithm in MIMO broadcast channels. in A Aboltins & A Litvinenko (eds), Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019., 8897238, Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019, IEEE, Institute of Electrical and Electronics Engineers, United States, pp. 76-81, 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019, Riga, Latvia, 01/10/19. https://doi.org/10.1109/MTTW.2019.8897238

Scaling laws for simple user selection algorithm in MIMO broadcast channels. / Khan, M. Arif.
Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019. ed. / Arturs Aboltins; Anna Litvinenko. United States: IEEE, Institute of Electrical and Electronics Engineers, 2019. p. 76-81 8897238 (Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019).

Research output: Book chapter/Published conference paper › Conference paper › peer-review

TY - GEN

T1 - Scaling laws for simple user selection algorithm in MIMO broadcast channels

AU - Khan, M. Arif

PY - 2019/11/14

Y1 - 2019/11/14

N2 - This paper discusses the scaling laws of sum capacity for simple user selection algorithm in MIMO broadcast channels. We present an efficient user selection algorithm, named as simple user selection algorithm (or just simple algorithm). This algorithm is based on the top NI users selected from Nu total users in the system. The asymptotic behavior of throughput for MU-MIMO BC (Multi User MIMO Broadcast) system with simple algorithm is studied. It is shown that the upper bound on sum capacity remains unchanged as that of DPC (Dirty Paper Coding). The simple algorithm takes NI largest power users, reducing the search subset for scheduling from Nu to NI , while achieving the same upper bound. This is an important result in the large number of users regime (or devices for IoT scenario) where users try to get the scared communication resource. In the end, we showed that by reducing the search subset does not reduce the degrees of freedom in the system.

AB - This paper discusses the scaling laws of sum capacity for simple user selection algorithm in MIMO broadcast channels. We present an efficient user selection algorithm, named as simple user selection algorithm (or just simple algorithm). This algorithm is based on the top NI users selected from Nu total users in the system. The asymptotic behavior of throughput for MU-MIMO BC (Multi User MIMO Broadcast) system with simple algorithm is studied. It is shown that the upper bound on sum capacity remains unchanged as that of DPC (Dirty Paper Coding). The simple algorithm takes NI largest power users, reducing the search subset for scheduling from Nu to NI , while achieving the same upper bound. This is an important result in the large number of users regime (or devices for IoT scenario) where users try to get the scared communication resource. In the end, we showed that by reducing the search subset does not reduce the degrees of freedom in the system.

KW - Broadcast Channel (BC)

KW - Conventional MIMO

KW - Internet of Things (IoT)

KW - Massive MIMO

KW - Scaling Laws

KW - Sum-Capacity

UR - http://www.scopus.com/inward/record.url?scp=85075632687&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85075632687&partnerID=8YFLogxK

U2 - 10.1109/MTTW.2019.8897238

DO - 10.1109/MTTW.2019.8897238

M3 - Conference paper

T3 - Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019

SP - 76

EP - 81

BT - Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019

A2 - Aboltins, Arturs

A2 - Litvinenko, Anna

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - United States

T2 - 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019

Y2 - 1 October 2019 through 2 October 2019

ER -

Khan MA. Scaling laws for simple user selection algorithm in MIMO broadcast channels. In Aboltins A, Litvinenko A, editors, Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019. United States: IEEE, Institute of Electrical and Electronics Engineers. 2019. p. 76-81. 8897238. (Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019). doi: 10.1109/MTTW.2019.8897238

Scaling laws for simple user selection algorithm in MIMO broadcast channels

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this