Cellular multiplier subarrays: a critical-path approach to propagation times

A critical-path algorithm is described for calculating the worst-case propagation times of cellular multiplier arrays. This algorithm is then used to compare the propagation times of arrays of worthwhile size which have been subdivided into macrocells with those of iterative and semi-iterative arrays. This leads to some conclusions about the optimum size of macrocells.