Year: 1985
Type: article
Abstract: A new recursive algorithm for deriving the layout of parallel multipliers is presented. Based on this algorithm, a network for performing multiplications of two's complement numbers is proposed. The network can be implemented in a synchronous or an asynchronous way. If the factors to be multiplied have N bits, the area complexity of the network is O ( N 2 ) for practical values of N as in the case of cellular multipliers. Due to the design approach based on a recursive algorithm, a time complexity O (log N ) is achieved. It is shown how the structure can he pipelined with period complexity O (1) and used for single and double precision multiplication.
DOI: 10.1145/6110.214399
Authors: Renato De Mori, Régis Cardin
Institution: Concordia University
Language: English
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2049896844