An efficient algorithm for the design of lattice wave digital filters with short coefficient wordlength

This paper describes an efficient algorithm for the design of lattice wave digital filters. The proposed algorithm guarantees that the optimum finite-wordlength solution can be found for both the fixed-point and the multiplierless coefficient representations. This is illustrated by means of several examples.