Stability of \(n\)-order discrete systems with overflow arithmetic

DOI10.1016/0016-0032(92)90092-UzbMath0762.93064OpenAlexW2059923874MaRDI QIDQ1188068

David P. Brown

Publication date: 3 August 1992

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(92)90092-u

zbMATH Keywords

discrete systems with general overflow arithmetic

Mathematics Subject Classification ID

Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)

Cites Work

• Unnamed Item
• Digital filter realizations without overflow oscillations
• Stability analysis of fixed- point digital filters using computer generated Lyapunov functions- Part I: Direct form and coupled form filters
• Necessary and sufficient conditions for the absence of overflow phenomena in a second-order recursive digital filter
• Minimum norm recursive digital filters that are free of overflow limit cycles

This page was built for publication: Stability of \(n\)-order discrete systems with overflow arithmetic