ملخص: The presence of limit cycles in fixed arithmetic implementations of digital filters can significantly impair their performances. This paper presents a fast algorithm to determine the presence or absence of such limit cycles and their exact maximum amplitude. This algorithm may be used for different arithmetic representations and for second-order section with one or two quantizers. Computer results are given to establish the feasibility of the algorithm, which may be helpful to designers by providing them a knowledge of when and where he must really resort to more complex filters structures and rounding strategies.

لغة: إنجليزية