ABSTRACT
In this paper, we describe a low power and high speed multiplier suitable for standard cell-based ASIC design methodologies. For the purpose, an optimized booth encoder, compact 28-2, 27-2, ..., and 10-2 compressors, and XOR based adder are proposed. While the whole design is coded in Verilog-HDL language and implemented through commercially available EDA tool chain, the implementation gives comparable results to full custom designs [1][2]. Realistic simulations using extracted timing parameters from the layout show that the propagation time of a critical path is 3.25ns at 2.5V on a 0.18um process technology, which is almost 21% faster than the conventional multiplier [2].
- N. Ohkubo, et al., "A 4.4ns CMOS 54x54-b Multiplier Using Pass -Transistor Multiplexer", IEEE J. of Solid-State Cir- cuits, vol. 30, no. 3, pp. 251--257, Mar., 1995.Google ScholarCross Ref
- G. Goto, et al., "A 4.1-ns Compact 54--54-b Multiplier Utilizing Sign-Select Booth Encoders", IEEE J. of Solid-state Circuits, vol. 32, no. 11, pp. 1676--1681, Nov. 1997.Google ScholarCross Ref
- A.P. Chandrackasan and R.W. Brodersen, Low power digital CMOS CMOS Design. Norwell, MA: Kluwer, 1995. Google ScholarDigital Library
- J. F. Cavanagh, "Digital Computer Arithmetic - Design and Implementation", Mc-Graw-Hill, pp. 137--235, sep., 1986. Google ScholarDigital Library
- K. Yano, et al., "A 3.8-ns CMOS 16x16-bit Multiplier Using Compl- ementary Pass-transistor Logic", IEEE J. of Solid-State Circuits, vol. 25, no. 2, pp. 388--395, Apr., 1990.Google ScholarCross Ref
- R. Zimmermmann, et al., "Low-Power Logic Styles: CMOS Versus Pass-Transistor Logic", IEEE J. of Solid- state Circuits, vol. 32, no. 7, pp. 1079--1090, July, 1997.Google ScholarCross Ref
- Verilog-HDL by Cadence co., ltd.Google Scholar
- Chip Synthesis by Synopsys co., ltd.Google Scholar
- Hagihara. Y, et al., "A 2.7ns 0.25um CMOS 54x54 b multiplier", Solid-State Circuits Conference, 1998, Digest of Technical papers, 45th ISSCC 1998 IEEE International, pp. 296--297, 5-7 Feb 1998.Google Scholar
- O. L. McSorley, "High Speed Arithmetic in Binary Computers", Proc. IRE, Vol 49, pp 67--71, Jan. 1961Google ScholarCross Ref
- Electrical and computer Engineering, Oklahoma state university. http://ee.okstate.edu/Courses/Descriptions/6263.htm.Google Scholar
- Gustavo a. Ruiz, "Evaluation of three 32-bit CMOS adders in DCVS Logic for Self-Timed Circuits", IEEE IEEE J. of Solid-State Circuits, Vol.33, no.4, pp.604--613, April, 1998.Google ScholarCross Ref
Index Terms
54x54-bit radix-4 multiplier based on modified booth algorithm
Recommendations
High Performance Pipelined Signed 64x64-Bit Multiplier Using Radix-32 Modified Booth Algorithm and Wallace Structure
CICN '11: Proceedings of the 2011 International Conference on Computational Intelligence and Communication NetworksThis paper manly focus on enhancing speed performance of signed multiplication using radix-32 modified Booth algorithm and Wallace Structure. It is designed for fixed length 64x64 bit operands. 3:2and 4:2 Compressor used in Wallace tree structure ...
High-speed Parallel 32×32-b Multiplier Using a Radix-16 Booth Encoder
IITAW '09: Proceedings of the 2009 Third International Symposium on Intelligent Information Technology Application Workshopsa 32 32-b High-speed Parallel Multiplier is proposed in this paper. The new Multiplier uses a Radix-16 Booth Encoder, uses a mixed compressed tree constituted by 4-2 and 5-2 compressor and an improved 64-bit carry-look ahead adder (CLA) which combines ...
A Novel Signed Array Multiplier
ACE '10: Proceedings of the 2010 International Conference on Advances in Computer EngineeringA new architecture for the signed binary multiplier is presented in this paper. The proposed signed array multiplier has 54% area overhead as compared to Baugh Wooley multiplier but is 25% faster than the previous designs. The new design works with the ...
Comments