Issue No.03 - March (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2170
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 charact
highly parallel algorithms synthesis; multipliers; VLSI; long multiplication algorithm; binary numbers; Crystal; digital arithmetic; parallel algorithms; parallel architectures; VLSI.
M.C. Chen, "The Generation of a Class of Multipliers: Synthesizing Highly Parallel Algorithms in VLSI", IEEE Transactions on Computers, vol.37, no. 3, pp. 329-338, March 1988, doi:10.1109/12.2170