Abstract
New insights into the general structure of partial product reduction trees are combined with the notion of clever circuits to give a novel method of writing simple but flexible and highly parameterised data-path generators.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Twaijry, H., Aloqeely, M.: An algorithmic approach to building datapath multipliers using (3,2) counters. In: IEEE Computer Society Workshop on VLSI. IEEE Press, Los Alamitos (April 2000)
Berg, C., Jacobi, C., Kroening, D.: Formal verification of a basic circuits library. In: IASTED International Conference on Applied Informatics. ACTA Press (2001)
Brock, B., Hunt Jr., W.A.: The DUAL-EVAL Hardware Description Language and Its Use in the Formal Specification and Verification of the FM9001 Microprocessor. Formal Methods in System Design 11(1) (1997)
Claessen, K., Sheeran, M.: A Tutorial on Lava: A Hardware Description and Verification System (April 2000), http://www.cs.chalmers.se/~koen/Lava/tutorial.ps
Dadda, L.: Some Schemes for Parallel Adders. Acta Frequenza 34(5) (May 1965)
Eriksson, H.: Efficient Implementation and Analysis of CMOS Arithmetic Circuits. PhD. Thesis, Chalmers University of Technology (December 2003)
Eriksson, H., Larsson-Edefors, P., Marnane, W.P.: A Regular Parallel Multiplier Which Utilizes Multiple Carry-Propagate Adders. In: Int. Symp. on Circuits and Systems (2001)
Luk, W.K., Vuillemin, J.E.: Recursive Implementation of Optimal Time VLSI Integer Multipliers. In: VLSI 1983. Elsevier Science Publishes B.V, North-Holland (August 1983)
Mo, F., Brayton, R.K.: A Timing-Driven Module-Based Chip Design Flow. In: 41st Design Automation Conference. ACM Press, New York (2004)
Mou, Z.-J., Jutand, F.: “Overturned-Stairs” Adder Trees and Multiplier Design. IEEE Trans. on Computers 41(8) (August 1992)
Oklobdzija, V.G., Villeger, D., Liu, S.S.: A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach. IEEE Trans. on Computers 45(3) (March 1996)
Sheeran, M.: Finding regularity: describing and analysing circuits that are not quite regular. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 4–18. Springer, Heidelberg (2003)
Stelling, P.F., Martel, C.U., Oklobdzija, V.G., Ravi, R.: Optimal Circuits for Parallel Multipliers. IEEE Trans. on Computers 47(3) (March 1998)
Um, J., Kim, T.: Synthesis of Arithmetic Circuits Considering Layout Effects. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 22(11) (November 2003)
Wallace, C.S.: A suggestion for a fast multiplier. IEEE Trans. on Computers EC-13(2) (February 1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sheeran, M. (2004). Generating Fast Multipliers Using Clever Circuits. In: Hu, A.J., Martin, A.K. (eds) Formal Methods in Computer-Aided Design. FMCAD 2004. Lecture Notes in Computer Science, vol 3312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30494-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30494-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23738-9
Online ISBN: 978-3-540-30494-4
eBook Packages: Springer Book Archive