IEEE Transactions on Cognitive Communications and Networking · 2015 · 11 citations · 43 references
EngineeringCommunicationElectrical EngineeringComputer NetworksDigital CommunicationWireless CommunicationsBeamformingCognitive RadioCommunication NetworksInterference ManagementWireless Channel ModelingWireless NetworksBeamforming TechniquesRelay NetworksRelay-assisted CommunicationSpectral EfficiencySpectrum UtilizationTwo-way RelayingUnderlay NetworkingUnderlay Networks
This paper studies an underlay cognitive network consisting of a two-way amplify-and-forward (AF) relay and two multiantenna terminals (SU <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and SU <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> ). Despite enhanced spectral efficiency and spectrum utilization, the underlay network is limited by low power transmissions and short coverage owing to secondary-to-primary (S2P) and primary-to-secondary (P2S) interference. To alleviate these, we consider beamforming at SU <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and SU <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> . However, concurrent bidirectional transmissions with the two-way relay complicates beamforming and power allocation. Nevertheless, we use the performance criterion of maximizing the worse received signal-to-interference-and-noise ratio (SINR) at SU <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and SU <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> . The resulting maximization problem for the optimal beamforming vectors and power allocation is a nonconvex quadratically constraint quadratic program (QCQP), which is NP-hard. Thus, we develop an iterative bisection search, but determining its feasibility at each iteration is still a nonconvex NP-hard QCQP. We thus generate two equivalent interference minimization problems, which we solve by semidefinite relaxation (SDR). Simulation results show that our proposed optimal design improves SINR by as much as 20 dB. We also propose suboptimal maximal-ratio-transmission (MRT) and zero-forcing beamforming and maximal-ratio-transmission (ZFB-MRT), and develop their optimal power allocations. Importantly, the performance loss due to these suboptimal strategies is modest (e.g., as low as 1 dB for ZFB-MRT with optimal power allocation).
43
Numerical recipes in C: the art of scientific computing
Choice Reviews Online · 1993 · 18.1K citations · Full text
Semidefinite Relaxation of Quadratic Optimization Problems
Zhi‐Quan Luo, Wing‐Kin Ma, Anthony Man–Cho So et al. · IEEE Signal Processing Magazine · 2010 · 3.6K citations
T. Lo · IEEE Transactions on Communications · 1999 · 985 citations