Details of Research Outputs

This brief concerns the stability of fixed-point state-space digital filters with generalized overflow arithmetic and a time-varying delay. A relaxed lemma that includes a commonly used lemma as a special case is developed to show the relationship between the state and the overflow arithmetic, and a Lyapunov functional with positive-definite conditions that are more relaxed than usual is constructed. As a result, a less conservative stability criterion is established, and the efficiency and merit of the criterion are illustrated with a numerical example. © 2004-2012 IEEE.