• DocumentCode
    1332589
  • Title

    An algorithm for computing convex positively invariant sets for delta-sigma modulators

  • Author

    Schreier, Richard ; Goodson, Montgomery V. ; Zhang, Bo

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
  • Volume
    44
  • Issue
    1
  • fYear
    1997
  • fDate
    1/1/1997 12:00:00 AM
  • Firstpage
    38
  • Lastpage
    44
  • Abstract
    Computational geometry is used to locate convex positively invariant sets for delta-sigma modulators. The existence of a positively invariant set implies the stability of the modulator and yields rigorous state bounds. Convex positively invariant sets for single-bit modulators up to order four, with a restricted class of time-varying inputs, have been found. MATLAB code implementing the proposed algorithm is available from ftp: //next242.ece.orst.edu/pub/delsig.tar.Z
  • Keywords
    circuit stability; computational geometry; invariance; set theory; sigma-delta modulation; MATLAB code; algorithm; computational geometry; convex positively invariant sets; delta-sigma modulator; stability; Computational geometry; Delta modulation; Digital modulation; Digital-analog conversion; Frequency; MATLAB; Modular construction; Robustness; Solids; Stability;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7122
  • Type

    jour

  • DOI
    10.1109/81.558440
  • Filename
    558440
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1332589