Abstract

The conventional definition of multidimensional (m-D) bounded-input bounded-output (BIBO) stability permits the m-D domain of the input signal, and of the m-D computations, to be of infinite extent in all m-dimensions. The definition of m-D practical-BIBO (P-BIBO) stability restricts the m-D domain of the input signal, and of the computations, to be of finite extent in all but one of the m dimensions. It is shown that the P-BIBO stability criterion corresponds to those computations that can be made with a machine having a finite number of (infinite-precision) memory storage elements, whereas the BIBO stability criterion, which is more restrictive, also includes machines having an infinite number of (infinite-precision) memory storage elements. It is argued that the extension of the BIBO stability criterion to include such infinitely large machines is of limited practical value, and that P-BIBO stability is the more useful criterion, and is easier to test. >

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.