3,893 research outputs found
Linear Matrix Inequality Formulation of Spectral Mask Constraints With Applications to FIR Filter Design
Abstract-The design of a finite impulse response (FIR) filter often involves a spectral "mask" that the magnitude spectrum must satisfy. The mask specifies upper and lower bounds at each frequency and, hence, yields an infinite number of constraints. In current practice, spectral masks are often approximated by discretization, but in this paper, we will derive a result that allows us to precisely enforce piecewise constant and piecewise trigonometric polynomial masks in a finite and convex manner via linear matrix inequalities. While this result is theoretically satisfying in that it allows us to avoid the heuristic approximations involved in discretization techniques, it is also of practical interest because it generates competitive design algorithms (based on interior point methods) for a diverse class of FIR filtering and narrowband beamforming problems. The examples we provide include the design of standard linear and nonlinear phase FIR filters, robust "chip" waveforms for wireless communications, and narrowband beamformers for linear antenna arrays. Our main result also provides a contribution to system theory, as it is an extension of the wellknown Positive-Real and Bounded-Real Lemmas
Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part I: Nash Equilibria
In this two-parts paper we propose a decentralized strategy, based on a
game-theoretic formulation, to find out the optimal precoding/multiplexing
matrices for a multipoint-to-multipoint communication system composed of a set
of wideband links sharing the same physical resources, i.e., time and
bandwidth. We assume, as optimality criterion, the achievement of a Nash
equilibrium and consider two alternative optimization problems: 1) the
competitive maximization of mutual information on each link, given constraints
on the transmit power and on the spectral mask imposed by the radio spectrum
regulatory bodies; and 2) the competitive maximization of the transmission
rate, using finite order constellations, under the same constraints as above,
plus a constraint on the average error probability. In Part I of the paper, we
start by showing that the solution set of both noncooperative games is always
nonempty and contains only pure strategies. Then, we prove that the optimal
precoding/multiplexing scheme for both games leads to a channel diagonalizing
structure, so that both matrix-valued problems can be recast in a simpler
unified vector power control game, with no performance penalty. Thus, we study
this simpler game and derive sufficient conditions ensuring the uniqueness of
the Nash equilibrium. Interestingly, although derived under stronger
constraints, incorporating for example spectral mask constraints, our
uniqueness conditions have broader validity than previously known conditions.
Finally, we assess the goodness of the proposed decentralized strategy by
comparing its performance with the performance of a Pareto-optimal centralized
scheme. To reach the Nash equilibria of the game, in Part II, we propose
alternative distributed algorithms, along with their convergence conditions.Comment: Paper submitted to IEEE Transactions on Signal Processing, September
22, 2005. Revised March 14, 2007. Accepted June 5, 2007. To be published on
IEEE Transactions on Signal Processing, 2007. To appear on IEEE Transactions
on Signal Processing, 200
Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part II: Algorithms
In this two-part paper, we address the problem of finding the optimal
precoding/multiplexing scheme for a set of non-cooperative links sharing the
same physical resources, e.g., time and bandwidth. We consider two alternative
optimization problems: P.1) the maximization of mutual information on each
link, given constraints on the transmit power and spectral mask; and P.2) the
maximization of the transmission rate on each link, using finite order
constellations, under the same constraints as in P.1, plus a constraint on the
maximum average error probability on each link. Aiming at finding decentralized
strategies, we adopted as optimality criterion the achievement of a Nash
equilibrium and thus we formulated both problems P.1 and P.2 as strategic
noncooperative (matrix-valued) games. In Part I of this two-part paper, after
deriving the optimal structure of the linear transceivers for both games, we
provided a unified set of sufficient conditions that guarantee the uniqueness
of the Nash equilibrium. In this Part II, we focus on the achievement of the
equilibrium and propose alternative distributed iterative algorithms that solve
both games. Specifically, the new proposed algorithms are the following: 1) the
sequential and simultaneous iterative waterfilling based algorithms,
incorporating spectral mask constraints; 2) the sequential and simultaneous
gradient projection based algorithms, establishing an interesting link with
variational inequality problems. Our main contribution is to provide sufficient
conditions for the global convergence of all the proposed algorithms which,
although derived under stronger constraints, incorporating for example spectral
mask constraints, have a broader validity than the convergence conditions known
in the current literature for the sequential iterative waterfilling algorithm.Comment: Paper submitted to IEEE Transactions on Signal Processing, February
22, 2006. Revised March 26, 2007. Accepted June 5, 2007. To appear on IEEE
Transactions on Signal Processing, 200
Convex recovery from interferometric measurements
This note formulates a deterministic recovery result for vectors from
quadratic measurements of the form for some
left-invertible . Recovery is exact, or stable in the noisy case, when the
couples are chosen as edges of a well-connected graph. One possible way
of obtaining the solution is as a feasible point of a simple semidefinite
program. Furthermore, we show how the proportionality constant in the error
estimate depends on the spectral gap of a data-weighted graph Laplacian. Such
quadratic measurements have found applications in phase retrieval, angular
synchronization, and more recently interferometric waveform inversion
Multivariate Nonnegative Quadratic Mappings
In this paper we study several issues related to the characterization of speci c classes of multivariate quadratic mappings that are nonnegative over a given domain, with nonnegativity de ned by a pre-speci ed conic order.In particular, we consider the set (cone) of nonnegative quadratic mappings de ned with respect to the positive semide nite matrix cone, and study when it can be represented by linear matrix inequalities.We also discuss the applications of the results in robust optimization, especially the robust quadratic matrix inequalities and the robust linear programming models.In the latter application the implementational errors of the solution is taken into account, and the problem is formulated as a semide nite program.optimization;linear programming;models
Robust Spectrum Sharing via Worst Case Approach
This paper considers non-cooperative and fully-distributed power-allocation
for secondary-users (SUs) in spectrum-sharing environments when
normalized-interference to each secondary-user is uncertain. We model each
uncertain parameter by the sum of its nominal (estimated) value and a bounded
additive error in a convex set, and show that the allocated power always
converges to its equilibrium, called robust Nash equilibrium (RNE). In the case
of a bounded and symmetric uncertainty set, we show that the power allocation
problem for each SU is simplified, and can be solved in a distributed manner.
We derive the conditions for RNE's uniqueness and for convergence of the
distributed algorithm; and show that the total throughput (social utility) is
less than that at NE when RNE is unique. We also show that for multiple RNEs,
the the social utility may be higher at a RNE as compared to that at the
corresponding NE, and demonstrate that this is caused by SUs' orthogonal
utilization of bandwidth for increasing the social utility. Simulations confirm
our analysis
- …