Bit serial addition trees and their applications

From MaRDI portal





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.











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)