2016
DOI: 10.1109/jsac.2016.2605238
|View full text |Cite
|
Sign up to set email alerts
|

A Full-Space Spectrum-Sharing Strategy for Massive MIMO Cognitive Radio Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
66
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
4
3
3

Relationship

2
8

Authors

Journals

citations
Cited by 172 publications
(67 citation statements)
references
References 36 publications
1
66
0
Order By: Relevance
“…Nevertheless, the advantage of ADMA is drawn from the frequency insensitivity of the angular parameters, i.e., even if the frequency changes (uplink and downlink in FDD systems), the multiusers access designed from ADMA is still applicable. Moreover, the ADMA would link the users' transmission with their individual locations such that many geometric theories could be utilized to design the multi-user scheduling, even for multiple BS stations or the cell-free case [48]. An example that adopts two BS and geometric theory to eliminate the blockage problem is shown in Fig.…”
Section: A Angle Division Multiple Access (Adma)mentioning
confidence: 99%
“…Nevertheless, the advantage of ADMA is drawn from the frequency insensitivity of the angular parameters, i.e., even if the frequency changes (uplink and downlink in FDD systems), the multiusers access designed from ADMA is still applicable. Moreover, the ADMA would link the users' transmission with their individual locations such that many geometric theories could be utilized to design the multi-user scheduling, even for multiple BS stations or the cell-free case [48]. An example that adopts two BS and geometric theory to eliminate the blockage problem is shown in Fig.…”
Section: A Angle Division Multiple Access (Adma)mentioning
confidence: 99%
“…For ease of derivation, we assume that the channel at each delay shares the same uniform incident AoA set as in [24], i.e., the AoA associated to the pth subpath of the lth delay is θ l,p = 2π p P for p = 1, 2, · · ·, P . By denoting θ p = θ l,p , l = 1, 2, · · ·, L and ϕ p = f d cos θ p + ξ, the received pilot signal (15) can be re-expressed as (16) where h p = L l=1 h (θ l,p ) is an L×1 vector whose lth element is g l,p and α (ε) is simplified as α for conciseness. Irrespective of the inter-subarray mismatches, we still adopt the joint estimation algorithm in Section III-B to estimate the CFO.…”
Section: A Mse Performance Analysis Of the Joint Estimation Algorithmentioning
confidence: 99%
“…2) Phase I (Steps [6][7][8][9][10][11][12][13][14][15][16]: This phase consists of initially selecting the uncolored clusters ∈ , forming independent sets and assigning them to patterns, till the first cluster that cannot join any independent set formed in any color, the algorithm then proceeds to Phase II. Interestingly, Phase I is an unweightededge graph coloring algorithm, which exploits the common case of sparse graphs scenarios that can be colored with ( ) = 0 without violating the color constraint, in which case all clusters are colored by Phase I algorithm, and Phase II is bypassed.…”
Section: Graph Coloringmentioning
confidence: 99%