Title:
Multidisciplinary Discussion on 5G from the Viewpoint of Algebraic Combinatorics
Author:
Type:
Co-author(s) :
Subject:
Sahakyan Hasmik ; Kulhandjian Hovannes ; D’Amours Claude
Uncontrolled Keywords:
5G mobile communication ; computational complexity ; graph theory ; Matrix algebra ; optimisation ; polynomials
Abstract:
In this paper, we present some of the interesting questions raised in the “5G and Beyond” workshop discussions. We propose to explore alternative solutions in other discipline such as algebraic combinatorics and discrete optimization. Construction of matrices that possess certain desirable properties in discrete tomography can be exploited for the 5th generation (5G) multiuser waveform design. Moreover, we propose to investigate thoroughly the random graph theory developed by Erdös and A. Rényi for 5G multiuser waveform design. Furthermore, we explore using the “Best Match” algorithm, which has a polynomial time complexity, in 5G communications.
Publisher:
DOI:
10.1109/CSITechnol.2019.8895166
ISBN:
Other identifier:
Language:
URL:
Affiliation:
School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, K1N 6N5, Canada ; Institute for Informatics and Automation Problems of NAS RA ; Department of Electrical and Computer Engineering, California State University
Country:
Time period:
Conference title:
2019 Computer Science and Information Technologies (CSIT)