Beamforming duality and algorithms for weighted sum rate maximization in cognitive radio networks

Keyphrases

• Cognitive Radio Networks 100%
• Beamforming 100%
• Multiple-input Single-output 100%
• Sum-rate Maximization 100%
• Single-input multiple-output 100%
• Output Network 60%
• Quasi-invertibility 40%
• Numerical Examples 20%
• Tight 20%
• Physical Quantity 20%
• Power Control 20%
• Computational Efficiency 20%
• Transmit Power 20%
• Global Optimal Solution 20%
• Channel Rate 20%
• Channel Power 20%
• Power Budget 20%
• Transmit Beamforming 20%
• Number of Transmit Antennas 20%
• Maximization Problem 20%
• Optimality Conditions 20%
• Joint Design 20%
• Channel Parameters 20%
• Multiple Constraints 20%
• Interference Temperature 20%
• Non-negativity 20%
• Lagrange Duality 20%
• Power Interference 20%
• Arbitrary Power 20%
• Constrained Networks 20%
• Nonnegative Matrix Theory 20%
• Weighted Sum Rate 20%
• Zero Duality Gap 20%
• Convex Relaxation Technique 20%
• Nonconvex Problem 20%
• Network Duality 20%
• Nonlinear Perron-Frobenius Theory 20%

Engineering

• Cognitive Radio Networks 100%
• Single Output 100%
• Sum-Rate Maximization 100%
• Beamforming 100%
• Input Multiple 80%
• Multiple-Input Multiple-Output 60%
• Invertibility 40%
• Optimality 20%
• Power Budget 20%
• Antenna 20%
• Power Control 20%
• Numerical Example 20%
• Sufficient Condition 20%
• Matrix Theory 20%
• Computational Efficiency 20%
• Optimal Value 20%
• Lagrange 20%
• Joint Design 20%
• Channel Parameter 20%
• Interference Temperature 20%
• Nonnegativity 20%
• Multiple Constraint 20%
• Physical Quantity 20%

Computer Science

• multiple-input-multiple-output 100%
• sum rate 100%
• Cognitive Radio Network 100%
• Numerical Example 33%
• Computational Efficiency 33%
• Sufficient Condition 33%
• Transmit Antenna 33%
• Channel Parameter 33%
• Convex Relaxation 33%
• Optimality Condition 33%
• Arbitrary Power 33%
• Physical Quantity 33%