- TITLE: On the Convexity of QFT Bounds and
its Relations to Automatic Loop-Shaping
- AUTHORS: Qian Chen, Yossi Chait and C.V. Hollot
- ABSTRACT: A difficult problem in QFT is the design of a nominal-loop
function. A recent, promising direction for QFT loop-shaping involves
convex optimization. However, the underlying QFT bounds are often non-convex
sets requiring the bounds be approximated by convex sets to allow for
convex optimization. In this paper, we propose a novice automatic loop-shaping
technique via linear programming. Specifically, we transform the open-loop
QFT bounds into closed-loop QFT bounds to reduce design conservation
due to approximation. We also present a sufficiency condition for convexity
of the closed-loop QFT bounds.
- STATUS: Proceedings of the American Control Conference, pp. 1425-1426,
San Diego, CA, 1999.
- File: acc99.pdf
Back to DACS Laboratory.
Last Updated: January 26, 2001
|
