12,234 research outputs found
Robust Adaptive Beamforming for General-Rank Signal Model with Positive Semi-Definite Constraint via POTDC
The robust adaptive beamforming (RAB) problem for general-rank signal model
with an additional positive semi-definite constraint is considered. Using the
principle of the worst-case performance optimization, such RAB problem leads to
a difference-of-convex functions (DC) optimization problem. The existing
approaches for solving the resulted non-convex DC problem are based on
approximations and find only suboptimal solutions. Here we solve the non-convex
DC problem rigorously and give arguments suggesting that the solution is
globally optimal. Particularly, we rewrite the problem as the minimization of a
one-dimensional optimal value function whose corresponding optimization problem
is non-convex. Then, the optimal value function is replaced with another
equivalent one, for which the corresponding optimization problem is convex. The
new one-dimensional optimal value function is minimized iteratively via
polynomial time DC (POTDC) algorithm.We show that our solution satisfies the
Karush-Kuhn-Tucker (KKT) optimality conditions and there is a strong evidence
that such solution is also globally optimal. Towards this conclusion, we
conjecture that the new optimal value function is a convex function. The new
RAB method shows superior performance compared to the other state-of-the-art
general-rank RAB methods.Comment: 29 pages, 7 figures, 2 tables, Submitted to IEEE Trans. Signal
Processing on August 201
Towards Fast-Convergence, Low-Delay and Low-Complexity Network Optimization
Distributed network optimization has been studied for well over a decade.
However, we still do not have a good idea of how to design schemes that can
simultaneously provide good performance across the dimensions of utility
optimality, convergence speed, and delay. To address these challenges, in this
paper, we propose a new algorithmic framework with all these metrics
approaching optimality. The salient features of our new algorithm are
three-fold: (i) fast convergence: it converges with only
iterations that is the fastest speed among all the existing algorithms; (ii)
low delay: it guarantees optimal utility with finite queue length; (iii) simple
implementation: the control variables of this algorithm are based on virtual
queues that do not require maintaining per-flow information. The new technique
builds on a kind of inexact Uzawa method in the Alternating Directional Method
of Multiplier, and provides a new theoretical path to prove global and linear
convergence rate of such a method without requiring the full rank assumption of
the constraint matrix
Directional Modulation via Symbol-Level Precoding: A Way to Enhance Security
Wireless communication provides a wide coverage at the cost of exposing
information to unintended users. As an information-theoretic paradigm, secrecy
rate derives bounds for secure transmission when the channel to the
eavesdropper is known. However, such bounds are shown to be restrictive in
practice and may require exploitation of specialized coding schemes. In this
paper, we employ the concept of directional modulation and follow a signal
processing approach to enhance the security of multi-user MIMO communication
systems when a multi-antenna eavesdropper is present. Enhancing the security is
accomplished by increasing the symbol error rate at the eavesdropper. Unlike
the information-theoretic secrecy rate paradigm, we assume that the legitimate
transmitter is not aware of its channel to the eavesdropper, which is a more
realistic assumption. We examine the applicability of MIMO receiving algorithms
at the eavesdropper. Using the channel knowledge and the intended symbols for
the users, we design security enhancing symbol-level precoders for different
transmitter and eavesdropper antenna configurations. We transform each design
problem to a linearly constrained quadratic program and propose two solutions,
namely the iterative algorithm and one based on non-negative least squares, at
each scenario for a computationally-efficient modulation. Simulation results
verify the analysis and show that the designed precoders outperform the
benchmark scheme in terms of both power efficiency and security enhancement.Comment: This manuscript is submitted to IEEE Journal of Selected Topics in
Signal Processin
Particle Density Estimation with Grid-Projected Adaptive Kernels
The reconstruction of smooth density fields from scattered data points is a
procedure that has multiple applications in a variety of disciplines, including
Lagrangian (particle-based) models of solute transport in fluids. In random
walk particle tracking (RWPT) simulations, particle density is directly linked
to solute concentrations, which is normally the main variable of interest, not
just for visualization and post-processing of the results, but also for the
computation of non-linear processes, such as chemical reactions. Previous works
have shown the superiority of kernel density estimation (KDE) over other
methods such as binning, in terms of its ability to accurately estimate the
"true" particle density relying on a limited amount of information. Here, we
develop a grid-projected KDE methodology to determine particle densities by
applying kernel smoothing on a pilot binning; this may be seen as a "hybrid"
approach between binning and KDE. The kernel bandwidth is optimized locally.
Through simple implementation examples, we elucidate several appealing aspects
of the proposed approach, including its computational efficiency and the
possibility to account for typical boundary conditions, which would otherwise
be cumbersome in conventional KDE
- …