ISyE SEMINAR SERIES - Convex Optimization in Digital Communication and Signal Processing

Primary tabs

In this talk, we will briefly review the theory of convex optimization and semidefinite programming, and then show how they can be used to solve some important digital communication problems efficiently. Examples will be given to show that certain nonconvex and semi-infinite spectral mask constraints can be reformulated as linear matrix inequalities. This facilitates the formulation of a diverse class of filter and beamformer design problems as semidefinite programmes. Our results extend the well-known Positive-Real and Bounded-Real Lemmas from the systems and control literature.


  • Workflow Status: Published
  • Created By: Barbara Christopher
  • Created: 10/08/2010
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


No keywords were submitted.

Target Audience