Running-sum adder networks determined by recursive construction of multi-stage networks

摘要

A technique for physically implementing a running sum adder network and configuring the concomitant adder network of elements. A 2k+1x2k+1 adder network has the size 2k+2-k-3 and depth 2k+1; thus the adder network achieves a very good balance between the measures of size. The adder network utilizes a systematic design method based upon a recursive construction algorithm.