3,771 research outputs found
A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design
We propose an algorithm with expected complexity of \bigO(n\log n)
arithmetic operations to solve a special shortest vector problem arising in
computer-and-forward design, where is the dimension of the channel vector.
This algorithm is more efficient than the best known algorithms with proved
complexity.Comment: It has been submitted to ISIT 201
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
Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks
A model, called the linear transform network (LTN), is proposed to analyze
the compression and estimation of correlated signals transmitted over directed
acyclic graphs (DAGs). An LTN is a DAG network with multiple source and
receiver nodes. Source nodes transmit subspace projections of random correlated
signals by applying reduced-dimension linear transforms. The subspace
projections are linearly processed by multiple relays and routed to intended
receivers. Each receiver applies a linear estimator to approximate a subset of
the sources with minimum mean squared error (MSE) distortion. The model is
extended to include noisy networks with power constraints on transmitters. A
key task is to compute all local compression matrices and linear estimators in
the network to minimize end-to-end distortion. The non-convex problem is solved
iteratively within an optimization framework using constrained quadratic
programs (QPs). The proposed algorithm recovers as special cases the regular
and distributed Karhunen-Loeve transforms (KLTs). Cut-set lower bounds on the
distortion region of multi-source, multi-receiver networks are given for linear
coding based on convex relaxations. Cut-set lower bounds are also given for any
coding strategy based on information theory. The distortion region and
compression-estimation tradeoffs are illustrated for different communication
demands (e.g. multiple unicast), and graph structures.Comment: 33 pages, 7 figures, To appear in IEEE Transactions on Signal
Processin
Multi-Pair Two-Way Relay Network with Harvest-Then-Transmit Users: Resolving Pairwise Uplink-Downlink Coupling
While two-way relaying is a promising way to enhance the spectral efficiency
of wireless networks, the imbalance of relay-user distances may lead to
excessive wireless power at the nearby-users. To exploit the excessive power,
the recently proposed harvest-then-transmit technique can be applied. However,
it is well-known that harvest-then-transmit introduces uplink-downlink coupling
for a user. Together with the co-dependent relationship between paired users
and interference among multiple user pairs, wirelessly powered two-way relay
network suffers from the unique pairwise uplink-downlink coupling, and the
joint uplink-downlink network design is nontrivial. To this end, for the one
pair users case, we show that a global optimal solution can be obtained. For
the general case of multi-pair users, based on the rank-constrained difference
of convex program, a convergence guaranteed iterative algorithm with an
efficient initialization is proposed. Furthermore, a lower bound to the
performance of the optimal solution is derived by introducing virtual receivers
at relay. Numerical results on total transmit power show that the proposed
algorithm achieves a transmit power value close to the lower bound
Linear Precoding Designs for Amplify-and-Forward Multiuser Two-Way Relay Systems
Two-way relaying can improve spectral efficiency in two-user cooperative
communications. It also has great potential in multiuser systems. A major
problem of designing a multiuser two-way relay system (MU-TWRS) is transceiver
or precoding design to suppress co-channel interference. This paper aims to
study linear precoding designs for a cellular MU-TWRS where a multi-antenna
base station (BS) conducts bi-directional communications with multiple mobile
stations (MSs) via a multi-antenna relay station (RS) with amplify-and-forward
relay strategy. The design goal is to optimize uplink performance, including
total mean-square error (Total-MSE) and sum rate, while maintaining individual
signal-to-interference-plus-noise ratio (SINR) requirement for downlink
signals. We show that the BS precoding design with the RS precoder fixed can be
converted to a standard second order cone programming (SOCP) and the optimal
solution is obtained efficiently. The RS precoding design with the BS precoder
fixed, on the other hand, is non-convex and we present an iterative algorithm
to find a local optimal solution. Then, the joint BS-RS precoding is obtained
by solving the BS precoding and the RS precoding alternately. Comprehensive
simulation is conducted to demonstrate the effectiveness of the proposed
precoding designs.Comment: 13 pages, 12 figures, Accepted by IEEE TW
- …