Generating fast multipliers using clever circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3312, Issue , 2004, Pages 6-20

  Sheeran, Mary ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FORMAL METHODS; RECONFIGURABLE HARDWARE; TREES (MATHEMATICS);

DATA PATHS; FAST MULTIPLIERS; GENERAL STRUCTURES; PARTIAL PRODUCT REDUCTION;

FLEXIBLE ELECTRONICS;

EID: 24944472073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_2     Document Type: Article

References (15)

1. H. Al-Twaijry and M. Aloqeely: An algorithmic approach to building datapath multipliers using (3,2) counters, IEEE Computer Society Workshop on VLSI, IEEE Press, Apr. 2000.
2. C. Berg, C. Jacobi and D. Kroening: Formal verification of a basic circuits library, IASTED International Conference on Applied Informatics, ACTA Press, 2001.
3. B. Brock and W. A. Hunt Jr.: 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.
4. K. Claessen and M. Sheeran: A Tutorial on Lava: A Hardware Description and Verification System, Apr. 2000. http://www.cs.chalmers.se/~koen/Lava/ tutorial.ps
5. L. Dadda: Some Schemes for Parallel Adders, Acta. Frequenza, vol. 34, no. 5, May 1965.
6. H. Eriksson: Efficient Implementation and Analysis of CMOS Arithmetic Circuits, PhD. Thesis, Chalmers University of Technology, Dec. 2003.
7. H. Eriksson, P. Larsson-Edefors and W.P. Marnane: A Regular Parallel Multiplier Which Utilizes Multiple Carry-Propagate Adders, Int. Symp. on Circuits and Systems, 2001.
8. W. K. Luk and J. E. Vuillemin: Recursive Implementation of Optimal Time VLSI Integer Multipliers, VLSI'83, Elsevier Science Publishes B.V. (North-Holland), Aug. 1983.
9. F. Mo and R.K. Brayton: A Timing-Driven Module-Based Chip Design Flow, 41st Design Automation Conference, ACM Press, 2004.
10. Z.-J. Mou and F. Jutand: "Overturned-Stairs" Adder Trees and Multiplier Design, IEEE Trans. on Computers, Vol. 41, No. 8, Aug. 1992.
11. V.G. Oklobdzija, D. Villeger and S.S. Liu: A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach. IEEE Trans. on Computers, vol. 45, no. 3, Mar. 1996.
12. M. Sheeran: Finding regularity: describing and analysing circuits that are not quite regular, 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME, LNCS 2860, Springer-Verlag, 2003.
13. P.F. Stelling, C.U. Martel, V.G. Oklobdzija and R. Ravi: Optimal Circuits for Parallel Multipliers, IEEE Trans. on Computers, vol. 47, no. 3, Mar. 1998.
14. J. Um and T. Kim: Synthesis of Arithmetic Circuits Considering Layout Effects, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 11, Nov. 2003.
15. C. S. Wallace: A suggestion for a fast multiplier, IEEE Trans. on Computers, EC-13, 2, Feb. 1964.