1. Home page
  2. Search

Multiplexer-based array multipliers

This item is provided by the institution :
National Technical University of Athens   

Repository :
Digital Library of National Technical University of Athens | Dspace@NTUA   

see the original item page
in the repository's web site and access all digital files if the item*



Multiplexer-based array multipliers (EN)
Pekmestzi, KZ (EN)
journalArticle (EN)
2014-03-01T01:14:51Z
1999 (EN)
A new algorithm for the multiplication of two n-bit numbers based on the synchronous computation of the partial sums of the two operands is presented. The proposed algorithm permits an efficient realization of the parallel multiplication using iterative arrays. At the same time, it permits high-speed operation. Multiplier arrays for positive numbers and numbers in two's complement form based on the proposed technique are implemented. Also, an efficient pipeline form of the proposed multiplication scheme is introduced. All multipliers obtained have low circuit complexity permitting high-speed operation and the interconnections of the cells are regular, well-suited for VLSI realization. © 1999 IEEE. (EN)
Engineering, Electrical & Electronic (EN)
Computer Science, Hardware & Architecture (EN)
Parallel processing systems (EN)
Algorithms (EN)
Array multipliers (EN)
Two's complement multiplication (EN)
Multiplication algorithm (EN)
Pipeline processing systems (EN)
Digital arithmetic (EN)
Pipeline multipliers (EN)
Iterative methods (EN)
Interconnection networks (EN)
Multiplying circuits (EN)
IEEE Transactions on Computers (EN)
English
IEEE COMPUTER SOC (EN)
National Technical University of Athens
Digital Library of National Technical University of Athens | Dspace@NTUA
Κεντρική Βιβλιοθήκη Ε.Μ.Π.
Ιδρυματικό Αποθετήριο
Δημοσιεύσεις μελών Δ.Ε.Π. σε περιοδικά



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)