Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TVT.2010.2049868
Title: | Robust downlink beamforming in multiuser MISO cognitive radio networks with imperfect channel-state information | Authors: | Gharavol, E.A. Liang, Y.-C. Mouthaan, K. |
Keywords: | Cognitive radio network (CR-Net) imperfect channel-state information (CSI) multiuser multiple-inputsingle-output (MISO) communication robust beamforming worst-case design |
Issue Date: | Jul-2010 | Citation: | Gharavol, E.A., Liang, Y.-C., Mouthaan, K. (2010-07). Robust downlink beamforming in multiuser MISO cognitive radio networks with imperfect channel-state information. IEEE Transactions on Vehicular Technology 59 (6) : 2852-2860. ScholarBank@NUS Repository. https://doi.org/10.1109/TVT.2010.2049868 | Abstract: | This paper studies the problem of robust downlink beamforming design in a multiuser multiple-inputsingle-output (MISO) cognitive radio network (CR-Net) in which multiple secondary users (SUs) coexist with multiple primary users (PUs) of a single-cell primary radio network (PR-Net). It is assumed that the channel-state information (CSI) for all relevant channels is imperfectly known, and the imperfectness of the CSI is modeled using a Euclidean ball-shaped uncertainty set. Our design objective is to minimize the transmit power of the SU-Transmitter (SU-Tx) while simultaneously achieving a lower bound on the received signal-to-interference-plus-noise ratio (SINR) for the SUs and imposing an upper limit on the interference power (IP) at the PUs. The design parameters at the SU-Tx are the beamforming weights, and the proposed methodology to solve the problem is based on the worst-case design scenario through which the performance metrics of the design are immune to variations in the channels. The original problem is a separable homogeneous quadratically constrained quadratic problem (QCQP), which is an NP-hard problem, even for uncertain CSI. We reformulate our original design problem to a relaxed semidefinite program (SDP) and then investigate three different approaches based on convex programming. Finally, simulation results are provided to validate the robustness of the proposed methods. © 2006 IEEE. | Source Title: | IEEE Transactions on Vehicular Technology | URI: | http://scholarbank.nus.edu.sg/handle/10635/57299 | ISSN: | 00189545 | DOI: | 10.1109/TVT.2010.2049868 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.