Fast parallel algorithms for binary multiplication and their implementation on systolic architectures

Two algorithms for parallel multiplication of two n-bit binary numbers are presented. Both use column compression to increase the speed of execution. They require almost regular interconnection between only two types of cells and hence are very suitable for VLSI implementation. Both of them can also...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 38; číslo 3; s. 424 - 431
Hlavní autoři: Sinha, B.P., Srimani, P.K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.03.1989
Institute of Electrical and Electronics Engineers
Témata:
Adders
Algorithmics. Computability. Computer arithmetics
Applied sciences
Binary trees
Chip scale packaging
Computer architecture
Computer science
Computer science; control theory; systems
Exact sciences and technology
Integrated circuit interconnections
Iterative algorithms
Parallel algorithms
Parallel processing
Theoretical computing
Very large scale integration
Parallel algorithm
Computers arithmetic
VLSI circuit
Computer theory
Integrated circuit
SIMD computer
Fast algorithm
Implementation
Binary multiplier
ISSN:0018-9340
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Two algorithms for parallel multiplication of two n-bit binary numbers are presented. Both use column compression to increase the speed of execution. They require almost regular interconnection between only two types of cells and hence are very suitable for VLSI implementation. Both of them can also be easily modified to handle two's complement numbers with constant differences in time.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.21128