2014
DOI: 10.1109/tit.2014.2314092
|View full text |Cite
|
Sign up to set email alerts
|

Base Station Cooperation With Feedback Optimization: A Large System Analysis

Abstract: In this paper, we study feedback optimization problems that maximize the users' signal to interference plus noise ratio (SINR) in a two-cell MIMO broadcast channel. Assuming the users learn their direct and interfering channels perfectly, they can feed back this information to the base stations (BSs) over the uplink channels. TheBSs then use the channel information to design their transmission scheme. Two types of feedback are considered: analog and digital. In the analog feedback case, the users send their un… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
27
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(27 citation statements)
references
References 46 publications
(90 reference statements)
0
27
0
Order By: Relevance
“…Actually, the advantage of using α * MCP againstα * MCP can be very obvious as well if some other network parameters are considered, e.g., β = 1. These observations indicate that the optimal values of α without secrecy considerations given by [24] are no longer optimal for the networks with secrecy considerations.…”
Section: ) Numerical Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Actually, the advantage of using α * MCP againstα * MCP can be very obvious as well if some other network parameters are considered, e.g., β = 1. These observations indicate that the optimal values of α without secrecy considerations given by [24] are no longer optimal for the networks with secrecy considerations.…”
Section: ) Numerical Resultsmentioning
confidence: 99%
“…Figure 4 plots the large-system secrecy rate per transmit antenna, R ∞ s /(2N ), versus . Specifically, we compare the performances for two different designs of α: 1) the optimal α that maximizes the large-system secrecy sum rate, i.e., α * MCP given by (26) for the MCP or α * CBf obtained by Algorithm 1 for the CBf and 2) the optimal α that maximizes the largesystem sum rate without secrecy considerations given by [24], i.e.,α * MCP for the MCP orα * CBf for the CBf. We find that the performance achieved by α * MCP or α * CBf is always better than that achieved byα * MCP orα * CBf .…”
Section: ) Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We should note that in evaluating R (i),∞ sum , we use {β j } allocation scheme in Lemma 3, β = i j=1 β j and also the stationary conditions in (19) and (20) to determine ρ andp respectively. The value for β M must satisfy (21) with ν M = 0 and η M = 0, i.e.,…”
Section: B Fractional Group Loadingmentioning
confidence: 99%
“…The analysis in this paper assumes perfect CSI at the BS even though this is hard to obtain in practical scenarios. The impact of imperfect CSI at the BS with RCI precoder has been investigated in some work, e.g., [18], [19] and [20]. The optimization problems considered in this paper together with imperfect CSI can be a subject for future investigation.…”
mentioning
confidence: 99%