1,386 research outputs found
Optimal Estimation via Nonanticipative Rate Distortion Function and Applications to Time-Varying Gauss-Markov Processes
In this paper, we develop {finite-time horizon} causal filters using the
nonanticipative rate distortion theory. We apply the {developed} theory to
{design optimal filters for} time-varying multidimensional Gauss-Markov
processes, subject to a mean square error fidelity constraint. We show that
such filters are equivalent to the design of an optimal \texttt{\{encoder,
channel, decoder\}}, which ensures that the error satisfies {a} fidelity
constraint. Moreover, we derive a universal lower bound on the mean square
error of any estimator of time-varying multidimensional Gauss-Markov processes
in terms of conditional mutual information. Unlike classical Kalman filters,
the filter developed is characterized by a reverse-waterfilling algorithm,
which ensures {that} the fidelity constraint is satisfied. The theoretical
results are demonstrated via illustrative examples.Comment: 35 pages, 6 figures, submitted for publication in SIAM Journal on
Control and Optimization (SICON
An Algorithm for Global Maximization of Secrecy Rates in Gaussian MIMO Wiretap Channels
Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap
channels is considered. While this channel has attracted a significant
attention recently and a number of results have been obtained, including the
proof of the optimality of Gaussian signalling, an optimal transmit covariance
matrix is known for some special cases only and the general case remains an
open problem. An iterative custom-made algorithm to find a globally-optimal
transmit covariance matrix in the general case is developed in this paper, with
guaranteed convergence to a \textit{global} optimum. While the original
optimization problem is not convex and hence difficult to solve, its minimax
reformulation can be solved via the convex optimization tools, which is
exploited here. The proposed algorithm is based on the barrier method extended
to deal with a minimax problem at hand. Its convergence to a global optimum is
proved for the general case (degraded or not) and a bound for the optimality
gap is given for each step of the barrier method. The performance of the
algorithm is demonstrated via numerical examples. In particular, 20 to 40
Newton steps are already sufficient to solve the sufficient optimality
conditions with very high precision (up to the machine precision level), even
for large systems. Even fewer steps are required if the secrecy capacity is the
only quantity of interest. The algorithm can be significantly simplified for
the degraded channel case and can also be adopted to include the per-antenna
power constraints (instead or in addition to the total power constraint). It
also solves the dual problem of minimizing the total power subject to the
secrecy rate constraint.Comment: accepted by IEEE Transactions on Communication
- …