Nash Bargaining in Beamforming Games with Quantized CSI in Two-user Interference Channels
|
|
- Georgia Dorsey
- 5 years ago
- Views:
Transcription
1 Nash Bargaining in Beamforming Games with Quantized CSI in Two-user Interference Channels Jung Hoon Lee and Huaiyu Dai Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA Abstract In this paper, we consider a beamforming game of the transmitters in a two-user multiple-input single-output interference channel using limited feedback and investigate how each transmitter should find a strategy from the quantized channel state information CSI. In the beamforming game, each transmitter a player tries to maximize the achievable rate a payoff function via a proper beamforming strategy. In our case, each transmitter s beamforming strategy is represented by a linear combining factor between the maximum-ratio transmission MRT and the zero-forcing ZF beamforming vectors, which is shown to be a Pareto optimal achieving strategy. With the perfect CSI, each transmitter can know the exact achievable rate region, and hence can find the beamforming strategy corresponding to any point in the achievable rate region. With limited feedback, however, the transmitters can only conjecture the achievable rate region from the quantized CSI, so their optimal strategies may not be optimal anymore. Considering the quantized CSI at the transmitter, we first find the Nash equilibrium in a noncooperative game. Then, in a cooperative Nash bargaining game, we find a Nash bargaining solution and test its validity. Finally, we propose three bargaining solutions that improve the validity of the cooperation or the average Nash product. Our proposed bargaining solutions utilize the codebook structure; instead of each quantized channel itself, its Voronoi region is considered. Index Terms Beamforming, Nash bargaining, limited feedback, multiple-input single-output, interference channels I. INTRODUCTION Game theory is a mathematical branch to analyze strategic decision makings of multiple players when their interests conflict [1. Game theory is initially used in economics, but now widely adopted in many research fields including political science, biology, and computer science. There have been many efforts to analyze the wireless communication systems with a game theoretic approach when the multiple transmitters operate in the same spectrum band. In this case, three components of a game players, their payoffs or utilities, and a set of strategies generally can be modeled with transmitters, their achievable rates, and a set of transmission strategies, while there can be various strategy sets for different scenarios. Many problems have been modeled with the game theory for wireless communication systems including a beamforming design [2 [4, a resource allocation [5, [6, and security [7. The performance of a wireless system can be improved by adapting to the channel conditions, which requires the channel state information at the transmitter CSIT. Contrary to time division duplexing systems, where a transmitter can directly estimate the channel to the receiver thanks to the reciprocity between the uplink and the downlink channels, many practical systems are frequency division duplexing systems whose uplink and downlink channels are independent of each other. In such systems, the transmitters are generally aided by their receivers; the quantized CSI at each receiver is conveyed to the corresponding transmitter via the feedback link. There have been many studies on increasing the spectral efficiencies using the quantized CSIT for various system models including pointto-point multiple-input multiple-output MIMO channels [8 and multi-user MIMO channels [9, [10. When only the quantized CSI is available at transmitters, their games will be based on the imprecise information. With quantized CSI, each transmitter or each player cannot know the exact achievable rate or the payoff function. Moreover, the strategies derived from the quantized CSI may not be valid. Although the quantized CSIT is quite general in wireless communication systems, the transmitters games based on the quantized CSI are not fully investigated. In this context, it is important to see how the quantized CSI affects a game among the transmitters and how the transmitters can modify their strategies from the quantized CSI. In this paper, we study a beamforming game of the transmitters in two-user multiple-input single-output MISO interference channels ICs when the transmitters utilize the quantized CSIT. Each receiver sends B-bit feedback for each channel direction to its belonging transmitter via a limited feedback link, and the transmitters share the quantized information with each other. For beamforming, each transmitter linearly combines the maximum ratio transmission MRT and the zero-forcing ZF beamforming vectors as it was shown to be Pareto optimal in a perfect CSIT case [11. Thus, the linear combining factor for beamforming, which is a scalar value, becomes each transmitter s strategy. In the same system model, the beamforming game with the perfect CSIT was investigated in [2. Also, the beamforming game with the partial but perfect CSI was investigated in [3, [4; at each transmitter, [3 assumed perfect knowledge of channel covariance matrices, and [4 assumed perfect knowledge of the channels of partial links. Contrary to these papers, we consider the beamforming game based on the quantized CSI and focus on the improvement of a strategy using the codebook structure.
2 TX 1 Quantized CSI Sharing TX 2 Quantized CSI Quantized CSI h 11 h 22 Fig. 1. System model. h 21 h 12 RX 1 RX 2 Contributions: With the quantized CSIT, we firstly find a Nash equilibrium in a non-cooperative game and a Nash bargaining solution in a non-cooperative game. Next, we show that the Nash bargaining solutions based on the quantized CSI may not be valid 1 because of the quantization error. In this case, it is obvious that the validity depends on the precision of the quantized CSI, i.e., the feedback size. Then, we propose three modified bargaining solutions that improve the valid probability or Nash product. Our proposed solutions utilize the structure of the quantization codebook; the Voronoi regions of a codebook are used to derive the solutions instead of their representatives i.e., codewords. A. System Model II. PROBLEM FORMULATION Our system model is depicted in Fig. 1. We consider a two-user MISO IC, where each of two transmitters having M antennas supports its own single-antenna receiver. For integers i, j {1, 2} such that i j, the received signal at the receiver i denoted by y i C 1 1 is given by y i = h ii x i + h ji x j + n i, 1 where h ij C M 1 is the vector channel from the ith transmitter to the jth receiver, x i C M 1 is the transmitted signal at the ith transmitter, and n i C 1 1 is complex Gaussian noise at the ith receiver with zero mean and unit variance, i.e., n i CN0, 1. Thus, in 1, the terms h ii x i and h ji x j are the desired and the interference signals at the receiver i, respectively. We consider a linear beamforming at each transmitter; the transmitted signal at the ith transmitter, i.e., x i, is constructed by x i = v i s i, where v i C M 1 is the transmitter i s beamforming vector such that v i 2 =1.Also,s i C 1 1 is the transmitted symbol for its own receiver such that E[ s i 2 =P i, where P i is the transmitter i s transmit power such that P i P max with P max the maximum transmit power. 1 In this paper, the bargaining solution is said to be valid if it increases all transmitters achievable rates comparing to the non-cooperative case. B. CSI at the Transmitter Since perfect CSIT is not available in many practical systems, we consider a feedback link with limited capacity between each transmitter and its own receiver. We assume that each receiver can perfectly estimate the desired channel as well as the interfering channel. To facilitate our discussion and without loss of generality, we assume that only the feedback budget for each channel directional information CDI is limited to B bits, while each channel gain can be perfectly delivered to the transmitter. This assumption is based on the fact that the acquisition of a channel gain which is a single scalar value is much easier than that of a channel direction which is a complex vector in limited feedback systems [12. Extension to include the effect of the quantized channel gain feedback is straightforward and left to future work. For all i, j {1, 2}, the receiver j quantizes the channel direction of h ij into ĥij as follows: ĥ ij q ij h ij = arg max w hij 2, 2 w W ij where denotes the normalization of a vector, i.e., hij = h ij / h ij. Also, q ij : C M 1 W ij is a B-bit vector quantizer using a codebook W ij C M 1 that consists of 2 B unit-norm vectors. In this case, the channel direction h ij can be expressed by h ij = 1 Z ij ĥ ij + Z ij e ij, where Z ij [0, 1 is the CDI quantization error defined as Z ij sin 2 [ h ij, ĥij, and e ij C M 1 is a unit-norm vector such that e ij ĥij. Thus, after feedback, the transmitter j has the information of h 1j ĥ1j and h 2j ĥ2j, and then with information sharing, each transmitter can know the quantized CSI of all links, which are h ij ĥij for all i, j {1, 2}. C. Beamforming Design at Each Transmitter In a two-user MISO IC, it was already shown in [11 that any point on the Pareto boundary of the achievable rate region can be obtained by a beamforming vector that is a linear combination of MRT and ZF beamforming vectors. Thus, we focus our attention to this class of beamforming schemes for both transmitters. With perfect CSIT, the first transmitter s beamforming vector takes the following form: v1η 1 = 1 η 1v1 MRT + η 1 v1 ZF 3 1 η 1 v1 MRT + η 1 v1 ZF, where η 1 [0, 1 is a linear combining factor for the first transmitter, and v1 MRT C M 1 is the ideal MRT beamforming vector given by v1 MRT h 11.Also,v1 ZF C M 1 is the ZF beamforming vector given by v1 ZF I M
3 h 12 h 12 h / IM 11 h 12 h 12 h 11. Similarly, we can represent the second transmitter s beamforming vector as v2η 2 = 1 η 2v2 MRT + η 2 v2 ZF 4 1 η 2 v2 MRT + η 2 v2 ZF, where η 2 [0, 1 is a linear combining factor for the second transmitter, and the vectors v2 MRT C M 1 and v2 ZF C M 1 are ideal MRT and ZF beamforming vectors for the second transmitter, respectively. With quantized CSI, however, the transmitters cannot find the accurate MRT and ZF beamforming vectors i.e., 3 and 4 because of the CDI quantization errors. For i, j {1, 2} such that i j, the transmitter i s MRT and ZF beamforming vectors obtained from the quantized CSI are given by v q-mrt i ĥ ii and v q-zf i / I M ĥijĥ ijĥii IM ĥijĥ ijĥii,respectively. Therefore, the transmitter i s beamforming vector based on the quantized CSI becomes 1 η iv q-mrt i 1 η i v q-mrt i + η i v q-zf i + η i v q-zf v q i η i= i. 5 D. Achievable Rate and Beamforming Game Obviously, the achievable rate at each receiver depends on the beamforming vectors of both transmitters. We can interpret the linear combining factor η 1 [0, 1 as the first transmitter s beamforming strategy and η 2 [0, 1 as the second transmitter s beamforming strategy. With perfect CSIT, for i, j {1, 2} such that i j, the transmitter i s achievable rate corresponding to the beamforming strategy profile η 1,η 2 becomes R i η 1,η 2,P 1,P 2 log 2 1+ P i h ii v i η i 2 1+P j h ji v j η j 2. 6 With imperfect CSIT, on the other hand, the corresponding rate becomes R i η 1,η 2,P 1,P 2 log 2 1+ P i h ii vq i η i 2 1+P j h ji vq j η. 7 j 2 In this paper, we consider the beamforming game between the two transmitters when they have only quantized CSI, and investigate how they can modify their strategy via cooperation. III. THREE ACHIEVABLE RATE REGIONS In this section, we define the three achievable rate regions in the limited feedback scenarios, which are 1 achievable rate region with perfect CSIT, 2 achievable rate region with imperfect CSIT, and 3 conjectured achievable rate region with imperfect CSIT. 2 2 As in [11, time sharing transmission and joint decoding at the receivers are not considered in this work for simplicity, so achievable rate regions presented below may not be convex. A. Achievable Rate regions with perfect and imperfect CSIT With perfect CSI, the transmitters exactly know the achievable rate pair for any given beamforming strategy profile and power allocations so that can determine the accurate achievable rate region. For a given set of the channels {h ij i, j {1, 2}}, the achievable rate region obtained from the perfect CSI denoted by R is defined as R { R 1 η 1,η 2,P 1,P 2, R 2η 1,η 2,P 1,P 2 }, 8 P 1,P 2 [0,P where R i η 1,η 2,P 1,P 2 is defined in 6. When the transmitters exploit the quantized CSI for beamforming designs, however, not all points in 8 are achievable because each transmitter s beamforming vector is calculated from the quantized information. The achievable rate region with the quantized CSIT denoted by R is given by R { R1 η 1,η 2,P 1,P 2, R 2 η 1,η 2,P 1,P 2 }, 9 P 1,P 2 [0,P where R i η 1,η 2,P 1,P 2 is defined in 7. B. Conjectured achievable rate region at the transmitters with imperfect CSIT Although the achievable rate regions with perfect CSIT and imperfect CSIT are defined in 8 and 9, respectively, calculations of them still require the perfect knowledge of {h 11, h 12, h 21, h 22 }. Thus, the transmitters with only the quantized CSI actually cannot determine 8 and 9. Instead, the transmitters can conjecture the achievable rate region by regarding the quantized CSIT as the perfect one. For all i, j {1, 2}, each transmitter can substitute the quantized channel h ij ĥij for the perfect one h ij = h ij h ij in 7 to find the achievable rates corresponding to each beamforming strategy profile η 1,η 2. Let ˆR be the conjectured achievable rate region at each transmitter using the quantized CSI in place of the perfect CSI. Then, it is defined as ˆR { ˆR1 η 1,η 2,P 1,P 2, ˆR 2 η 1,η 2,P 1,P 2 }, 10 P 1,P 2 [0,P where for all i, j {1, 2} such that i j, the term ˆR i η 1,η 2,P 1,P 2 is the conjectured achievable rate of the transmitter i given by ˆR i η 1,η 2,P 1,P 2 log 2 1+ P i h ii 2 ĥ ii vq i η i 2 1+P j h ji 2 ĥ ji vq j η. 11 j 2 Note that as the feedback size increases i.e., B, three achievable rate regions converge, i.e., lim R = lim ˆR = B B R.
4 IV. NON-COOPERATIVE COMPETITIVE GAME First, we consider a non-cooperative competitive game between the transmitters, where each transmitter becomes a player, and the transmitter i s strategy and utility function are given by η i and 11, respectively. In a non-cooperative game, the transmitters are rational but selfish, so each transmitter tries to maximize its achievable rate ignoring the other transmitter. Generally, the solution of the non-cooperative game is obtained at a Nash equilibrium whose definition is as follows: Definition 1 Nash equilibrium. A Nash equilibrium is a strategy profile at which no player has an incentive to deviate when the other players strategies are given. In our case, the strategy profile η1 NE such that η1 NE [0, 1 with the power allocation P1 NE,P2 NE such that P1 NE,P2 NE [0,P max is a Nash equilibrium if it satisfies the following two conditions: 1 ˆR1 η1 NE,P1 NE,P2 NE ˆR 1 η 1,P 1,P2 NE for all η 1 [0, 1 and P 1 [0,P max. 2 ˆR2 η1 NE,P1 NE,P2 NE ˆR 2 η1 NE,η 2,P1 NE,P 2 for all η 2 [0, 1 and P 2 [0,P max. The Nash equilibrium is obtained in the next theorem. Theorem 1. For the above game, there exists a unique purestrategy Nash equilibrium, where the corresponding strategy profile is η1 NE =0, 0 with full power transmission, i.e., P 1 = P 2 = P max, invariant with the quantization bits, i.e., B. Proof. Since our system model is symmetric, it is enough to show that η1 NE =0and P 1 = P, i.e., ˆR1 0,η 2,P,P 2 ˆR 1 η 1,η 2,P 1,P 2 for all η 1,η 2 [0, 1 and for all P 1,P 2 [0,P. With the quantized CSI, the transmitters believe their information is real regardless of the feedback sizes, and hence use the conjectured achievable rate 11. We recall 11: ˆR 1 η 1,η 2,P 1,P 2 log 2 1+ P 1 h 11 2 ĥ 11 vq 1 η P 2 h 21 2 ĥ 21 vq 2 η. 2 2 In the numerator in the logarithm function, we have P 1 ĥ 11 vq 1 η 1 2 P, where the equality holds when P 1 = P and v q 1 η 1=ĥ11= v q-mrt 1, which corresponds to η 1 =0. Thus, for an arbitrary given strategy of the second transmitter, i.e., for an arbitrary given η 2 [0, 1 and P 2 [0,P, it is easy to show that ˆR 1 0,η 2,P,P 2 ˆR 1 η 1,η 2,P 1,P 2 η 1 [0,1 P 1 [0,P, which implies that η1 NE =0. Similarly, we can prove that η2 NE = 0. Thus, we obtain the unique Nash equilibrium η1 NE = 0,0. V. COOPERATIVE NASH BARGAINING GAME In this section, we consider a cooperative game with the same setting of the non-cooperative game. It is obvious that each transmitter can achieve a higher rate via cooperation. From the bargaining, the transmitters can reach a Nash bargaining strategy η1 NB,η2 NB that results in rate increase in both. 3 Since the transmitters already know that at least they can achieve the Nash equilibrium via non-cooperation, if the achievable rate at a transmitter with bargaining is smaller than what is obtained at the Nash equilibrium, the cooperation bargaining fails, and the transmitters return to the non-cooperative Nash equilibrium, termed the disagreement point. It was shown in [2 that the Nash bargaining point is on the Pareto boundary of the achievable rate region and obtained with full power transmission at each transmitter, i.e., P 1 = P 2 = P max. For notational simplicity, we will use Rη 1,η 2 in place of Rη 1,η 2,P max,p max in the following discussion. A. Nash Bargaining solution from perfect CSIT With the perfect CSIT, each transmitter knows the achievable rate region R given in 8. Let η1 NB,η2 NB be the strategy profile for the Nash bargaining solution obtained from perfect CSIT. Then, the transmitter can find the optimal strategy profile η1 NB,η2 NB as follows: 2 [ η1 NB,η2 NB arg max R i η 1,η 2 R i η1 NE, η 1,η 2 i=1 where η1 NE =0, 0 as shown in Theorem 1. B. Nash Bargaining solution from quantized CSIT itself and its validity When each transmitter only has the quantized CSI, the Nash bargaining solution should be found in the conjectured achievable rate region ˆR defined in 10. Denoting the Nash bargaining solution found with quantized CSI by ˆη 1 NB, ˆη 2 NB, we obtain 2 [ ˆη 1 NB, ˆη 2 NB arg max ˆRi η 1,η 2 ˆR i η1 NE, 12 η 1,η 2 i=1 where η1 NE =0, 0 as shown in Theorem 1. Although each transmitter can find the Nash bargaining solution from the conjectured rate region ˆR, it may not be valid. Obviously, the solution found in 12 ensures that ˆR i ˆη 1 NB, ˆη 2 NB ˆR i η1 NE i {1, 2}, 13 but the transmitter i s real achievable rate is R i ˆη 1 NB, ˆη 2 NB, not ˆR i ˆη 1 NB, ˆη 2 NB. Therefore, the Nash bargaining solution obtained from the quantized CSI does not guarantee both transmitters rate increments, i.e., the solution 12 does not guarantee that R i ˆη 1 NB, ˆη 2 NB R i η1 NE i {1, 2}. 14 Thus, exploiting the quantized CSI may decrease the incentive for cooperation, and we need modified bargaining solutions for limited environment. In the next subsection, we endeavor to improve the Nash bargaining solutions given in The product of all players excess utilities via cooperation is generally referred to as the Nash product, and the Nash bargaining solution maximizes it.
5 C. Modified Bargaining Solutions from Quantized CSI We can modify the Nash bargaining solution given in 12 by considering the effect of the quantization errors. Although the transmitters do not know the exact channels, they can estimate the channel space containing the exact channels. With a B-bit CDI codebook, we have 2 B Voronoi regions, each of which is represented by a codeword. From the quantization procedure i.e., 2, each transmitter knows the Voronoi regions H ij C M 1 for all i, j {1, 2} such that h ij H ij, which is given by H ij = { h C M 1 h = hij, q ij h ij =ĥij}. We propose three modified bargaining solutions based on the Voronoi regions of the quantized channels. 1 Bargaining solution based on averaged achievable rate region Solution 1: The first modified bargaining solution considers the average quantization effect, so each transmitter utilizes the achievable rate region averaged over the Voronoi regions that contain the quantized channels given by R { R1 η 1,η 2, R 2 η 1,η 2 η 1,η 2 [0, 1 }, 15 where [ R 1 η 1,η 2 E h R1 η 1,η 2 h11 H 11, h 21 H [ R 2 η 1,η 2 E h R2 η 1,η 2 h 22 H 22, h 12 H Thus, each transmitter finds the strategy profile denoted by η NB1 1, η NB1 2 from the averaged rate region as follows: η NB1 1, η NB1 2 arg max η 1,η 2 2 [ Ri η 1,η 2 R i η1 NE. 18 i=1 2 Bargaining solution of maximum average Nash product Solution 2: For an arbitrary strategy profile η 1,η 2, the Nash product is defined by 2 R i η 1,η 2 R i η1 NE. 19 i=1 The second modified bargaining solution denoted by η NB2 1, η NB2 2 maximizes the average Nash product over all quantizations as follows: 2 η NB2 1, η NB2 2 arg max h[ R i η 1,η 2 R i η1 η 1,η 2 E NE i=1 h ij H ij i,j {1, 2} Bargaining solution of maximum valid probability Solution 3: The third modified bargaining solution maximizes the valid probability of the cooperation. An arbitrary bargaining solution η1 NB,η2 NB is valid if the solution increases both transmitters achievable rates, i.e., if R i η1 NB,η2 NB R i η1 NE for Valid probability Nash Bargaining solution with quantized CSIT Modified bargaining solution1 Modified bargaining solution2 Modified bargaining solution Feedback size for each channel direction bit Fig. 2. Valid probabilities of various bargaining solutions according to the feedback sizes when K =4and P =10dB. all i {1, 2}. The third modified bargaining solution denoted by η NB3 2 is obtained as follows: [ η NB3 2 = arg max Pr R 1 η 1,η 2 R 1 η1 NE and η 1,η 2 R 2 η 1,η 2 R 2 η NE 1,η NE 2 h ij H ij i,j {1, 2}. 21 In practice, each modified solution can be numerically found. Once a quantized channel is given, each transmitter can randomly pick multiple channel samples in the corresponding Voronoi region for averaging purpose. In our case, since the channel directions are isotropic uniformly distributed in C M 1, they should also be uniformly chosen in the Voronoi regions. Remark 1 Proportional Fairness. Replacing the achievable rates at the Nash equilibrium with zero in 12, 18, and 20, each bargaining solution maximizes the product of achievable rate, which is an objective of proportional fairness. Thus, our bargaining solutions can also modify the beamforming strategy for proportional fairness. VI. SIMULATION RESULTS In this section, we compare the Nash bargaining solution based on the quantized CSI defined in 12, and the modified bargaining solutions defined in 18, 20, and 21. In all simulations, each transmitter has four antennas i.e., M =4, and the maximum transmit power i.e., P max normalized with respect to the background noise is fixed to 10dB. Also, each CDI codebook is modeled with a random vector codebook [13, where all codewords are independent and isotropic random unit-norm vectors in C M 1. In Fig. 2, we compare the valid probabilities 4 of the Nash bargaining solution based on the quantized CSIT itself, 4 The valid probability of each bargaining solution is defined as Pr [ R i η1 NB,ηNB 2 R iη1 NE,ηNE 2 i {1, 2}, where η1 NB,ηNB 2 {ˆη 1 NB, ˆηNB 2, ηnb1 1, η NB1 2, η NB2 1, η NB2 2, η NB3 2 }
6 Average Nash product Nash Bargaining solution with quantized CSIT Modified bargaining solution1 Modified bargaining solution2 Modified bargaining solution Feedback size for each channel direction bit Fig. 3. Average Nash products according to the feedback sizes when K =4 and P =10dB. The average Nash product with perfect CSIT is i.e., ˆη 1 NB, ˆη 2 NB, and the modified bargaining solutions, i.e., η NB1 1, η NB1 2, η NB2 1, η NB2 2, and η NB3 2, according to the feedback sizes. As described in Section III-B, the conjectured rate region with the quantized CSI approaches the rate region with the perfect CSI as the feedback size i.e., B increases. Thus, the bargaining solutions based on the quantized CSI yield the rate increments at both transmitters with higher probability as the feedback size increases. In Fig. 2, we can observe that our proposed bargaining solutions improve the validity of cooperation for any feedback size. In Fig. 3, we compare the average Nash products 5 of various bargaining solutions with respect to the feedback sizes, while the average Nash product with perfect CSIT is We can observe that the proposed bargaining solutions based on the average rate region i.e., Solution 1 and average Nash product i.e., Solution 2 increase the average Nash product for all feedback sizes. However, the validity maximizing bargaining solution, which yields the highest valid probability in Fig. 2, shows negligible Nash product increment. This phenomenon reveals that maximization of the bargaining validity makes both transmitters conservative to change their strategies from the Nash equilibrium. product and the valid probability can be improved by utilizing the Voronoi regions of the codebook rather than the quantized CSI itself the representatives of the codebook. ACKNOWLEDGMENT This work was supported in part by the US National Science Foundation under Grants ECCS , CNS , ECCS and EARS REFERENCES [1 R. B. Myerson, Game Theory: Analysis of Conflict. Cambridge, MA: Harvard Univ. Press, [2 E. G. Larsson and E. A. Jorswieck, Competition versus cooperation on the MISO interference channel, IEEE J. Sel. Areas Commun., vol. 26, no. 7, pp , Sep [3 J. Lindblom, E. Karipidis, and E. G. Larson, Selfishness and altruism on the MISO interference channel: The case of partial transmitter CSI, IEEE Commun. Letters, vol. 13, no. 9, pp , Sep [4 Z. K. M. Ho and D. Gesbert, Balancing egoism and altruism on interference channel: The MIMO case, in Proc. IEEE Int. Conf. Commun. ICC 2010, May [5 G. P. Zhang, K. Yang, and H. H. Chen, Resource allocation for wireless cooperative networks: A unified cooperative bargaining game theoretic framework, IEEE Wireless Commun., vol. 19, no. 2, pp , Apr [6 Q. Cao, Y. Jing, and H. V. Zhao, Power allocation in multi-user wireless relay networks through bargaining, IEEE Trans. Wireless Commun., vol. 12, no. 6, pp , June [7 A. Mukherjee and A. L. Swindlehurst, Jamming games in the MIMO wiretap channel with an active eavesdropper, IEEE Trans. Signal Process., vol. 61, no. 1, pp , Jan [8 K. Mukkavilli, A. Sabharwal, E. Erkip, and B. Aazhang, On beamforming with finite rate feedback in multiple-antenna systems, IEEE Trans. Inf. Theory, vol. 49, no. 10, pp , Oct [9 N. Jindal, MIMO broadcast channels with finite-rate feedback, IEEE Trans. Inf. Theory, vol. 52, no. 11, pp , Sep [10 J. H. Lee and W. Choi, Optimal feedback rate sharing strategy in zeroforcing MIMO broadcast channels, IEEE Trans. Wireless Commun., vol. 12, no. 6, pp , June [11 E. A. Jorswieck, E. G. Larsson, and D. Danev, Complete characterization of the Pareto boundary for the MISO interference channel, IEEE Trans. Signal Process., vol. 56, no. 10, pp , Oct [12 T. Yoo, N. Jindal, and A. Goldsmith, Multi-antenna downlink channels with limited feedback and user selection, IEEE J. Select. Areas Commun., vol. 25, no. 7, pp , Sep [13 C. K. Au-Yeung and D. J. Love, On the performance of random vector quantization limited feedback beamforming in a MISO system, IEEE Trans. Wireless Commun., vol. 6, no. 2, pp , Feb VII. CONCLUSION In this paper, we studied the beamforming game in a twouser MISO IC with limited feedback. Considering the quantized CSI at the transmitters, we first found Nash equilibrium in the non-cooperative game. Then, in the cooperative Nash bargaining game, we found a Nash bargaining solution and showed that the strategies based on the quantized CSI may not be valid because of the quantization errors. We proposed three modified bargaining solutions and showed that in the cooperation game with quantized CSI, both of the Nash 5 The average Nash product of each scheme is defined as E h [ 2 i=1 Ri η1 NB,ηNB 2 R iη1 NE,ηNE 2, where η1 NB,ηNB 2 {ˆη 1 NB, ˆηNB 2, ηnb1 1, η NB1 2, η NB2 1, η NB2 2, η NB3 2 }
On the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise
On the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise Ya-Lan Liang, Yung-Shun Wang, Tsung-Hui Chang, Y.-W. Peter Hong, and Chong-Yung Chi Institute of Communications
More informationEfficient Computation of the Pareto Boundary for the Two-User MISO Interference Channel with Multi-User Decoding Capable Receivers
Efficient Computation of the Pareto Boundary for the Two-User MISO Interference Channel with Multi-User Decoding Capable Receivers Johannes Lindblom, Eleftherios Karipidis and Erik G. Larsson Linköping
More informationGame Theoretic Solutions for Precoding Strategies over the Interference Channel
Game Theoretic Solutions for Precoding Strategies over the Interference Channel Jie Gao, Sergiy A. Vorobyov, and Hai Jiang Department of Electrical & Computer Engineering, University of Alberta, Canada
More informationThe Optimality of Beamforming: A Unified View
The Optimality of Beamforming: A Unified View Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 92697-2625 Email: sudhirs@uciedu,
More informationAchievable Outage Rate Regions for the MISO Interference Channel
Achievable Outage Rate Regions for the MISO Interference Channel Johannes Lindblom, Eleftherios Karipidis and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the original
More informationCHANNEL FEEDBACK QUANTIZATION METHODS FOR MISO AND MIMO SYSTEMS
CHANNEL FEEDBACK QUANTIZATION METHODS FOR MISO AND MIMO SYSTEMS June Chul Roh and Bhaskar D Rao Department of Electrical and Computer Engineering University of California, San Diego La Jolla, CA 9293 47,
More informationNOMA: Principles and Recent Results
NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve
More informationDegrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel
/33 Degrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel Presented by Paul de Kerret Joint work with Antonio Bazco, Nicolas Gresset, and David Gesbert ESIT 2017 in Madrid,
More informationSpectrum Leasing via Cooperation for Enhanced. Physical-Layer Secrecy
Spectrum Leasing via Cooperation for Enhanced 1 Physical-Layer Secrecy Keonkook Lee, Member, IEEE, Chan-Byoung Chae, Senior Member, IEEE, Joonhyuk Kang, Member, IEEE arxiv:1205.0085v1 [cs.it] 1 May 2012
More informationI. Introduction. Index Terms Multiuser MIMO, feedback, precoding, beamforming, codebook, quantization, OFDM, OFDMA.
Zero-Forcing Beamforming Codebook Design for MU- MIMO OFDM Systems Erdem Bala, Member, IEEE, yle Jung-Lin Pan, Member, IEEE, Robert Olesen, Member, IEEE, Donald Grieco, Senior Member, IEEE InterDigital
More informationVECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK
VECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK June Chul Roh and Bhaskar D. Rao Department of Electrical and Computer Engineering University of California, San Diego La
More informationJoint Power Control and Beamforming Codebook Design for MISO Channels with Limited Feedback
Joint Power Control and Beamforming Codebook Design for MISO Channels with Limited Feedback Behrouz Khoshnevis and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto,
More informationTwo-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems
Two-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems Behrouz Khoshnevis and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, Ontario,
More informationOn the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels
On the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels Giuseppe Caire University of Southern California Los Angeles, CA, USA Email: caire@usc.edu Nihar
More informationOn the Design of Scalar Feedback Techniques for MIMO Broadcast Scheduling
On the Design of Scalar Feedback Techniques for MIMO Broadcast Scheduling Ruben de Francisco and Dirk T.M. Slock Eurecom Institute Sophia-Antipolis, France Email: {defranci, slock}@eurecom.fr Abstract
More informationto reprint/republish this material for advertising or promotional purposes
c 8 IEEE Personal use of this material is permitted However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationPerformance Analysis of Multiple Antenna Systems with VQ-Based Feedback
Performance Analysis of Multiple Antenna Systems with VQ-Based Feedback June Chul Roh and Bhaskar D. Rao Department of Electrical and Computer Engineering University of California, San Diego La Jolla,
More informationTransmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback
IEEE INFOCOM Workshop On Cognitive & Cooperative Networks Transmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback Chao Wang, Zhaoyang Zhang, Xiaoming Chen, Yuen Chau. Dept.of
More informationDEVICE-TO-DEVICE COMMUNICATIONS: THE PHYSICAL LAYER SECURITY ADVANTAGE
DEVICE-TO-DEVICE COMMUNICATIONS: THE PHYSICAL LAYER SECURITY ADVANTAGE Daohua Zhu, A. Lee Swindlehurst, S. Ali A. Fakoorian, Wei Xu, Chunming Zhao National Mobile Communications Research Lab, Southeast
More informationHybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems
Hybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems Umer Salim, David Gesbert, Dirk Slock, Zafer Beyaztas Mobile Communications Department Eurecom, France Abstract The communication between
More informationDirty Paper Coding vs. TDMA for MIMO Broadcast Channels
TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University
More informationUSING multiple antennas has been shown to increase the
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 1, JANUARY 2007 11 A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users Masoud Sharif, Member, IEEE, and Babak
More informationSignaling Design of Two-Way MIMO Full-Duplex Channel: Optimality Under Imperfect Transmit Front-End Chain
DRAFT 1 Signaling Design of Two-Way MIMO Full-Duplex Channel: Optimality Under Imperfect Transmit Front-End Chain Shuqiao Jia and Behnaam Aazhang, arxiv:1506.00330v1 [cs.it] 1 Jun 2015 Abstract We derive
More informationTitle. Author(s)Tsai, Shang-Ho. Issue Date Doc URL. Type. Note. File Information. Equal Gain Beamforming in Rayleigh Fading Channels
Title Equal Gain Beamforming in Rayleigh Fading Channels Author(s)Tsai, Shang-Ho Proceedings : APSIPA ASC 29 : Asia-Pacific Signal Citationand Conference: 688-691 Issue Date 29-1-4 Doc URL http://hdl.handle.net/2115/39789
More informationTrust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems
Introduction Main Results Simulation Conclusions Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems Mojtaba Vaezi joint work with H. Inaltekin, W. Shin, H. V. Poor, and
More informationJoint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation
Joint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation Chongbin Xu, Peng Wang, Zhonghao Zhang, and Li Ping City University of Hong Kong 1 Outline Background Mutual Information
More informationMode Selection for Multi-Antenna Broadcast Channels
Mode Selection for Multi-Antenna Broadcast Channels Gill November 22, 2011 Gill (University of Delaware) November 22, 2011 1 / 25 Part I Mode Selection for MISO BC with Perfect/Imperfect CSI [1]-[3] Gill
More informationVector Channel Capacity with Quantized Feedback
Vector Channel Capacity with Quantized Feedback Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 9697-65 Email: syed@ece.uci.edu,
More informationLimited Feedback in Wireless Communication Systems
Limited Feedback in Wireless Communication Systems - Summary of An Overview of Limited Feedback in Wireless Communication Systems Gwanmo Ku May 14, 17, and 21, 2013 Outline Transmitter Ant. 1 Channel N
More informationHow Much Training and Feedback are Needed in MIMO Broadcast Channels?
How uch raining and Feedback are Needed in IO Broadcast Channels? ari Kobayashi, SUPELEC Gif-sur-Yvette, France Giuseppe Caire, University of Southern California Los Angeles CA, 989 USA Nihar Jindal University
More informationInformation Theory Meets Game Theory on The Interference Channel
Information Theory Meets Game Theory on The Interference Channel Randall A. Berry Dept. of EECS Northwestern University e-mail: rberry@eecs.northwestern.edu David N. C. Tse Wireless Foundations University
More informationWeighted DFT Codebook for Multiuser MIMO in Spatially Correlated Channels
Weighted DFT Codebook for Multiuser MIMO in Spatially Correlated Channels Fang Yuan, Shengqian Han, Chenyang Yang Beihang University, Beijing, China Email: weiming8@gmail.com, sqhan@ee.buaa.edu.cn, cyyang@buaa.edu.cn
More informationMULTI-INPUT multi-output (MIMO) channels, usually
3086 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 8, AUGUST 2009 Worst-Case Robust MIMO Transmission With Imperfect Channel Knowledge Jiaheng Wang, Student Member, IEEE, and Daniel P. Palomar,
More informationSecure Multiuser MISO Communication Systems with Quantized Feedback
Secure Multiuser MISO Communication Systems with Quantized Feedback Berna Özbek*, Özgecan Özdoğan*, Güneş Karabulut Kurt** *Department of Electrical and Electronics Engineering Izmir Institute of Technology,Turkey
More informationK User Interference Channel with Backhaul
1 K User Interference Channel with Backhaul Cooperation: DoF vs. Backhaul Load Trade Off Borna Kananian,, Mohammad A. Maddah-Ali,, Babak H. Khalaj, Department of Electrical Engineering, Sharif University
More informationDuality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels
2658 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 10, OCTOBER 2003 Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels Sriram Vishwanath, Student Member, IEEE, Nihar
More informationReflected Simplex Codebooks for Limited Feedback MIMO Beamforming
Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming Daniel J. Ryan 1, Iain B. Collings 2 and Jean-Marc Valin 3 1 Dept. of Electronics & Telecommunications., Norwegian University of Science
More informationSoft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas
Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antenn Jae-Dong Yang, Kyoung-Young Song Department of EECS, INMC Seoul National University Email: {yjdong, sky6174}@ccl.snu.ac.kr
More informationCommunication Games on the Generalized Gaussian Relay Channel
Communication Games on the Generalized Gaussian Relay Channel Dileep M. alathil Department of Electrical Engineering University of Southern California manisser@usc.edu Rahul Jain EE & ISE Departments University
More informationMassive MU-MIMO Downlink TDD Systems with Linear Precoding and Downlink Pilots
Massive MU-MIMO Downlink TDD Systems with Linear Precoding and Downlink Pilots Hien Quoc Ngo, Erik G. Larsson, and Thomas L. Marzetta Department of Electrical Engineering (ISY) Linköping University, 58
More informationLow-High SNR Transition in Multiuser MIMO
Low-High SNR Transition in Multiuser MIMO Malcolm Egan 1 1 Agent Technology Center, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic. 1 Abstract arxiv:1409.4393v1
More informationDegrees-of-Freedom for the 4-User SISO Interference Channel with Improper Signaling
Degrees-of-Freedom for the -User SISO Interference Channel with Improper Signaling C Lameiro and I Santamaría Dept of Communications Engineering University of Cantabria 9005 Santander Cantabria Spain Email:
More informationSpectrum Sharing in RF-Powered Cognitive Radio Networks using Game Theory
Spectrum Sharing in RF-owered Cognitive Radio Networks using Theory Yuanye Ma, He Henry Chen, Zihuai Lin, Branka Vucetic, Xu Li The University of Sydney, Sydney, Australia, Email: yuanye.ma, he.chen, zihuai.lin,
More informationClosed-Form Parameterization of the Pareto Boundary for the Two-User MISO Interference Channel
Closed-Form Parameterization of the Pareto Boundary for the Two-User MISO Interference Channel Johannes Lindblom, Eleftherios Karipidis and Erik G. Larsson Linköping University Post Print N.B.: When citing
More informationQuantifying the Performance Gain of Direction Feedback in a MISO System
Quantifying the Performance Gain of Direction Feedback in a ISO System Shengli Zhou, Jinhong Wu, Zhengdao Wang 3, and ilos Doroslovacki Dept. of Electrical and Computer Engineering, University of Connecticut
More informationThe Water-Filling Game in Fading Multiple Access Channels
The Water-Filling Game in Fading Multiple Access Channels Lifeng Lai and Hesham El Gamal arxiv:cs/05203v [cs.it] 3 Dec 2005 February, 2008 Abstract We adopt a game theoretic approach for the design and
More informationAn Uplink-Downlink Duality for Cloud Radio Access Network
An Uplin-Downlin Duality for Cloud Radio Access Networ Liang Liu, Prati Patil, and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, ON, 5S 3G4, Canada Emails: lianguotliu@utorontoca,
More informationSingle-User MIMO systems: Introduction, capacity results, and MIMO beamforming
Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationHybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems
Hybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems Umer Salim, David Gesbert, Dirk Slock and Zafer Beyaztas Mobile Communications Department Eurecom, France Email: {salim, gesbert, slock}@eurecom.fr
More informationTwo-Way Training: Optimal Power Allocation for Pilot and Data Transmission
564 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 9, NO. 2, FEBRUARY 200 Two-Way Training: Optimal Power Allocation for Pilot and Data Transmission Xiangyun Zhou, Student Member, IEEE, Tharaka A.
More informationDiversity Multiplexing Tradeoff in Multiple Antenna Multiple Access Channels with Partial CSIT
1 Diversity Multiplexing Tradeoff in Multiple Antenna Multiple Access Channels with artial CSIT Kaushi Josiam, Dinesh Rajan and Mandyam Srinath, Department of Electrical Engineering, Southern Methodist
More informationCapacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback
2038 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 9, SEPTEMBER 2004 Capacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback Vincent
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationNetwork Calculus. A General Framework for Interference Management and Resource Allocation. Martin Schubert
Network Calculus A General Framework for Interference Management and Resource Allocation Martin Schubert Fraunhofer Institute for Telecommunications HHI, Berlin, Germany Fraunhofer German-Sino Lab for
More informationIN this paper, we show that the scalar Gaussian multiple-access
768 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 5, MAY 2004 On the Duality of Gaussian Multiple-Access and Broadcast Channels Nihar Jindal, Student Member, IEEE, Sriram Vishwanath, and Andrea
More informationPilot Optimization and Channel Estimation for Multiuser Massive MIMO Systems
1 Pilot Optimization and Channel Estimation for Multiuser Massive MIMO Systems Tadilo Endeshaw Bogale and Long Bao Le Institute National de la Recherche Scientifique (INRS) Université de Québec, Montréal,
More informationLattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm
Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm HongSun An Student Member IEEE he Graduate School of I & Incheon Korea ahs3179@gmail.com Manar Mohaisen Student Member IEEE
More informationOVER the past ten years, research (see the references in
766 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 2, FEBRUARY 2006 Duplex Distortion Models for Limited Feedback MIMO Communication David J. Love, Member, IEEE Abstract The use of limited feedback
More informationMultiple Antenna Broadcast Channels with Shape Feedback and Limited Feedback
Multiple Antenna Broadcast Channels with Shape Feedback and Limited Feedback Peilu Ding, David J. Love, and Michael D. Zoltowski School of Electrical and Computer Engineering Purdue University West Lafayette,
More informationOptimal Power Allocation for Parallel Gaussian Broadcast Channels with Independent and Common Information
SUBMIED O IEEE INERNAIONAL SYMPOSIUM ON INFORMAION HEORY, DE. 23 1 Optimal Power Allocation for Parallel Gaussian Broadcast hannels with Independent and ommon Information Nihar Jindal and Andrea Goldsmith
More informationOptimal Data and Training Symbol Ratio for Communication over Uncertain Channels
Optimal Data and Training Symbol Ratio for Communication over Uncertain Channels Ather Gattami Ericsson Research Stockholm, Sweden Email: athergattami@ericssoncom arxiv:50502997v [csit] 2 May 205 Abstract
More informationDecentralized Simultaneous Energy and Information Transmission in Multiple Access Channels
Decentralized Simultaneous Energy and Information Transmission in Multiple Access Channels Selma Belhadj Amor, Samir M. Perlaza To cite this version: Selma Belhadj Amor, Samir M. Perlaza. Decentralized
More informationUpper Bounds on MIMO Channel Capacity with Channel Frobenius Norm Constraints
Upper Bounds on IO Channel Capacity with Channel Frobenius Norm Constraints Zukang Shen, Jeffrey G. Andrews, Brian L. Evans Wireless Networking Communications Group Department of Electrical Computer Engineering
More informationSpace-Time Coding for Multi-Antenna Systems
Space-Time Coding for Multi-Antenna Systems ECE 559VV Class Project Sreekanth Annapureddy vannapu2@uiuc.edu Dec 3rd 2007 MIMO: Diversity vs Multiplexing Multiplexing Diversity Pictures taken from lectures
More informationMIMO Broadcast Channels with Finite Rate Feedback
IO Broadcast Channels with Finite Rate Feedbac Nihar Jindal, ember, IEEE Abstract ultiple transmit antennas in a downlin channel can provide tremendous capacity ie multiplexing gains, even when receivers
More informationOn the Duality of Gaussian Multiple-Access and Broadcast Channels
On the Duality of Gaussian ultiple-access and Broadcast Channels Xiaowei Jin I. INTODUCTION Although T. Cover has been pointed out in [] that one would have expected a duality between the broadcast channel(bc)
More information5032 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 11, NOVEMBER /$ IEEE
5032 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 11, NOVEMBER 2009 On the Information Rate of MIMO Systems With Finite Rate Channel State Feedback Using Beamforming Power On/Off Strategy Wei
More informationAn Analysis of Uplink Asynchronous Non-Orthogonal Multiple Access Systems
1 An Analysis of Uplink Asynchronous Non-Orthogonal Multiple Access Systems Xun Zou, Student Member, IEEE, Biao He, Member, IEEE, and Hamid Jafarkhani, Fellow, IEEE arxiv:18694v1 [csit] 3 Jun 18 Abstract
More informationOn the Degrees of Freedom of the Finite State Compound MISO Broadcast Channel
On the Degrees of Freedom of the Finite State Compound MISO Broadcast Channel Invited Paper Chenwei Wang, Tiangao Gou, Syed A. Jafar Electrical Engineering and Computer Science University of California,
More informationCodebook Design for Channel Feedback in Lens-Based Millimeter-Wave Massive MIMO Systems
1 Codebook Design for Channel Feedback in Lens-Based Millimeter-Wave Massive MIMO Systems Wenqian Shen, Student Member, IEEE, Linglong Dai, Senior Member, IEEE, Yang Yang, Member, IEEE, Yue Li, Member,
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More informationApproximate Ergodic Capacity of a Class of Fading Networks
Approximate Ergodic Capacity of a Class of Fading Networks Sang-Woon Jeon, Chien-Yi Wang, and Michael Gastpar School of Computer and Communication Sciences EPFL Lausanne, Switzerland {sangwoon.jeon, chien-yi.wang,
More informationA Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks
A Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks Daniel Frank, Karlheinz Ochs, Aydin Sezgin Chair of Communication Systems RUB, Germany Email: {danielfrank, karlheinzochs,
More informationApproximate Capacity of Fast Fading Interference Channels with no CSIT
Approximate Capacity of Fast Fading Interference Channels with no CSIT Joyson Sebastian, Can Karakus, Suhas Diggavi Abstract We develop a characterization of fading models, which assigns a number called
More informationOptimum Transmission Scheme for a MISO Wireless System with Partial Channel Knowledge and Infinite K factor
Optimum Transmission Scheme for a MISO Wireless System with Partial Channel Knowledge and Infinite K factor Mai Vu, Arogyaswami Paulraj Information Systems Laboratory, Department of Electrical Engineering
More informationOn the Optimality of Multiuser Zero-Forcing Precoding in MIMO Broadcast Channels
On the Optimality of Multiuser Zero-Forcing Precoding in MIMO Broadcast Channels Saeed Kaviani and Witold A. Krzymień University of Alberta / TRLabs, Edmonton, Alberta, Canada T6G 2V4 E-mail: {saeed,wa}@ece.ualberta.ca
More informationOn the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System
1 On the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System Chun Kin Au-Yeung, Student Member, IEEE, and David J. Love, Member, IEEE Abstract In multiple antenna wireless
More informationMinimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading
Minimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading Yakun Sun and Michael L. Honig Department of ECE orthwestern University Evanston, IL 60208 Abstract We consider
More informationUnder sum power constraint, the capacity of MIMO channels
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL 6, NO 9, SEPTEMBER 22 242 Iterative Mode-Dropping for the Sum Capacity of MIMO-MAC with Per-Antenna Power Constraint Yang Zhu and Mai Vu Abstract We propose an
More informationAppendix B Information theory from first principles
Appendix B Information theory from first principles This appendix discusses the information theory behind the capacity expressions used in the book. Section 8.3.4 is the only part of the book that supposes
More informationOptimization of Training and Feedback Overhead for Beamforming over Block Fading Channels
Optimization of Training and Feedback Overhead for Beamforming over Block Fading Channels Wiroonsak Santipach and Michael L. Honig Abstract We examine the capacity of beamforming over a single-user, multi-antenna
More informationA Comparison of Two Achievable Rate Regions for the Interference Channel
A Comparison of Two Achievable Rate Regions for the Interference Channel Hon-Fah Chong, Mehul Motani, and Hari Krishna Garg Electrical & Computer Engineering National University of Singapore Email: {g030596,motani,eleghk}@nus.edu.sg
More informationInformation Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results
Information Theory Lecture 10 Network Information Theory (CT15); a focus on channel capacity results The (two-user) multiple access channel (15.3) The (two-user) broadcast channel (15.6) The relay channel
More informationSum-Rate Analysis of MIMO Broadcast Channel with Random Unitary Beamforming
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 8 proceedings. Sum-Rate Analysis of IO Broadcast Channel with Random
More informationOn the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation
On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation Mehdi Ashraphijuo, Vaneet Aggarwal and Xiaodong Wang 1 arxiv:1308.3310v1 [cs.it] 15 Aug 2013
More informationIncremental Coding over MIMO Channels
Model Rateless SISO MIMO Applications Summary Incremental Coding over MIMO Channels Anatoly Khina, Tel Aviv University Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv University Gregory W. Wornell,
More informationOn the Optimization of Two-way AF MIMO Relay Channel with Beamforming
On the Optimization of Two-way AF MIMO Relay Channel with Beamforming Namjeong Lee, Chan-Byoung Chae, Osvaldo Simeone, Joonhyuk Kang Information and Communications Engineering ICE, KAIST, Korea Email:
More informationÜ B U N G S A U F G A B E N. S p i e l t h e o r i e
T E C H N I S C H E U N I V E R S I T Ä T D R E S D E N F A K U L T Ä T E L E K T R O T E C H N I K U N D I N F O R M A T I O N S T E C H N I K Ü B U N G S A U F G A B E N S p i e l t h e o r i e by Alessio
More informationA robust transmit CSI framework with applications in MIMO wireless precoding
A robust transmit CSI framework with applications in MIMO wireless precoding Mai Vu, and Arogyaswami Paulraj Information Systems Laboratory, Department of Electrical Engineering Stanford University, Stanford,
More informationRandom Access Protocols for Massive MIMO
Random Access Protocols for Massive MIMO Elisabeth de Carvalho Jesper H. Sørensen Petar Popovski Aalborg University Denmark Emil Björnson Erik G. Larsson Linköping University Sweden 2016 Tyrrhenian International
More informationInteractive Interference Alignment
Interactive Interference Alignment Quan Geng, Sreeram annan, and Pramod Viswanath Coordinated Science Laboratory and Dept. of ECE University of Illinois, Urbana-Champaign, IL 61801 Email: {geng5, kannan1,
More informationExploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless
Exploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless SPAWC 2003 Rome, Italy June 18, 2003 E. Yoon, M. Vu and Arogyaswami Paulraj Stanford University Page 1 Outline Introduction
More informationA Precoding Method for Multiple Antenna System on the Riemannian Manifold
Journal of Communications Vol. 9, No. 2, February 2014 A Precoding Method for Multiple Antenna System on the Riemannian Manifold Lin Zhang1 and S. H. Leung2 1 Department of Electronic Engineering, City
More informationMinimum Mean Squared Error Interference Alignment
Minimum Mean Squared Error Interference Alignment David A. Schmidt, Changxin Shi, Randall A. Berry, Michael L. Honig and Wolfgang Utschick Associate Institute for Signal Processing Technische Universität
More informationA Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels
A Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels Mehdi Mohseni Department of Electrical Engineering Stanford University Stanford, CA 94305, USA Email: mmohseni@stanford.edu
More informationOn Gaussian MIMO Broadcast Channels with Common and Private Messages
On Gaussian MIMO Broadcast Channels with Common and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 ersen@umd.edu
More informationThe Nash Equilibrium Region of the Linear Deterministic Interference Channel with Feedback
The Nash Equilibrium Region of the Linear Deterministic Interference Channel with Feedback Samir M. Perlaza, Ravi Tandon, H. Vincent Poor and Zhu Han. Department of Electrical Engineering. Princeton University,
More informationOptimum Power Allocation in Fading MIMO Multiple Access Channels with Partial CSI at the Transmitters
Optimum Power Allocation in Fading MIMO Multiple Access Channels with Partial CSI at the Transmitters Alkan Soysal Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland,
More information