Abstract
In this paper, we present a general architecture of hybrid prefix/carry-select adder. Based on this architecture, we formalize the hybrid adder’s algorithm using the first-order recursive equations and develop a proof framework to prove its correctness. Since several previous adders in the literature are special cases of this general architecture, our methodology can be used to prove the correctness of different hybrid prefix/carry-select adders. The formal proof for a special hybrid prefix/carry-select adder shows the effectiveness of the algebraic structures built in this paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lynch, T., Swartzlander, E.: A spanning tree carry lookahead adder. IEEE Trans. Comput. 41, 931–939 (1992)
Kantabutra, V.: A recursive carry-lookahead/carry-select hybrid adder. IEEE Trans. Comput. 42, 1495–1499 (1993)
Kwon, O., Swartzlander Jr., E.E., Nowka, K.: A Fast Hybrid Carry-Lookahead/Carry-Select Adder Design. In: Proceedings of the 11th Great Lakers symposium on VLSI, pp. 149–152 (2001)
Wang, Y., Pai, C., Song, X.: The Design of Hybrid Carry-Lookahead/Carry-Select Adders. IEEE Transactions on Circuits and Systems II:Analog and Digital Signal Proessing 49, 16–24 (2002)
Yu, X.Y., Fleischer, B., Chan, Y.H., et al.: A 5GHz+ 128-bit Binary Floating-Point Adder for the POWER6 Processor. In: Proceedings of the 32nd European Solid-State Circuits Conference, pp. 166–169 (2006)
Tyagi, A.: A reduced-area scheme for carry-select adders. IEEE Trans. on Computers. 42, 1163–1170 (1993)
Arjhan, A., Deshmukh, R.G.: A Novel Scheme for Irregular parallel-prefix adders. In: Proceedings of IEEE Southeastcon 1997, ‘Engineering new New Century’, pp. 74–78 (1997)
O’Donnell, J., Rnger, G.: Derivation of a carry lookahead addition circuit. Journal of Functional Programming 14, 127–158 (2004)
Kapur, D., Subramaniam, M.: Mechanical verification of adder circuits using rewrite rulelaboratory. Formal Methods in System Design 13, 127–158 (1998)
Sheeran, M.: Hardware design and functional programming: a perfect match. Journal of Universal Computer Science 11, 1135–1158 (2005)
Hinze, R.: An algebra of scans. In: Kozen, D. (ed.) Proceedings of the Seventh International Conference on Mathematics of Program Construction, pp. 186–210 (2004)
Han, J.: Stone, G.: The implementation and verification of a conditional sum adder. Technical Reports, Department of Computer Science, University of Calgary, Calgary, Alberta, Canada (1988)
Elleithy, K.M., Aref, M.A.: A Rule-based Approach for High Speed Adders Design Verification. In: 37th Midwest Symposium on Circuits and Systems, pp. 274–277 (1994)
Koren, I.: Computer Arithmetic Algorithms, 2nd edn. A.K.Peters, Natick (2002)
Chen, G., Liu, F.: Proofs of correctness and properties of integer adder circuits. IEEE Trans. on Computers 59, 134–136 (2010)
Brent, R.P., Kung, H.T.: A regular layout for parallel adders. IEEE Trans. on Computers C-31, 260–264 (1982)
Kogge, P.M., Stone, H.S.: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations. IEEE Trans. on Computers C-22, 786–793 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, F., Tan, Q., Song, X., Chen, G. (2010). Formal Proof for a General Architecture of Hybrid Prefix/Carry-Select Adders. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13119-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-13119-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13118-9
Online ISBN: 978-3-642-13119-6
eBook Packages: Computer ScienceComputer Science (R0)