Bit serial addition trees and their applications
From MaRDI portal
(Redirected from Bit serial addition trees and their applications)
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.
Recommendations
Cites work
- Efficient selection on a binary tree
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 4074508 (Why is no real title available?)
- scientific article; zbMATH DE number 4088895 (Why is no real title available?)
- scientific article; zbMATH DE number 3696469 (Why is no real title available?)
Cited in
(11)- Finding the closest extreme vertex to a fixed point
- The flagged prefix adder and its applications in integer arithmetic
- Parallel addition time for several numbers
- Binary addition chain on EREW PRAM
- scientific article; zbMATH DE number 3856402 (Why is no real title available?)
- scientific article; zbMATH DE number 4085015 (Why is no real title available?)
- Layouts for improved hierarchical parallel computations
- Code Assignment Algorithm for Highly Parallel Multiple-Valued k-Ary Operation Circuits Using Partition Theory.
- Parallel Addition
- FUNCTIONAL PEARL Derivation of a logarithmic time carry lookahead addition circuit
- On the problem of computational time and complexity of arithmetic functions
This page was built for publication: Bit serial addition trees and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099602)