612 research outputs found
General Rank Multiuser Downlink Beamforming With Shaping Constraints Using Real-valued OSTBC
In this paper we consider optimal multiuser downlink beamforming in the
presence of a massive number of arbitrary quadratic shaping constraints. We
combine beamforming with full-rate high dimensional real-valued orthogonal
space time block coding (OSTBC) to increase the number of beamforming weight
vectors and associated degrees of freedom in the beamformer design. The
original multi-constraint beamforming problem is converted into a convex
optimization problem using semidefinite relaxation (SDR) which can be solved
efficiently. In contrast to conventional (rank-one) beamforming approaches in
which an optimal beamforming solution can be obtained only when the SDR
solution (after rank reduction) exhibits the rank-one property, in our approach
optimality is guaranteed when a rank of eight is not exceeded. We show that our
approach can incorporate up to 79 additional shaping constraints for which an
optimal beamforming solution is guaranteed as compared to a maximum of two
additional constraints that bound the conventional rank-one downlink
beamforming designs. Simulation results demonstrate the flexibility of our
proposed beamformer design
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
Out-sphere decoder for non-coherent ML SIMO detection and its expected complexity
In multi-antenna communication systems, channel information
is often not known at the receiver. To fully exploit
the bandwidth resources of the system and ensure the practical
feasibility of the receiver, the channel parameters are
often estimated and then employed in the design of signal
detection algorithms. However, sometimes communication
can occur in an environment where learning the channel coefficients
becomes infeasible. In this paper we consider the
problem of maximum-likelihood (ML)-detection in singleinput
multiple-output (SIMO) systems when the channel information
is completely unavailable at the receiver and when
the employed signalling at the transmitter is q-PSK. It is
well known that finding the solution to this optimization requires
solving an integer maximization of a quadratic form
and is, in general, an NP hard problem. To solve it, we propose
an exact algorithm based on the combination of branch
and bound tree search and semi-definite program (SDP) relaxation.
The algorithm resembles the standard sphere decoder
except that, since we are maximizing we need to construct
an upper bound at each level of the tree search. We
derive an analytical upper bound on the expected complexity
of the proposed algorithm
- …