A random-search method for designing finite-wordlength recursive digital filters

A new approach is described for finding the optimal finite-wordlength coefficients of recursive digital filters. A theoretical justification for the new method is presented and computational experience is reported, allowing comparison with some other methods proposed in the literature. The method appears to be suitable for designing filters of considerable complexity, using a realistic amount of computer time.