A carry save architecture for primitive operator digital filters

The authors have introduced a method for efficiently decomposing a directed graph into carry save and accumulate sections, in such a way as to facilitate the direct application of Boolean reduction techniques. This approach has been shown in the given example to offer complexity savings, in excess of 25%, over previous primitive operator realisations. Greater reductions have been achieved for longer more representative graphs. It has also been shown that the method is capable of accommodating negative coefficient values through the incorporation of a carry correction adder at the filter output.<
>