850 research outputs found
On low complexity robust beamforming with positive semidefinite constraints
This paper addresses the problem of robust beamforming for general-rank signal models with norm bounded uncertainties in the desired and received signal covariance matrices as well as positive semidefinite constraints on the covariance matrices. Two novel minimum variance robust beamformers are derived in closed-form. The first one basically is the closed-form version of an existing iterative algorithm, while the second one offers even better performance with respect to the first one. Both of them have the advantage of low complexity. The effectiveness and performance improvement of the proposed beamformers are verified by simulation results. © 2009 IEEE.published_or_final_versio
Weighted Fair Multicast Multigroup Beamforming under Per-antenna Power Constraints
A multi-antenna transmitter that conveys independent sets of common data to
distinct groups of users is considered. This model is known as physical layer
multicasting to multiple co-channel groups. In this context, the practical
constraint of a maximum permitted power level radiated by each antenna is
addressed. The per-antenna power constrained system is optimized in a maximum
fairness sense with respect to predetermined quality of service weights. In
other words, the worst scaled user is boosted by maximizing its weighted
signal-to-interference plus noise ratio. A detailed solution to tackle the
weighted max-min fair multigroup multicast problem under per-antenna power
constraints is therefore derived. The implications of the novel constraints are
investigated via prominent applications and paradigms. What is more, robust
per-antenna constrained multigroup multicast beamforming solutions are
proposed. Finally, an extensive performance evaluation quantifies the gains of
the proposed algorithm over existing solutions and exhibits its accuracy over
per-antenna power constrained systems.Comment: Under review in IEEE Transactions in Signal Processin
Beamforming Techniques for Non-Orthogonal Multiple Access in 5G Cellular Networks
In this paper, we develop various beamforming techniques for downlink
transmission for multiple-input single-output (MISO) non-orthogonal multiple
access (NOMA) systems. First, a beamforming approach with perfect channel state
information (CSI) is investigated to provide the required quality of service
(QoS) for all users. Taylor series approximation and semidefinite relaxation
(SDR) techniques are employed to reformulate the original non-convex power
minimization problem to a tractable one. Further, a fairness-based beamforming
approach is proposed through a max-min formulation to maintain fairness between
users. Next, we consider a robust scheme by incorporating channel
uncertainties, where the transmit power is minimized while satisfying the
outage probability requirement at each user. Through exploiting the SDR
approach, the original non-convex problem is reformulated in a linear matrix
inequality (LMI) form to obtain the optimal solution. Numerical results
demonstrate that the robust scheme can achieve better performance compared to
the non-robust scheme in terms of the rate satisfaction ratio. Further,
simulation results confirm that NOMA consumes a little over half transmit power
needed by OMA for the same data rate requirements. Hence, NOMA has the
potential to significantly improve the system performance in terms of transmit
power consumption in future 5G networks and beyond.Comment: accepted to publish in IEEE Transactions on Vehicular Technolog
Robust Transceiver Design for MISO Interference Channel with Energy Harvesting
In this paper, we consider multiuser multiple-input single-output (MISO)
interference channel where the received signal is divided into two parts for
information decoding and energy harvesting (EH), respectively. The transmit
beamforming vectors and receive power splitting (PS) ratios are jointly
designed in order to minimize the total transmission power subject to both
signal-to-interference-plus-noise ratio (SINR) and EH constraints. Most joint
beamforming and power splitting (JBPS) designs assume that perfect channel
state information (CSI) is available; however CSI errors are inevitable in
practice. To overcome this limitation, we study the robust JBPS design problem
assuming a norm-bounded error (NBE) model for the CSI. Three different solution
approaches are proposed for the robust JBPS problem, each one leading to a
different computational algorithm. Firstly, an efficient semidefinite
relaxation (SDR)-based approach is presented to solve the highly non-convex
JBPS problem, where the latter can be formulated as a semidefinite programming
(SDP) problem. A rank-one recovery method is provided to recover a robust
feasible solution to the original problem. Secondly, based on second order cone
programming (SOCP) relaxation, we propose a low complexity approach with the
aid of a closed-form robust solution recovery method. Thirdly, a new iterative
method is also provided which can achieve near-optimal performance when the
SDR-based algorithm results in a higher-rank solution. We prove that this
iterative algorithm monotonically converges to a Karush-Kuhn-Tucker (KKT)
solution of the robust JBPS problem. Finally, simulation results are presented
to validate the robustness and efficiency of the proposed algorithms.Comment: 13 pages, 8 figures. arXiv admin note: text overlap with
arXiv:1407.0474 by other author
- …