Exhaustive searching for limit cycles in recursive block floating point systems

Some important properties of recursive block floating point (BFP) systems are derived. On their basis an algorithm for searching limit cycles in such systems is proposed. For any finite wordlength implementation of linear systems an ellipsoidal bound on the set of initial conditions that may result in a limit cycle is derived. The bound also yields a sufficient condition for absence of limit cycles in (block) floating point systems