Sum-Power Iterative Watefilling Algorithm
|
|
- Neil McLaughlin
- 5 years ago
- Views:
Transcription
1 Sum-Power Iterative Watefilling Algorithm Daniel P. Palomar Hong Kong University of Science and Technolgy (HKUST) ELEC547 - Convex Optimization Fall , HKUST, Hong Kong November 11, 2009
2 Outline of Lecture Basic MIMO channel and waterfilling solution MIMO MAC and the IWFA MIMO BC Sum-power IWFA via primal decomposition Sum-power IWFA via dual decomposition Summary Daniel P. Palomar 1
3 Basic MIMO Channel Consider a Multiple-Input Multiple-Output (MIMO) channel: y = Hx + n H is the channel matrix x is the transmitted signal with covariance matrix Q = E [ xx ] n is the Gaussian noise with covariance matrix R n = E [ nn ] y is the received signal. The mutual information of such a channel is maximized with a Gaussian signaling and it is then given by log det ( R n + HQH ) log det(r n ). Average power constraint: Tr(Q) P. Daniel P. Palomar 2
4 Problem Formulation The maximization of the mutual information over the transmit covariance matrix is maximize Q subject to log det ( R n + HQH ) Tr(Q) P Q 0. This problem is convex: the logdet function is concave, the trace constraint is just a linear constraint, and the positive semidefiniteness constraint is an LMI. Hence, we can use a general-purpose method such as an interiorpoint method to solve it in polynomial time. Daniel P. Palomar 3
5 Closed-Form Solution: MIMO Waterfilling However, this problem admits a closed-form solution as can be derived from the KKT conditions. The Lagrangian is L(Q;µ,Ψ) = log det ( R n + HQH ) +µ(tr(q) P) Tr(ΨQ). The gradient of the Lagrangian is Q L = H ( R n + HQH ) 1 H + µi Ψ. Daniel P. Palomar 4
6 KKT Conditions The KKT conditions are Tr(Q) P, Q 0 µ 0, Ψ 0 H ( R n + HQH ) 1 H + Ψ = µi µ(tr(q) P) = 0, ΨQ = 0. Can we find a Q that satisfies the KKT conditions (together with some dual variables)? Daniel P. Palomar 5
7 First, let s simplify the KKT conditions by defining the so-called whitened channel: H = R 1/2 n H. Then, the third KKT condition becomes: H ( I + HQ H ) 1 H + Ψ = µi. To simplify even further, let s write the SVD of the channel matrix as H = UΣV (denote the eigenvalues σ i ), obtaining: Σ ( I + Σ QΣ ) 1 Σ + Ψ = µi. where Q = V QV and Ψ = V ΨV. Daniel P. Palomar 6
8 The KKT conditions are: Tr( Q) P, Q 0 µ 0, Ψ 0 ( Σ I + Σ QΣ ) 1 Σ + Ψ = µi ( ) µ Tr( Q) P = 0, Ψ Q = 0. At this point, we can make a guess: perhaps the optimal Q and Ψ are diagonal? Let s try... Daniel P. Palomar 7
9 Define Q = diag (p) (p is the power allocation) and Ψ = diag (ψ). The KKT conditions become: i p i P, p i 0 µ 0, ψ i 0 µ ( i σ 2 i 1 + σi 2p i ) + ψ i = µ p i P = 0,ψ i p i = 0. Let s now look into detail at the KKT conditions. Daniel P. Palomar 8
10 First of all, observe that µ > 0, otherwise we would have ψ i = 0 which cannot be satisfied. σ 2 i 1+σ 2 i p i + Let s differentiate two cases in the power allocation: if p i > 0, then ψ i = 0 = σ2 i 1+σ 2 i p i = µ = p i = µ 1 1/σ 2 i (also note that µ = σ2 i < 1+σ i 2p σ2 i ) i if p i = 0, then σi 2 + ψ i = µ (note that µ = σi 2 + ψ i σi 2. Equivalently, if σ 2 i > µ, then p i = µ 1 1/σ 2 i if σ 2 i µ, then p i = 0. Daniel P. Palomar 9
11 Waterfilling Solution More compactly, we can write the well-known waterfilling solution: p i = ( µ 1 1/σ 2 i ) + where µ 1 is called water-level and is chosen to satisfy i p i = P (so that all the KKT conditions are satisfied). Therefore, the optimal solution is given by where Q = Vdiag (p)v the optimal transmit directions are matched to the channel matrix the optimal power allocation is the waterfilling. Daniel P. Palomar 10
12 MIMO MAC Consider a Multiple-Access Channel (MAC), e.g., the uplink of a cellular wireless system where K different users transmit to the same base station: K y = H k x k + n where k=1 x k is the signal transmitted by the kth user with cov. matrix Q k H k is the channel matrix between kth user and the base station R n is the covariance matrix of the noise. Daniel P. Palomar 11
13 MIMO MAC Problem Formulation Such system can be partially characterized with one parameter: the sum rate R 1 + R R K. The sum rate for a MIMO MAC is ( ) K log det R n + H k Q k H k k=1 log det (R n ) The constraints in the system are transmit power constraints for each of the users: Tr(Q k ) P k. Daniel P. Palomar 12
14 MIMO MAC Problem Formulation The formulation of the problem is maximize {Q k } log det ( R n + ) K k=1 H kq k H k subject to Tr(Q k ) P k k Q k 0. This problem is convex: the logdet function is concave, the trace constraints are just a linear constraints, and the positive semidefiniteness constraints are LMIs. Hence, we can use a general-purpose method such as an interiorpoint method to solve it in polynomial time. The question is: Can we derive a closed-form solution like in the single-user case with the waterfilling? Daniel P. Palomar 13
15 KKT Conditions The Lagrangian is L({Q k };{µ k }, {Ψ k }) = log det ( R n + K k=1 H k Q k H k ) + k µ k (Tr(Q k ) P k ) k Tr(Ψ k Q k ). The gradients of the Lagrangian are ( 1 K Qk L = H k R n + H l Q l H l) H k + µ k I Ψ k. l=1 Daniel P. Palomar 14
16 The KKT conditions are, for all k, Tr(Q k ) P k, Q k 0 H k ( R n + K µ k 0, Ψ k 0 1 H l Q l H l) H k + Ψ k = µ k I l=1 µ k (Tr(Q k ) P k ) = 0, Ψ k Q k = 0. It follows from the KKT conditions that at an optimal point, each user k, must satisfy a set of KKT conditions identical to those for the single-user case, but with the equivalent noise covariance matrix: R k = R n + l k H l Q l H l. Daniel P. Palomar 15
17 Closed-Form Solution from the KKT Conditions? This implies that at an optimal point, each user must be waterfilling (treating the other users as noise). Unfortunately, this observation does not mean that we can derive a closed-form solution. However, this suggests that perhaps we could optimize one user at a time, each optimization being solved in closed-form by a waterfilling. But, is this going to converge to a stationary point where all users waterfill jointly? The answer is positive: It follows from a classic result in optimization of the so-called Nonlinear Gauss-Seidel algorithm. Daniel P. Palomar 16
18 Gauss-Seidel Algorithm The Nonlinear Gauss-Seidel algorithm (AKA block-coordinate descent algorithm) optimizes f (x 1,,x N ) sequentially: x (t+1) k = arg max x k where t is the index for a global iteration. Converges if: f ( ) x (t+1) 1,,x (t+1) k 1,x k,x (t) k+1,,x(t) N 1. the function f (x 1,,x N ) is jointly convex 2. each optimization has a unique solution 3. the feasible set is a Cartesian product: X = X 1 X N. Daniel P. Palomar 17
19 Iterative Waterfilling Algorithm Particularization of the Gauss-Seidel algorithm to the maximization of the sum rate leads to the popular iterative waterfilling algorithm. repeat for t = 1,2, for each user k = 1,,K obtain the update as where Q k (t + 1) = V k diag (p k )V k V k is the eigenvector matrix of the equivalent whitened squared channel: H k R 1 k H k (note: R k depends on the other users) ( +. p k is the waterfilling power allocation p k,i = µ 1 k k,i) 1/σ2 Daniel P. Palomar 18
20 MIMO BC Consider a Broadcast Channel (BC), e.g., the downlink of a cellular wireless system where the base station transmits to K different users: y k = H k x + n k where x is the signal transmitted by the base station H k is the channel matrix between base station and the kth user R n,k is the covariance matrix of the noise. It turns out that, via uplink-downlink duality, the previous BC formulation can be reformulated as an equivalent MAC like similar to the one before. Daniel P. Palomar 19
21 MIMO BC Problem Formulation Such system can be partially characterized with one parameter: the sum rate R 1 + R R K. The sum rate for a MIMO BC is ( ) K log det R n + H k Q k H k k=1 log det (R n ) The constraint in the system is a total transmit power constraint for the base station: k Tr(Q k) P T. Daniel P. Palomar 20
22 MIMO BC Problem Formulation The formulation of the problem is maximize {Q k } subject to ( log det R n + ) K k=1 H kq k H k k Tr(Q k) P T Q k 0 k. This problem is very similar to the MAC formulation with the difference that instead of having individual power constraints for each of the users Tr(Q k ) P k we have a total power constraint coupling the feasible sets of all the users. Can we develop here a similar iterative waterfilling algorithm based on the Gauss-Seidel algorithm? Daniel P. Palomar 21
23 Iterative Waterfilling for the MIMO BC? The answer is negative: the feasible set is not a Cartesian product and we cannot use the Gauss-Seidel algorithm. The problem is the sum-power constraint that couples all the users. We know from the basic theory on decomposition techniques that coupling constraints can be dealt with via dual decomposition. In fact, a primal decomposition can also be effectively employed here. Daniel P. Palomar 22
24 Using Decomposition Methods For convenience, let s introduce additional variables denoting the power allocation over the users P 1,,P K : ( maximize log det R n + ) K k=1 H kq k H k {P k },{Q k } subject to Tr(Q k ) P k k Q k 0 k P k P T. Primal decomposition: fix the power alocation {P k } and solve each subproblem by the classical iterative waterfilling algorithm. Dual decomposition: relax the coupling constraint k P k P T and solve each subproblem by a modified iterative waterfilling algorithm. Daniel P. Palomar 23
25 Primal Decomposition For fixed {P k }, we have the subproblem (only one, the objective does not decouple): maximize {Q k } subject to log det Tr(Q k ) P k Q k 0 with optimal value f (P 1,,P K ). ( R n + ) K k=1 H kq k H k It can be solved with the iterative waterfilling algorithm. A subgradient of f (P 1,,P K ) is µ (P 1,,P K ). k Daniel P. Palomar 24
26 Master primal problem: Primal Decomposition maximize {P k } subject to f (P 1,,P K ) k P k P T (P k 0). It can be solved with a projected subgradient method: P 1 P 1. (t + 1) =. (t) + α k µ(t) P K P K where µ (t) is defined as µ (P 1 (t),,p K (t)) and S is the simplex S = {x i x i P T, x 0}. S Daniel P. Palomar 25
27 It is not difficult to show that a projection on a simplex is given by [x] S = (x θ) +. The subgradient method is then P 1 P 1. (t + 1) =. P K P K (t) + α k µ(t) θ +. For each update of the power allocation {P k } we need to solve the subproblem by means of the iterative waterfilling algorithm (because the objective is still coupled in the objective). Alternative: we could employ a different decomposition to decouple the objective as well. Daniel P. Palomar 26
28 Recall the original problem maximize {P k },{Q k } Dual Decomposition log det ( R n + ) K k=1 H kq k H k subject to Tr(Q k ) P k k Q k 0 k P k P T. Form a partial Lagrangian by relaxing the coupling constraint k P k P T : ( ) K L({Q k },{P k } ;µ) = log det R n + H k Q k H k k=1 ( ) +µ P k P T. k Daniel P. Palomar 27
29 Dual Decomposition For fixed µ, the subproblem is (only one, the objective does not decouple) ( maximize log det R n + ) K k=1 H kq k H k µ( k P k P T ) {P k },{Q k } subject to Tr(Q k ) P k k Q k 0 with optimal value g (µ) and subgradient P T k P k (µ). The master dual problem is minimize µ g (µ) subject to µ 0. Daniel P. Palomar 28
30 Dual Decomposition: Solving the Subproblem To solve the subproblem, we can use again a Nonlinear Gauss-Seidel method to optimize one user at a time. Each optimization is maximize P k,q k subject to log det Tr(Q k ) P k Q k 0. ( ) R k + H k Q k H k µp k This problem is slightly different from the one that led to the waterfilling solution: here P k is an optimization variable, and we have the additional term µp k in the objective. Daniel P. Palomar 29
31 Let s derive a closed-form solution from the KKT conditions. The Lagrangian is L(P k,q k ;λ k,ψ k ) = log det ( ) R k + H k Q k H k + µp k +λ k (Tr(Q k ) P k ) Tr(Ψ k Q k ). The gradients of the Lagrangian are Qk L = H k ( R k + H k Q k H k) 1Hk + λ k I Ψ k Pk L = µ λ k. Daniel P. Palomar 30
32 The KKT conditions are H k Tr(Q k ) P k, Q k 0 λ k 0, Ψ k 0 ( 1Hk R k + H k Q k H k) + Ψ k = λ k I µ = λ k λ k (Tr(Q k ) P k ) = 0, Ψ k Q k = 0. These conditions are the same we encountered when we derived the waterfilling solution with the only different that now λ k = µ, i.e., the waterlevel λ 1 k is now fixed to µ 1. Daniel P. Palomar 31
33 Thus, the optimal solution is Q k = V k diag (p k )V k P k = Tr(Q k) where p k is the waterfilling power allocation with fixed waterlevel µ 1. p k,i = ( µ 1 1/σk,i 2 ) + Daniel P. Palomar 32
34 Dual Decomposition: Solving the Master Problem Now we need to solve the dual master problem minimize µ g (µ) subject to µ 0. We can use a simple subgradient method: ( µ(t + 1) = [µ(t) α k P T k P k (µ(t)))] +. Observe that if k P k (µ(t)) > P T, then µ(t) will be increased if k P k (µ(t)) < P T, then µ(t) will be decreased. Daniel P. Palomar 33
35 Dual Decomposition: Solving the Master Problem Alternatively, since the dual variable is a scalar, we can use the way more effective bisection method: 1. Initialize µ min and µ max. 2. Let µ = (µ min + µ max ) /2. 3. Solve iteratively for all users (using the iterative waterfilling with fixed waterlevel µ 1 ). 4. If k P k > P T, then set µ min = µ; otherwise set µ max = µ. 5. Stopping criterion: If µ max µ min ε, then stop; otherwise, go to step 2. Daniel P. Palomar 34
36 Summary We have recalled the MIMO waterfilling solution for the single-user case. We have derived the iterative waterfilling algorithm for the MIMO MAC with individual power constraints. For the MIMO BC with a sum-power constraint, we have considered: primal decomposition dual decomposition. Each decomposition leads to a different variation of the basic iterative waterfilling algorithm. Daniel P. Palomar 35
37 References W. Yu, W. Rhee, S. Boyd, and J. Cioffi, Iterative Water-Filling for Gaussian Vector Multiple-Access Channels, IEEE Trans. on Information Theory, vol. 50, no. 1, Jan W. Yu, A Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem, in Proc. Conf. on Information and Systems (CISS), The Johns Hopkins Univ., March 12-14, N. Jindal, W. Rhee, S. Vishwanath, S. A. Jafar, and A. Goldsmith, Sum Power Iterative Water-Filling for Multi-Antenna Gaussian Broadcast Channels, IEEE Trans. on Information Theory, vol. 51, no. 4, April Daniel P. Palomar, Convex Primal Decomposition for Multicarrier Linear MIMO Transceivers, IEEE Trans. on Signal Processing, vol. 53, no. 12, Dec Daniel P. Palomar 36
Lagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual
More informationAlternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications
Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization
More informationConjugate Gradient Projection Approach for Multi-Antenna Gaussian Broadcast Channels
Conjugate Gradient Projection Approach for Multi-Antenna Gaussian Broadcast Channels Jia Liu Y. Thomas Hou Hanif D. Sherali The Bradley Department of Electrical and Computer Engineering The Grado Department
More informationPrimal/Dual Decomposition Methods
Primal/Dual Decomposition Methods Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2018-19, HKUST, Hong Kong Outline of Lecture Subgradients
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 informationTransmitter optimization for distributed Gaussian MIMO channels
Transmitter optimization for distributed Gaussian MIMO channels Hon-Fah Chong Electrical & Computer Eng Dept National University of Singapore Email: chonghonfah@ieeeorg Mehul Motani Electrical & Computer
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 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 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 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 informationMorning Session Capacity-based Power Control. Department of Electrical and Computer Engineering University of Maryland
Morning Session Capacity-based Power Control Şennur Ulukuş Department of Electrical and Computer Engineering University of Maryland So Far, We Learned... Power control with SIR-based QoS guarantees Suitable
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 informationInput Optimization for Multi-Antenna Broadcast Channels with Per-Antenna Power Constraints
Input Optimization for Multi-Antenna Broadcast Channels with Per-Antenna Power Constraints Tian Lan and Wei Yu Electrical and Computer Engineering Department University of Toronto, Toronto, Ontario M5S
More informationA Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem
2003 Conference on Information Sciences and Systems, The Johns Hopkins University, March 2 4, 2003 A Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem
More informationMultiuser Downlink Beamforming: Rank-Constrained SDP
Multiuser Downlink Beamforming: Rank-Constrained SDP Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2018-19, HKUST, Hong Kong Outline of Lecture
More informationWeighted Sum Rate Optimization for Cognitive Radio MIMO Broadcast Channels
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS (SUBMITTED) Weighted Sum Rate Optimization for Cognitive Radio MIMO Broadcast Channels Lan Zhang, Yan Xin, and Ying-Chang Liang Abstract In this paper, we consider
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationWhen does vectored Multiple Access Channels (MAC) optimal power allocation converge to an FDMA solution?
When does vectored Multiple Access Channels MAC optimal power allocation converge to an FDMA solution? Vincent Le Nir, Marc Moonen, Jan Verlinden, Mamoun Guenach Abstract Vectored Multiple Access Channels
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 informationImproved Sum-Rate Optimization in the Multiuser MIMO Downlink
Improved Sum-Rate Optimization in the Multiuser MIMO Downlin Adam J. Tenenbaum and Raviraj S. Adve Dept. of Electrical and Computer Engineering, University of Toronto 10 King s College Road, Toronto, Ontario,
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 2, FEBRUARY Uplink Downlink Duality Via Minimax Duality. Wei Yu, Member, IEEE (1) (2)
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 2, FEBRUARY 2006 361 Uplink Downlink Duality Via Minimax Duality Wei Yu, Member, IEEE Abstract The sum capacity of a Gaussian vector broadcast channel
More informationIntroduction to Convex Optimization
Introduction to Convex Optimization Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2018-19, HKUST, Hong Kong Outline of Lecture Optimization
More informationOptimization of Multiuser MIMO Networks with Interference
Optimization of Multiuser MIMO Networks with Interference Jia Liu, Y. Thomas Hou, Yi Shi, and Hanif D. Sherali Department of Electrical and Computer Engineering Department of Industrial and Systems Engineering
More informationPOWER ALLOCATION AND OPTIMAL TX/RX STRUCTURES FOR MIMO SYSTEMS
POWER ALLOCATION AND OPTIMAL TX/RX STRUCTURES FOR MIMO SYSTEMS R. Cendrillon, O. Rousseaux and M. Moonen SCD/ESAT, Katholiee Universiteit Leuven, Belgium {raphael.cendrillon, olivier.rousseaux, marc.moonen}@esat.uleuven.ac.be
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 informationMinimax Problems. Daniel P. Palomar. Hong Kong University of Science and Technolgy (HKUST)
Mini Problems Daniel P. Palomar Hong Kong University of Science and Technolgy (HKUST) ELEC547 - Convex Optimization Fall 2009-10, HKUST, Hong Kong Outline of Lecture Introduction Matrix games Bilinear
More informationTransmit Directions and Optimality of Beamforming in MIMO-MAC with Partial CSI at the Transmitters 1
2005 Conference on Information Sciences and Systems, The Johns Hopkins University, March 6 8, 2005 Transmit Directions and Optimality of Beamforming in MIMO-MAC with Partial CSI at the Transmitters Alkan
More informationOptimal Transmit Strategies in MIMO Ricean Channels with MMSE Receiver
Optimal Transmit Strategies in MIMO Ricean Channels with MMSE Receiver E. A. Jorswieck 1, A. Sezgin 1, H. Boche 1 and E. Costa 2 1 Fraunhofer Institute for Telecommunications, Heinrich-Hertz-Institut 2
More informationOn the Capacity of the Multiple Antenna Broadcast Channel
DIMACS Series in Discrete Mathematics and Theoretical Computer Science On the Capacity of the Multiple Antenna Broadcast Channel David Tse and Pramod Viswanath Abstract. The capacity region of the multiple
More informationMajorization Minimization (MM) and Block Coordinate Descent (BCD)
Majorization Minimization (MM) and Block Coordinate Descent (BCD) Wing-Kin (Ken) Ma Department of Electronic Engineering, The Chinese University Hong Kong, Hong Kong ELEG5481, Lecture 15 Acknowledgment:
More informationA Novel Iterative Convex Approximation Method
1 A Novel Iterative Convex Approximation Method Yang Yang and Marius Pesavento Abstract In this paper, we propose a novel iterative convex approximation algorithm to efficiently compute stationary points
More informationWeighted Proportional Fairness Capacity of Gaussian MIMO Broadcast Channels
Weighted Proportional Fairness Capacity of Gaussian MIMO Broadcast Channels Jia Liu and Y Thomas Hou The Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State
More informationEnergy Efficiency Optimization in MIMO Broadcast Channels with Fairness Constraints
Energy Efficiency Optimization in MIMO Broadcast Channels with Fairness Constraints Christoph Hellings and Wolfgang Utschick 14th IEEE International Workshop on Signal Processing Advances for Wireless
More informationSum Capacity of the Vector Gaussian Broadcast Channel and Uplink-Downlink Duality
Sum Capacity of the Vector Gaussian Broadcast Channel and Uplink-Downlink Duality Pramod Viswanath and David Tse March 22, 2003 Abstract We characterize the sum capacity of the vector Gaussian broadcast
More informationOn the Rate Duality of MIMO Interference Channel and its Application to Sum Rate Maximization
On the Rate Duality of MIMO Interference Channel and its Application to Sum Rate Maximization An Liu 1, Youjian Liu 2, Haige Xiang 1 and Wu Luo 1 1 State Key Laboratory of Advanced Optical Communication
More informationOn the Optimality of Beamformer Design for Zero-forcing DPC with QR Decomposition
IEEE ICC 2012 - Communications Theory On the Optimality of Beamformer Design for Zero-forcing DPC with QR Decomposition Le-Nam Tran, Maru Juntti, Mats Bengtsson, and Björn Ottersten Centre for Wireless
More informationELEC E7210: Communication Theory. Lecture 10: MIMO systems
ELEC E7210: Communication Theory Lecture 10: MIMO systems Matrix Definitions, Operations, and Properties (1) NxM matrix a rectangular array of elements a A. an 11 1....... a a 1M. NM B D C E ermitian transpose
More informationCompetition and Cooperation in Multiuser Communication Environments
Competition and Cooperation in Multiuser Communication Environments Wei Yu Electrical Engineering Department Stanford University April, 2002 Wei Yu, Stanford University Introduction A multiuser communication
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 informationTutorial on Convex Optimization: Part II
Tutorial on Convex Optimization: Part II Dr. Khaled Ardah Communications Research Laboratory TU Ilmenau Dec. 18, 2018 Outline Convex Optimization Review Lagrangian Duality Applications Optimal Power Allocation
More informationMULTIPLE-INPUT multiple-output (MIMO) systems
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 10, OCTOBER 2010 4793 Maximum Mutual Information Design for MIMO Systems With Imperfect Channel Knowledge Minhua Ding, Member, IEEE, and Steven D.
More informationMULTIPLE-INPUT Multiple-Output (MIMO) systems
488 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 2, FEBRUARY 2008 On the Capacity of Multiuser MIMO Networks with Interference Jia Liu, Student Member, IEEE, Y. Thomas Hou, Senior Member,
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 informationWIRELESS networking constitutes an important component
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 1, JANUARY 2005 29 On the Capacity of MIMO Relay Channels Bo Wang, Student Member, IEEE, Junshan Zhang, Member, IEEE, and Anders Høst-Madsen, Senior
More informationACHIEVING QOS AND EFFICIENCY IN THE MIMO DOWNLINK WITH LIMITED POWER. Thomas Michel and Gerhard Wunder
ACHIEVING QOS AND EFFICIENCY IN THE MIMO DOWNLINK WITH LIMITED POWER Thomas Michel and Gerhard Wunder Fraunhofer German-Sino Lab Mobile Communications, Heinrich-Hertz-Institut Einstein-Ufer 37, D-587 Berlin
More information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationMulti-User Gain Maximum Eigenmode Beamforming, and IDMA. Peng Wang and Li Ping City University of Hong Kong
Multi-User Gain Maximum Eigenmode Beamforming, and IDMA Peng Wang and Li Ping City University of Hong Kong 1 Contents Introduction Multi-user gain (MUG) Maximum eigenmode beamforming (MEB) MEB performance
More informationGroup Sparse Precoding for Cloud-RAN with Multiple User Antennas
1 Group Sparse Precoding for Cloud-RAN with Multiple User Antennas Zhiyang Liu, Yingxin Zhao, Hong Wu and Shuxue Ding arxiv:1706.01642v2 [cs.it] 24 Feb 2018 Abstract Cloud radio access network C-RAN) has
More informationParallel Additive Gaussian Channels
Parallel Additive Gaussian Channels Let us assume that we have N parallel one-dimensional channels disturbed by noise sources with variances σ 2,,σ 2 N. N 0,σ 2 x x N N 0,σ 2 N y y N Energy Constraint:
More informationMobile Network Energy Efficiency Optimization in MIMO Multi-Cell Systems
1 Mobile Network Energy Efficiency Optimization in MIMO Multi-Cell Systems Yang Yang and Dario Sabella Intel Deutschland GmbH, Neubiberg 85579, Germany. Emails: yang1.yang@intel.com, dario.sabella@intel.com
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 informationMajorization-Minimization Algorithm
Majorization-Minimization Algorithm Theory and Ying Sun and Daniel P. Palomar Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology ELEC 5470 - Convex Optimization
More informationLecture 14: Optimality Conditions for Conic Problems
EE 227A: Conve Optimization and Applications March 6, 2012 Lecture 14: Optimality Conditions for Conic Problems Lecturer: Laurent El Ghaoui Reading assignment: 5.5 of BV. 14.1 Optimality for Conic Problems
More informationMultiple Antennas in Wireless Communications
Multiple Antennas in Wireless Communications Luca Sanguinetti Department of Information Engineering Pisa University luca.sanguinetti@iet.unipi.it April, 2009 Luca Sanguinetti (IET) MIMO April, 2009 1 /
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 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 information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationDistributed MIMO Network Optimization Based on Duality and Local Message Passing
Forty-Seventh Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 30 - October 2, 2009 Distributed MIMO Network Optimization Based on Duality and Local Message Passing An Liu 1, Ashutosh
More informationOptimum Transmission through the Gaussian Multiple Access Channel
Optimum Transmission through the Gaussian Multiple Access Channel Daniel Calabuig Institute of Telecommunications and Multimedia Applications Universidad Politécnica de Valencia Valencia, Spain Email:
More informationThe Capacity Region of the Gaussian MIMO Broadcast Channel
0-0 The Capacity Region of the Gaussian MIMO Broadcast Channel Hanan Weingarten, Yossef Steinberg and Shlomo Shamai (Shitz) Outline Problem statement Background and preliminaries Capacity region of the
More informationfor Multi-Hop Amplify-and-Forward MIMO Relaying Systems
A General Robust Linear Transceiver Design 1 for Multi-Hop Amplify-and-Forward MIMO Relaying Systems Chengwen Xing, Shaodan Ma, Zesong Fei, Yik-Chung Wu and H. Vincent Poor Abstract In this paper, linear
More information1402 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 25, NO. 7, SEPTEMBER 2007
40 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 5, NO. 7, SEPTEMBER 007 Optimum Power Allocation for Single-User MIMO and Multi-User MIMO-MAC with Partial CSI Alkan Soysal, Student Member, IEEE,
More informationSpace-Time Processing for MIMO Communications
Space-Time Processing for MIMO Communications Editors: Alex B. Gershman Dept. of ECE, McMaster University Hamilton, L8S 4K1, Ontario, Canada; & Dept. of Communication Systems, Duisburg-Essen University,
More informationLinear Precoding for Mutual Information Maximization in MIMO Systems
Linear Precoding for Mutual Information Maximization in MIMO Systems Meritxell Lamarca,2 Signal Theory and Communications Department, Technical University of Catalonia, Barcelona (Spain) 2 ECE Department,
More informationErgodic and Outage Capacity of Narrowband MIMO Gaussian Channels
Ergodic and Outage Capacity of Narrowband MIMO Gaussian Channels Yang Wen Liang Department of Electrical and Computer Engineering The University of British Columbia April 19th, 005 Outline of Presentation
More informationOptimized Beamforming and Backhaul Compression for Uplink MIMO Cloud Radio Access Networks
Optimized Beamforming and Bachaul Compression for Uplin MIMO Cloud Radio Access Networs Yuhan Zhou and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, Ontario,
More informationCapacity optimization for Rician correlated MIMO wireless channels
Capacity optimization for Rician correlated MIMO wireless channels Mai Vu, and Arogyaswami Paulraj Information Systems Laboratory, Department of Electrical Engineering Stanford University, Stanford, CA
More informationTransmit Covariance Matrices for Broadcast Channels under Per-Modem Total Power Constraints and Non-Zero Signal to Noise Ratio Gap
1 Transmit Covariance Matrices for Broadcast Channels under Per-Modem Total Power Constraints and Non-Zero Signal to Noise Ratio Gap Vincent Le Nir, Marc Moonen, Jochen Maes, Mamoun Guenach Abstract Finding
More informationNoncooperative Optimization of Space-Time Signals in Ad hoc Networks
Noncooperative Optimization of Space-Time Signals in Ad hoc Networks Ronald A. Iltis and Duong Hoang Dept. of Electrical and Computer Engineering University of California Santa Barbara, CA 93106 {iltis,hoang}@ece.ucsb.edu
More informationDual and primal-dual methods
ELE 538B: Large-Scale Optimization for Data Science Dual and primal-dual methods Yuxin Chen Princeton University, Spring 2018 Outline Dual proximal gradient method Primal-dual proximal gradient method
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 informationLECTURE 18. Lecture outline Gaussian channels: parallel colored noise inter-symbol interference general case: multiple inputs and outputs
LECTURE 18 Last time: White Gaussian noise Bandlimited WGN Additive White Gaussian Noise (AWGN) channel Capacity of AWGN channel Application: DS-CDMA systems Spreading Coding theorem Lecture outline Gaussian
More informationELEC546 MIMO Channel Capacity
ELEC546 MIMO Channel Capacity Vincent Lau Simplified Version.0 //2004 MIMO System Model Transmitter with t antennas & receiver with r antennas. X Transmitted Symbol, received symbol Channel Matrix (Flat
More informationChapter 14 Unconstrained and Constrained Optimization Problems
main def 2011/9/26 15:22 page 480 #511 Chapter 14 Unconstrained and Constrained Optimization Problems Shuguang Cui, Man-Cho Anthony So, and Rui Zhang Texas A&M University, College Station, USA Chinese
More information12.4 Known Channel (Water-Filling Solution)
ECEn 665: Antennas and Propagation for Wireless Communications 54 2.4 Known Channel (Water-Filling Solution) The channel scenarios we have looed at above represent special cases for which the capacity
More informationOptimal Power Allocation for MIMO-MAC in Cognitive Radio Networks
Electronics 2014, 3, 538-552; doi:10.3390/electronics3030538 Article OPEN ACCESS electronics ISSN 2079-9292 www.mdpi.com/journal/electronics Optimal Power Allocation for MIMO-MAC in Cognitive Radio Networks
More informationCompetitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View
JOURNAL OF SELECTED AREAS IN COMMUNICATIONS, VOL.?, NO.?, SEPTEMBER 2008 1 Competitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View Gesualdo Scutari, Member, IEEE, Daniel P. Palomar,
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 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 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 informationIntroduction to Applied Linear Algebra with MATLAB
Sigam Series in Applied Mathematics Volume 7 Rizwan Butt Introduction to Applied Linear Algebra with MATLAB Heldermann Verlag Contents Number Systems and Errors 1 1.1 Introduction 1 1.2 Number Representation
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 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 informationSolution Methods. Richard Lusby. Department of Management Engineering Technical University of Denmark
Solution Methods Richard Lusby Department of Management Engineering Technical University of Denmark Lecture Overview (jg Unconstrained Several Variables Quadratic Programming Separable Programming SUMT
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationOptimization in Wireless Communication
Zhi-Quan (Tom) Luo Department of Electrical and Computer Engineering University of Minnesota 200 Union Street SE Minneapolis, MN 55455 2007 NSF Workshop Challenges Optimization problems from wireless applications
More informationSolving Dual Problems
Lecture 20 Solving Dual Problems We consider a constrained problem where, in addition to the constraint set X, there are also inequality and linear equality constraints. Specifically the minimization problem
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 information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationEE 227A: Convex Optimization and Applications October 14, 2008
EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality Lecturer: Laurent El Ghaoui Reading assignment: Chapter 5 of BV. 13.1 Direct approach 13.1.1 Primal problem Consider
More informationSolution Methods for Stochastic Programs
Solution Methods for Stochastic Programs Huseyin Topaloglu School of Operations Research and Information Engineering Cornell University ht88@cornell.edu August 14, 2010 1 Outline Cutting plane methods
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More information2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE Mai Vu, Student Member, IEEE, and Arogyaswami Paulraj, Fellow, IEEE
2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE 2006 Optimal Linear Precoders for MIMO Wireless Correlated Channels With Nonzero Mean in Space Time Coded Systems Mai Vu, Student Member,
More informationMinimax Duality for MIMO Interference Networks
information Article Minimax Duality for MIMO Interference Networks Andreas Dotzler *, Maximilian Riemensberger and Wolfgang Utschick Associate Institute for Signal Processing, Technische Universität München,
More informationCooperative Diamond Channel With Energy Harvesting Nodes Berk Gurakan, Student Member, IEEE, and Sennur Ulukus, Fellow, IEEE
1604 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 34, NO. 5, MAY 016 Cooperative Diamond Channel With Energy Harvesting Nodes Berk Gurakan, Student Member, IEEE, and Sennur Ulukus, Fellow, IEEE
More informationMIMO Cognitive Radio: A Game Theoretical Approach Gesualdo Scutari, Member, IEEE, and Daniel P. Palomar, Senior Member, IEEE
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 58, NO. 2, FEBRUARY 2010 761 MIMO Cognitive Radio: A Game Theoretical Approach Gesualdo Scutari, Member, IEEE, and Daniel P. Palomar, Senior Member, IEEE Abstract
More informationTHE USE OF optimization methods is ubiquitous in communications
1426 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 24, NO. 8, AUGUST 2006 An Introduction to Convex Optimization for Communications and Signal Processing Zhi-Quan Luo, Senior Member, IEEE, and
More informationQoS Constrained Robust MIMO Transceiver Design Under Unknown Interference
2012 7th International ICST Conference on Communications and Networking in China CHINACOM) 1 os Constrained Robust MIMO Transceiver Design Under Unknown Interference Xin He, Jianwu Chen, and Yik-Chung
More informationInformation Theory for Wireless Communications, Part II:
Information Theory for Wireless Communications, Part II: Lecture 5: Multiuser Gaussian MIMO Multiple-Access Channel Instructor: Dr Saif K Mohammed Scribe: Johannes Lindblom In this lecture, we give the
More information