Array multiplication scheme using (p, 2) counters and pre-addition

The authors propose a pre-add counter scheme that provides for common operand lengths and a speedup, measured in terms of CSAs, by a factor of up to 9 over CSA array multipliers and by a factor up to 2 over parallel multipliers using Lim counters. Furthermore, it permits efficient mapping in VLSI implementations.< >