Merged Arithmetic

The concept of merged arithmetic is introduced and demonstrated in the context of multiterm multiplication/addition. The merged approach involves synthesizing a composite arithmetic function (such as an inner product) directly instead of decomposing the function into discrete multiplication and addition operations. This approach provides equivalent arithmetic throughput with lower implementation complexity than conventional fast multipliers and carry look-ahead adder trees.

[1]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[2]  Paul A. Wintz,et al.  Fast Multipliers , 1970, IEEE Transactions on Computers.

[3]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

[4]  Andres C. Salazar Digital Signal Computers and Processors , 1977 .

[5]  William J. Kubitz,et al.  A Compact High-Speed Parallel Multiplication Scheme , 1977, IEEE Transactions on Computers.

[6]  Earl E. Swartzlander,et al.  Merged arithmetic for signal processing , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[7]  Earl E. Swartzlander,et al.  Inner Product Computers , 1978, IEEE Transactions on Computers.