Skip to main content
SpringerLink
Log in

Bit serial addition trees and their applications

Bit-serielle Additionsbäume und ihre Anwendungen

  • Contributed Papers
  • Published:
Computing Aims and scope Submit manuscript

Abstract

Parallel algorithms are examined for a number of fundamental computational problems. All algorithms have as a basic operation the addition ofk-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.

Zusammenfassung

Wir untersuchen parallele Algorithmen für eine Anzahl von grundlegenden Rechenproblemen. Alle Algorithmen besitzen als Grundoperation die Additionk-stelliger Binärzahlen. Für jedes Problem geben wir die Lösung in Form eines logischen Schaltkreises, für den das Produkt aus Rechenzeit und Anzahl der benutzten Gatter kleiner ist als bei den besten bisher bekannten Algorithmen.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akl, S. G.: Parallel Sorting Algorithms. Orlando, Florida: Academic Press 1985.

    Google Scholar 

  2. Baer, J.-L.: Computer Systems Architecture. Rockville, Maryland: Computer Science Press 1980.

    Google Scholar 

  3. Cooper, J., Akl, S. G.: Efficient selection on a binary tree. Information Processing Letters, Vol. 23, No. 3, October 1986.

  4. Gonnet, G. H.: Handbook of Algorithms and Data Structures. Don Mills, Ontario: Addison-Wesley 1984.

    Google Scholar 

  5. Kuck, D. J.: The Structure of Computers and Computations, Vol. 1. Toronto: John Wiley & Sons 1978.

    Google Scholar 

  6. Stone, H. S., ed.: Introduction to Computer Architecture. Toronto: Science Research Associates 1980.

    Google Scholar 

  7. Ullman, J. D.: Computational Aspects of VLSI. Rockville, Maryland: Computer Science Press 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Science, Queen's University, K7L 3N6, Kingston, Canada

    H. Meijer & S. G. Akl

Authors
  1. H. Meijer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. G. Akl
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Nutural Sciences and Engineering Research Council of Canada under grants A0282 and A3336.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meijer, H., Akl, S.G. Bit serial addition trees and their applications. Computing 40, 9–17 (1988). https://doi.org/10.1007/BF02242186

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02242186

Categories and Subject Descriptors

General Tern

Key words

Search

Navigation