Computer Science > Information Theory
[Submitted on 23 May 2018]
Title:Asymptotic Performance Analysis of GSVD-NOMA Systems with a Large-Scale Antenna Array
View PDFAbstract:This paper considers a multiple-input multiple-output (MIMO) downlink communication scenario with one base station and two users, where each user is equipped with m antennas and the base station is equipped with n antennas. To efficiently exploit the spectrum resources, we propose a transmission protocol which combines generalized singular value decomposition (GSVD) and non-orthogonal multiple access (NOMA). The average data rates achieved by the two users are adopted as performance metrics for evaluation of the proposed GSVD-NOMA scheme. In particular, we first characterize the limiting distribution of the squared generalized singular values of the two users' channel matrices for the asymptotic case where the numbers of transmit and receive antennas approach infinity. Then, we calculate the normalized average individual rates of the users in the considered asymptotic regime. Furthermore, we extend the proposed GSVD-NOMA scheme to the MIMO downlink communication scenario with more than two users by using a hybrid multiple access (MA) approach, where the base station first divides the users into different groups, then the proposed GSVD-NOMA scheme is implemented within each group, and different groups are allocated with orthogonal bandwidth resources. Finally, numerical results are provided to validate the effectiveness of the proposed GSVD-NOMA protocol, and the accuracy of the developed analytical results.
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.