268 research outputs found
Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks
In this paper, we propose a novel single-group multicasting relay beamforming
scheme. We assume a source that transmits common messages via multiple
amplify-and-forward relays to multiple destinations. To increase the number of
degrees of freedom in the beamforming design, the relays process two received
signals jointly and transmit the Alamouti space-time block code over two
different beams. Furthermore, in contrast to the existing relay multicasting
scheme of the literature, we take into account the direct links from the source
to the destinations. We aim to maximize the lowest received quality-of-service
by choosing the proper relay weights and the ideal distribution of the power
resources in the network. To solve the corresponding optimization problem, we
propose an iterative algorithm which solves sequences of convex approximations
of the original non-convex optimization problem. Simulation results demonstrate
significant performance improvements of the proposed methods as compared with
the existing relay multicasting scheme of the literature and an algorithm based
on the popular semidefinite relaxation technique
Constructive Multiuser Interference in Symbol Level Precoding for the MISO Downlink Channel
This paper investigates the problem of interference among the simultaneous
multiuser transmissions in the downlink of multiple antennas systems. Using
symbol level precoding, a new approach towards the multiuser interference is
discussed along this paper. The concept of exploiting the interference between
the spatial multiuser transmissions by jointly utilizing the data information
(DI) and channel state information (CSI), in order to design symbol-level
precoders, is proposed. In this direction, the interference among the data
streams is transformed under certain conditions to useful signal that can
improve the signal to interference noise ratio (SINR) of the downlink
transmissions. We propose a maximum ratio transmission (MRT) based algorithm
that jointly exploits DI and CSI to glean the benefits from constructive
multiuser interference. Subsequently, a relation between the constructive
interference downlink transmission and physical layer multicasting is
established. In this context, novel constructive interference precoding
techniques that tackle the transmit power minimization (min power) with
individual SINR constraints at each user's receivers is proposed. Furthermore,
fairness through maximizing the weighted minimum SINR (max min SINR) of the
users is addressed by finding the link between the min power and max min SINR
problems. Moreover, heuristic precoding techniques are proposed to tackle the
weighted sum rate problem. Finally, extensive numerical results show that the
proposed schemes outperform other state of the art techniques.Comment: Submitted to IEEE Transactions on Signal Processin
Precoder Design for Physical Layer Multicasting
This paper studies the instantaneous rate maximization and the weighted sum
delay minimization problems over a K-user multicast channel, where multiple
antennas are available at the transmitter as well as at all the receivers.
Motivated by the degree of freedom optimality and the simplicity offered by
linear precoding schemes, we consider the design of linear precoders using the
aforementioned two criteria. We first consider the scenario wherein the linear
precoder can be any complex-valued matrix subject to rank and power
constraints. We propose cyclic alternating ascent based precoder design
algorithms and establish their convergence to respective stationary points.
Simulation results reveal that our proposed algorithms considerably outperform
known competing solutions. We then consider a scenario in which the linear
precoder can be formed by selecting and concatenating precoders from a given
finite codebook of precoding matrices, subject to rank and power constraints.
We show that under this scenario, the instantaneous rate maximization problem
is equivalent to a robust submodular maximization problem which is strongly NP
hard. We propose a deterministic approximation algorithm and show that it
yields a bicriteria approximation. For the weighted sum delay minimization
problem we propose a simple deterministic greedy algorithm, which at each step
entails approximately maximizing a submodular set function subject to multiple
knapsack constraints, and establish its performance guarantee.Comment: 37 pages, 8 figures, submitted to IEEE Trans. Signal Pro
Optimal and Robust Transmit Designs for MISO Channel Secrecy by Semidefinite Programming
In recent years there has been growing interest in study of multi-antenna
transmit designs for providing secure communication over the physical layer.
This paper considers the scenario of an intended multi-input single-output
channel overheard by multiple multi-antenna eavesdroppers. Specifically, we
address the transmit covariance optimization for secrecy-rate maximization
(SRM) of that scenario. The challenge of this problem is that it is a nonconvex
optimization problem. This paper shows that the SRM problem can actually be
solved in a convex and tractable fashion, by recasting the SRM problem as a
semidefinite program (SDP). The SRM problem we solve is under the premise of
perfect channel state information (CSI). This paper also deals with the
imperfect CSI case. We consider a worst-case robust SRM formulation under
spherical CSI uncertainties, and we develop an optimal solution to it, again
via SDP. Moreover, our analysis reveals that transmit beamforming is generally
the optimal transmit strategy for SRM of the considered scenario, for both the
perfect and imperfect CSI cases. Simulation results are provided to illustrate
the secrecy-rate performance gains of the proposed SDP solutions compared to
some suboptimal transmit designs.Comment: 32 pages, 5 figures; to appear, IEEE Transactions on Signal
Processing, 201
Multicast Multigroup Precoding and User Scheduling for Frame-Based Satellite Communications
The present work focuses on the forward link of a broadband multibeam
satellite system that aggressively reuses the user link frequency resources.
Two fundamental practical challenges, namely the need to frame multiple users
per transmission and the per-antenna transmit power limitations, are addressed.
To this end, the so-called frame-based precoding problem is optimally solved
using the principles of physical layer multicasting to multiple co-channel
groups under per-antenna constraints. In this context, a novel optimization
problem that aims at maximizing the system sum rate under individual power
constraints is proposed. Added to that, the formulation is further extended to
include availability constraints. As a result, the high gains of the sum rate
optimal design are traded off to satisfy the stringent availability
requirements of satellite systems. Moreover, the throughput maximization with a
granular spectral efficiency versus SINR function, is formulated and solved.
Finally, a multicast-aware user scheduling policy, based on the channel state
information, is developed. Thus, substantial multiuser diversity gains are
gleaned. Numerical results over a realistic simulation environment exhibit as
much as 30% gains over conventional systems, even for 7 users per frame,
without modifying the framing structure of legacy communication standards.Comment: Accepted for publication to the IEEE Transactions on Wireless
Communications, 201
- …