1,162 research outputs found
A Modified Levenberg-Marquardt Method for the Bidirectional Relay Channel
This paper presents an optimization approach for a system consisting of
multiple bidirectional links over a two-way amplify-and-forward relay. It is
desired to improve the fairness of the system. All user pairs exchange
information over one relay station with multiple antennas. Due to the joint
transmission to all users, the users are subject to mutual interference. A
mitigation of the interference can be achieved by max-min fair precoding
optimization where the relay is subject to a sum power constraint. The
resulting optimization problem is non-convex. This paper proposes a novel
iterative and low complexity approach based on a modified Levenberg-Marquardt
method to find near optimal solutions. The presented method finds solutions
close to the standard convex-solver based relaxation approach.Comment: submitted to IEEE Transactions on Vehicular Technology We corrected
small mistakes in the proof of Lemma 2 and Proposition
Joint Bandwidth and Power Allocation with Admission Control in Wireless Multi-User Networks With and Without Relaying
Equal allocation of bandwidth and/or power may not be efficient for wireless
multi-user networks with limited bandwidth and power resources. Joint bandwidth
and power allocation strategies for wireless multi-user networks with and
without relaying are proposed in this paper for (i) the maximization of the sum
capacity of all users; (ii) the maximization of the worst user capacity; and
(iii) the minimization of the total power consumption of all users. It is shown
that the proposed allocation problems are convex and, therefore, can be solved
efficiently. Moreover, the admission control based joint bandwidth and power
allocation is considered. A suboptimal greedy search algorithm is developed to
solve the admission control problem efficiently. The conditions under which the
greedy search is optimal are derived and shown to be mild. The performance
improvements offered by the proposed joint bandwidth and power allocation are
demonstrated by simulations. The advantages of the suboptimal greedy search
algorithm for admission control are also shown.Comment: 30 pages, 5 figures, submitted to IEEE Trans. Signal Processing in
June 201
Joint Source and Relay Precoding Designs for MIMO Two-Way Relaying Based on MSE Criterion
Properly designed precoders can significantly improve the spectral efficiency
of multiple-input multiple-output (MIMO) relay systems. In this paper, we
investigate joint source and relay precoding design based on the
mean-square-error (MSE) criterion in MIMO two-way relay systems, where two
multi-antenna source nodes exchange information via a multi-antenna
amplify-and-forward relay node. This problem is non-convex and its optimal
solution remains unsolved. Aiming to find an efficient way to solve the
problem, we first decouple the primal problem into three tractable
sub-problems, and then propose an iterative precoding design algorithm based on
alternating optimization. The solution to each sub-problem is optimal and
unique, thus the convergence of the iterative algorithm is guaranteed.
Secondly, we propose a structured precoding design to lower the computational
complexity. The proposed precoding structure is able to parallelize the
channels in the multiple access (MAC) phase and broadcast (BC) phase. It thus
reduces the precoding design to a simple power allocation problem. Lastly, for
the special case where only a single data stream is transmitted from each
source node, we present a source-antenna-selection (SAS) based precoding design
algorithm. This algorithm selects only one antenna for transmission from each
source and thus requires lower signalling overhead. Comprehensive simulation is
conducted to evaluate the effectiveness of all the proposed precoding designs.Comment: 32 pages, 10 figure
- …