Optimal purely systolic addition
L. Kuhnel · 2002
The author introduces a purely systolic hardware algorithm for addition which is based on a mesh-connected arrangement of cells. The proposed FASTA algorithm is well suited for realization in integrated technologies. Its area, computation time, and period satisfy A(n)=O(n), T(n)=O( square root n), and P(n)=O( square root n), respectively, where n denotes the operand length. Therefore, this adder is T-, APT-, and AT/sup 2/-optimal in the linear model for signal propagation delays. In the class of Theta ( square root n) time adders it is optimal with respect to A, P, T, AT, APT, AP/sup 2/, and AT/sup 2/. The suggested algorithm essentially is a solution to the general problem of parallel prefix computation. Therefore, it can serve as a paradigm for the design of optimal purely systolic hardware algorithms in a wide range of application domains.>