The University of Southampton
University of Southampton Institutional Repository

H? positive filtering for positive linear discrete-time systems: an augmentation approach

H? positive filtering for positive linear discrete-time systems: an augmentation approach
H? positive filtering for positive linear discrete-time systems: an augmentation approach
In this note, we address the reduced-order positive filtering problem of positive discrete-time systems under the H? performance. Commonly employed approaches, such as linear transformation and elimination technique, may not be applicable in general due to the positivity constraint of the filter. To cope with the difficulty, we first represent the filtering error system as a singular system by means of the system augmentation approach, which will facilitate the consideration of the positivity constraint. Two necessary and sufficient conditions are obtained in terms of matrix inequalities under which the filtering error system has a prescribed H? performance. Then, a necessary and sufficient condition is proposed for the existence of the desired positive filters, and an iterative linear matrix inequality (LMI) algorithm is presented to compute the filtering matrices, which can be easily checked by standard software. Finally, a numerical example to illustrate the effectiveness of the proposed design procedures is presented
0018-9286
2337-2342
Li, Ping
84293437-7ab4-4c22-b68b-937bfc57ee15
Lam, James
3eea3836-efda-430c-9ad4-ae4f3d4b8c4a
Shu, Zhan
ea5dc18c-d375-4db0-bbcc-dd0229f3a1cb
Li, Ping
84293437-7ab4-4c22-b68b-937bfc57ee15
Lam, James
3eea3836-efda-430c-9ad4-ae4f3d4b8c4a
Shu, Zhan
ea5dc18c-d375-4db0-bbcc-dd0229f3a1cb

Li, Ping, Lam, James and Shu, Zhan (2010) H? positive filtering for positive linear discrete-time systems: an augmentation approach. IEEE Transactions on Automatic Control, 55 (10), 2337-2342.

Record type: Article

Abstract

In this note, we address the reduced-order positive filtering problem of positive discrete-time systems under the H? performance. Commonly employed approaches, such as linear transformation and elimination technique, may not be applicable in general due to the positivity constraint of the filter. To cope with the difficulty, we first represent the filtering error system as a singular system by means of the system augmentation approach, which will facilitate the consideration of the positivity constraint. Two necessary and sufficient conditions are obtained in terms of matrix inequalities under which the filtering error system has a prescribed H? performance. Then, a necessary and sufficient condition is proposed for the existence of the desired positive filters, and an iterative linear matrix inequality (LMI) algorithm is presented to compute the filtering matrices, which can be easily checked by standard software. Finally, a numerical example to illustrate the effectiveness of the proposed design procedures is presented

Text
LLS10_TAC.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

Published date: October 2010
Organisations: Mechatronics

Identifiers

Local EPrints ID: 199697
URI: http://eprints.soton.ac.uk/id/eprint/199697
ISSN: 0018-9286
PURE UUID: 817ac472-c080-4197-aaf5-68f2ee4a4b58
ORCID for Zhan Shu: ORCID iD orcid.org/0000-0002-5933-254X

Catalogue record

Date deposited: 19 Oct 2011 13:18
Last modified: 14 Mar 2024 04:17

Export record

Contributors

Author: Ping Li
Author: James Lam
Author: Zhan Shu ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×