King's College London

Research portal

Pattern Division for Massive MIMO Networks with Two-stage Precoding

Research output: Contribution to journalArticle

Jianpeng Ma, Shun Zhang, Hongyan Li, Nan Zhao, Arumugam Nallanathan

Original languageEnglish
Pages (from-to)1665 - 1668
JournalIEEE COMMUNICATIONS LETTERS
Volume21
DOIs
Publication statusPublished - 27 Mar 2017

Documents

  • Pattern Division for Massive_MA_Published27March2017_GREEN AAM (non-CC)

    Nan_CL.pdf, 2 MB, application/pdf

    3/07/2017

    Accepted author manuscript

    Other

    (c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

King's Authors

Abstract

In massive multiple-input multiple-output (MIMO) networks with two-stage precoding, the user clusters with serious angle-spreading-range (ASR) overlapping should be divided into different patterns and scheduled in orthogonal sub-channels to achieve optimal performance. In this letter, we propose one graph theory based pattern division (GT-PD) scheme to deal with the ASR overlapping with a limited number of sub-channels. First, we depict the ASR overlapping as an undirected weighted graph, where the weight of each edge indicates the strength of the ASR overlapping between two connected clusters. Then, we separately denote each user cluster and pattern as a vertex and a color, and transform the pattern division into a graph coloring problem with limited colors. In addition, the GT-PD scheme is developed with the help of the Dsatur algorithm. Finally, numerical results are provided to corroborate the efficiency of the proposed scheme.

Download statistics

No data available

View graph of relations

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454