Abstract
In this paper we present the design of a novel optimal time adder: the conditional carry adder. In order to perform addition a tree-like combination of multiplexer cells is used in the carry computation part. We show that, for the complete conditional carry adder, this results in an overall computation time which seems to be substantially shorter than for any other known (optimal time) adder (e.g. carry look ahead adders ([BrKu]) or conditional sum adders ([Sk])).
The second part of this paper contains a uniform approach to the computation of the carry function resulting in seven different classes of optimal time adders. It is shown that the conditional carry adder and the carry look ahead adder are representatives of two different classes. While section 1 defines the conditional carry adder and proposes a realization which is very time efficient, section 2 provides the possibility to compare this choice with other possible realizations and to choose a different design depending e.g. on specific properties of a given technology.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
3. References
B. Becker: ”Efficient Testing of Optimal-Time Adders”, MFCS, Bratislava 1986, Lecture Notes in Comp.Sc. 133, 218–229
B. Becker, G. Hotz, R. Kolla, P. Molitor, H.G. Osthof: ”Hierarchical Design based on a Calculus of Nets”, Proc. 24th ACM/IEEE Design Autom. Conf., Miami, 1987, 649–653
B. Becker, U. Sparmann: ”A Uniform Test Approach for RCC-Adders”, T.R., 7/1987, SFB 124, Saarbrücken 1987
D. Bhattacharya, J.P. Hayes: ”Fast and Easily testable Implementation of Arithmetic Functions”, FCTS, Wien 1986, 324–329
R.P. Brent, H.T. Kung: ”A regular Layout for Parallel Adders”, IEEE Trans. on Comp., C-31, 1982, 260–264
G. Hotz, B. Becker, R. Kolla, P. Molitor: ”Ein logisch-topologischer Kalkül zur Konstruktion von integrierten Schaltkreisen”, Informatik: Forschung und Entwicklung 1986 Band 1 und 2 (Springer-Verlag)
E. Hörbst, M. Nett, H. Schwärtzel: ”VENUS — Ein Enwurf von VLSI-Schaltungen”, Springer-Verlag Berlin Heidelberg New-York Tokyo 1986
G. Hotz: ”Zur Reduktionstheorie der booleschen Algebra”, Colloquium über Schaltkreis-und Schaltwerk-Theorie, (1960), Herausgeber: Unger H., Peschel E., Birkhäuser Verlag, 1961
G. Hotz: ”Schaltkreistheorie”, Berlin, New York: de Gruyter, 1974
R. Kolla: ”Spezifikation und Expansion logisch-topologischer Netze”, Dissertation, Universität des Saarlandes, 1987
P. Molitor: ”Über die Bikategorie der logisch topologischen Netze und ihre Semantik”, Dissertation, Universität des Saarlandes, 1986
J. Sklansky: ”Conditional sum addition logic”, IRE-EC 9, 226–231 (1960)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Becker, B., Kolla, R. (1988). On the construction of optimal time adders. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035828
Download citation
DOI: https://doi.org/10.1007/BFb0035828
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive