AbstractIt is well known that rounding the coefficients of digital filters may lead to instability. In this paper two approaches are used to obtain a lower bound for the word length to avoid such problems in two‐dimensional filters. The first bound is expressed in terms of the coefficients of the filter while the second bound is expressed in terms of the filter bandwidth. Both approaches were found to result in almost equal bound
展开▼