Flexible pilot allocation scheme for massive MIMO two‐tier heterogeneous networks

Zhi, Hui; Huang, Ziju; Wang, Fei‐Yue

doi:10.1049/iet-com.2018.5951

Cited by 3 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lines 3-5 calculate users' susceptibility to interference as Equations (17) and (18). Lines 6-13 separate all users into either the edge group or centre group according to the rule seen in Equation (19), and according to the results of grouping, assign the extra pilot resources for each edge users. Lines 14-18 evaluate the potential strength of pilot contamination for all centre users according to Equation (20).…”

Section: Proposed Fpr-mkc Schemementioning

confidence: 99%

“…Many publications tried to find a low complexity strategy for a reasonable allocation of limited orthogonal pilot sequences and minimize system pilot contamination as much as possible. The pilot assignment optimization is essentially a combinational optimization issue, and consequently, many proposed combined‐optimization‐algorithm‐based pilot schemes have been proved significant gains, such as a smart pilot assignment [18] and a coalitional game‐based pilot allocation algorithm [19]. Especially, inspired by the graph theory, the graph‐colouring‐based pilot allocation (GCPA) scheme [20] and weighted‐graph‐colouring‐based (WGC) pilot scheme [21] brought novel enlightenment to solve the PC problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fractional pilot reuse and max k‐cut based pilot decontamination scheme for multi‐cell TDD massive MIMO systems

Zeng

et al. 2021

IET Communications

View full text Add to dashboard Cite

In multi-cell massive multiple-input multiple-output (MIMO) cellular networks, pilot contamination (PC) caused by ineluctable pilot reuse severely restricts the system performance in the effectiveness and reliability of transmission. To deal with this problem, an efficient pilot assignment scheme based on fractional pilot reuse and max k-cut (FPR-MKC) is therefore proposed in this study. Specifically, first, the measure of susceptibility to interference for each user is designed, and based on this, an innovative boundary is determined for properly selecting the edge users who could employ the unique pilot sequences. Subsequently, the process of allocating reused pilots is innovatively treated as the partition of the vertices of a graph. Building on this idea, an edge-weighted undirected graph is constructed to present the potential interference intensity among users, and eventually, the max k-cut (MKC) strategy is executed, which aims to partition centre users into a desired number of mutually exclusive subsets with maximizing the total weight of the edges between the disjoint subsets. Compared with some existing pilot assignment schemes, the proposed FPR-MKC scheme can adequately mitigate the PC with significantly enhanced quality of service for edge users, which is verified by theoretical analysis and numerical simulation results. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract