• DocumentCode
    3343700
  • Title

    An exhaustive search algorithm for checking limit cycle behavior of digital filters

  • Author

    Premaratne, K. ; Kulasekere, E.C. ; Bauer, P.H. ; Leclerc, L.J.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Miami Univ., Coral Gables, FL, USA
  • Volume
    3
  • fYear
    1995
  • fDate
    30 Apr-3 May 1995
  • Firstpage
    2035
  • Abstract
    In this paper, an algorithm that can be utilized to determine the presence or absence of limit cycles in fixed-point implementation of digital filters is given. It is applicable for filters in state-space formulation (and hence, application to the corresponding direct form follows as a special case), and is independent of the order, type of quantization, and whether the accumulator is single- or double-length. Bounds on the amplitude and period of possible limit cycles are presented. The robustness of the algorithm in terms of limit cycle performance with respect to filter coefficient perturbations is verified. The algorithm is then used to obtain regions in the coefficient space where a filter of given order is limit cycle free. In this process, we have obtained limit cycle free regions that were previously unknown for the two´s complement case
  • Keywords
    digital arithmetic; digital filters; filtering theory; limit cycles; digital filters; exhaustive search algorithm; filter coefficient perturbations; fixed-point implementation; limit cycle behavior; state-space formulation; Convergence; Digital filters; Limit-cycles; Linear systems; Matrix converters; Nonlinear systems; Polynomials; Quantization; Transfer functions; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    0-7803-2570-2
  • Type

    conf

  • DOI
    10.1109/ISCAS.1995.523823
  • Filename
    523823