Minimization methods for macrocellular arithmetic networks

This paper presents a new method to study arithmetic combinatorial circuits. Using polynomial associated to the input-output sequences and to the systems it is possible to solve the problem of minimization of the number of the component blocks. Particularly, the important case of the multiple outputs elementary units can be treated. Applications of the introduced procedures to multiplier and to fast networks for performing convolution are presented.