Title :
The generation of a class of multipliers: synthesizing highly parallel algorithms in VLSI
Author_Institution :
Dept of Comput. Sci., Yale Univ., New Haven, CT, USA
fDate :
3/1/1988 12:00:00 AM
Abstract :
A synthesis method for designing highly parallel algorithms in VLSI is presented. To illustrate the method, the familiar long multiplication algorithm for binary numbers is used. This algorithm is specified in the language Crystal, a very-high-level language for parallel processing. A total of 18 designs are derived from this specification. Each is optimal within its own class, which is characterized by a space-time map. The relative merits and tradeoffs of different designs are systematically compared and evaluated
Keywords :
VLSI; digital arithmetic; parallel algorithms; parallel architectures; Crystal; VLSI; binary numbers; highly parallel algorithms synthesis; long multiplication algorithm; multipliers; Algorithm design and analysis; Design methodology; Equations; Parallel algorithms; Parallel architectures; Parallel processing; Signal processing algorithms; Signal synthesis; Systolic arrays; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
