Look-ahead techniques applied to recursive filters with saturation

It is shown that it is possible to apply the look-ahead computation technique to a recursive algorithm with a saturation. The saturation is described by two consecutive MIN and MAX operations. The look-ahead technique can be used as an arbitrary look-ahead level. This allows an efficient implementation of the algorithm, using either block processing or pipelining. The use of pipelining in connection with a redundant arithmetic (e.g., carry save or signed digit) results in an additional increase of the throughput rate. In this case, it is possible to compute the algorithm starting with the most significant digit (MSD-first). The arithmetic delay thereby becomes independent from the wordlength, and an efficient implementation will be possible for any wordlength