Bit serial addition trees and their applications (Q1099602)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4041237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bit serial addition trees and their applications |
scientific article; zbMATH DE number 4041237 |
Statements
Bit serial addition trees and their applications (English)
0 references
1988
0 references
Parallel algorithms are examined for a number of fundamental computational problems. All algorithms have as a basic operation the addition of k-bit integers. For each problem we present a solution in the form of a logical circuit for which the product of the computation time and number of gates used is smaller than that of the best previously known algorithm.
0 references
Parallel algorithms
0 references
logical circuit
0 references
0.8080704212188721
0 references
0.7955897450447083
0 references
