1,023 research outputs found
Massive MIMO Multicasting in Noncooperative Cellular Networks
We study the massive multiple-input multiple-output (MIMO) multicast
transmission in cellular networks where each base station (BS) is equipped with
a large-scale antenna array and transmits a common message using a single
beamformer to multiple mobile users. We first show that when each BS knows the
perfect channel state information (CSI) of its own served users, the
asymptotically optimal beamformer at each BS is a linear combination of the
channel vectors of its multicast users. Moreover, the optimal combining
coefficients are obtained in closed form. Then we consider the imperfect CSI
scenario where the CSI is obtained through uplink channel estimation in
timedivision duplex systems. We propose a new pilot scheme that estimates the
composite channel which is a linear combination of the individual channels of
multicast users in each cell. This scheme is able to completely eliminate pilot
contamination. The pilot power control for optimizing the multicast beamformer
at each BS is also derived. Numerical results show that the asymptotic
performance of the proposed scheme is close to the ideal case with perfect CSI.
Simulation also verifies the effectiveness of the proposed scheme with finite
number of antennas at each BS.Comment: to appear in IEEE JSAC Special Issue on 5G Wireless Communication
System
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
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
- …