• DocumentCode
    1756352
  • Title

    Beamforming Duality and Algorithms for Weighted Sum Rate Maximization in Cognitive Radio Networks

  • Author

    I-Wei Lai ; Liang Zheng ; Chia-Han Lee ; Chee Wei Tan

  • Author_Institution
    Res. Center for Inf. Technol. Innovation, Taipei, Taiwan
  • Volume
    33
  • Issue
    5
  • fYear
    2015
  • fDate
    42125
  • Firstpage
    832
  • Lastpage
    847
  • Abstract
    In this paper, we investigate the joint design of transmit beamforming and power control to maximize the weighted sum rate in the multiple-input single-output (MISO) cognitive radio network constrained by arbitrary power budgets and interference temperatures. The nonnegativity of the physical quantities, e.g., channel parameters, powers, and rates, is exploited to enable key tools in nonnegative matrix theory, such as the (linear and nonlinear) Perron-Frobenius theory, quasi-invertibility, and Friedland-Karlin inequalities, to tackle this nonconvex problem. Under certain (quasi-invertibility) sufficient conditions, we propose a tight convex relaxation technique that relaxes multiple constraints to bound the global optimal value in a systematic way. Then, a single-input multiple-output (SIMO)-MISO duality is established through a virtual dual SIMO network and Lagrange duality. This SIMO-MISO duality proved to have the zero duality gap that connects the optimality conditions of the primal MISO network and the virtual dual SIMO network. Moreover, by exploiting the SIMO-MISO duality, an algorithm is developed to optimally solve the sum rate maximization problem. Numerical examples demonstrate the computational efficiency of our algorithm, when the number of transmit antennas is large.
  • Keywords
    antenna radiation patterns; array signal processing; cognitive radio; concave programming; convex programming; duality (mathematics); matrix algebra; relaxation theory; transmitting antennas; Lagrange duality; SIMO-MISO duality; beamforming duality; beamforming transmission; multiple input single output cognitive radio network; nonconvex problem; nonnegative matrix theory; power control; single input multiple output cognitive radio network; tight convex relaxation technique; transmitting antennas; weighted sum rate maximization; zero duality gap; Algorithm design and analysis; Array signal processing; Cognitive radio; Interference; Joints; Optimization; Vectors; Karush- Kuhn-Tucker conditions; Karush-Kuhn-Tucker conditions; Optimization; Perron-Frobenius theorem; Perron???Frobenius theorem; cognitive radio network; convex relaxation; nonnegative matrix theory; quasi-invertibility;
  • fLanguage
    English
  • Journal_Title
    Selected Areas in Communications, IEEE Journal on
  • Publisher
    ieee
  • ISSN
    0733-8716
  • Type

    jour

  • DOI
    10.1109/JSAC.2014.2361079
  • Filename
    6913500