Fast and efficient user pairing and power allocation algorithm for non-orthogonal multiple access in cellular networks

Jianhua He, Zuoyin Tang, Zhongzhi Che (Lead / Corresponding author)

    Research output: Contribution to journalArticlepeer-review

    19 Citations (Scopus)
    69 Downloads (Pure)

    Abstract

    Non-orthogonal multiple access (NOMA) is emerging as a promising multiple access technology for the fifth generation cellular networks to address the fast growing mobile data traffic. It applies superposition coding in transmitters, allowing simultaneous allocation of the same frequency resource to multiple intra-cell users. Successive interference cancellation is used at the receivers to cancel intra-cell interference. User pairing and power allocation (UPPA) is a key design aspect of NOMA. Existing UPPA algorithms are mainly based on exhaustive search method with extensive computation complexity, which can severely affect the NOMA performance. A fast proportional fairness (PF) scheduling based UPPA algorithm is proposed to address the problem. The novel idea is to form user pairs around the users with the highest PF metrics with pre-configured fixed power allocation. Systemlevel simulation results show that the proposed algorithm is significantly faster (seven times faster for the scenario with 20 users) with a negligible throughput loss than the existing exhaustive search algorithm.
    Original languageEnglish
    Pages (from-to)2065-2067
    Number of pages3
    JournalElectronics Letters
    Volume52
    Issue number25
    Early online date17 Nov 2016
    DOIs
    Publication statusPublished - 5 Dec 2016

    Keywords

    • Electrical and Electronic Engineering
    • cellular radio
    • radio transmitters
    • radiofrequency interference
    • search problems
    • telecommunication traffic

    Fingerprint Dive into the research topics of 'Fast and efficient user pairing and power allocation algorithm for non-orthogonal multiple access in cellular networks'. Together they form a unique fingerprint.

    Cite this