Design of 32-bit multiplier with good speed performance
0
Citation
0
Reference
20
Related Paper
Abstract:
A multiplier with good speed performance is a very important unit in the modern microprocessors because the cycle that a multiplier completes one multiplication operation determines the main frequency of the microprocessor. In summing of the last product in the traditional multiplier design, the array or iteration summing method is used, which is not suitable to the design of small or middle scale integration circuit. A 32-bit multiplier is presented in which many methods, such as Booth algorithm, 4-2 compressors, Wallace tree algorithm,and carry-lookahead adder, are applied, which results in high speed performance.Keywords:
32-bit
Microprocessor
16-bit
Booth's multiplication algorithm
8-bit
Cite
Booth's multiplication algorithm
Cite
Citations (3)
Multipliers are the basic building blocks of signal processing and arithmetic based systems. The objective of this paper is to design a high speed multiplier that significantly improves the performance of many high performance DSP, multimedia and communications systems. This paper proposes a high speed radix 8 Booth multiplier employing signed digit representation for recoding and radix 8 modified Booth algorithm that reduces the number of partial products to n/3. The design of the multiplier is based on Wallace tree architecture with considerable improvement in performance. This paper compares the performance of conventional multiplier with radix 4 tree based Booth multiplier and radix 8 tree based Booth multiplier. The radix 8 tree based Booth multiplier is synthesized using Quartus II simulation tool. The proposed radix 8 tree based multiplier exhibits better performance with respect to area and operating frequency when compared to conventional multiplier.KeyWords: Higher Radix Booth Multiplier, Partial Product Reduction, Wallace Tree Multiplier
Booth's multiplication algorithm
Cite
Citations (1)
A low power and high-speed 24×24-b signed fixed point multiplier with modified booth encoder and wallace tree for FFT unit in DAB SOC is presented. An 18.81-ns multiplication time is achieved at 50 MHz, by optimizing modified signed extension algorithm, (k:2)compressors, connection algorithm and partition method of final adder. This multiplier has been verified in FPGA and implemented in chartered 0.35 micron CMOS standard cell technology, with its frequency being 50 MHz and its area 14 329.74 gates, power 24.69 mW. This architecture is compared with some other architectures using the same technology, and the result shows that it is effective and efficient.
Booth's multiplication algorithm
Cite
Citations (1)
This paper provides the design method of a high speed fixed point multiplier. It employs Modified Booth Arithmetic(MBA), Wallace-Tree, 4:2 Compressor, pseudo 4:2 compressor and the Suqare Root Carry-Select Adder. The multiplier has been realization using VerilogHDL, one 16bits multiplication can be performed in a clock. For verifying the performance of the multiplier, the multiplier has beed download into the VertexII-xc2v1000256-4, the frequency can reach 62.27MHz. 62.27 million times multiplication can be accomplished per second.
Booth's multiplication algorithm
Cite
Citations (0)
Four high speed multiplier architectures are proposed in this paper. They are the array multiplier, the modified Booth multiplier, the Wallace tree multiplier and the MBA WT multiplier. Their performances have been compared with each other. It is the conclusion that area, speed and power should be traded off based on the application, when chosen the multiplier.
Cite
Citations (1)
Cite
Citations (3)
Booth's multiplication algorithm
Cite
Citations (11)
Based on the characteristic of complement code,the traditional Booth2 algorithm has been modified.When it computes the sum of partly product,a balanced 4-2 compressor and a special adder are used to form Wallace tree and to compute the sum of the result of Wallace tree respectively.The circuit is described using Verilog HDL language and synthesized by Design analyzer.Finally,it is shown that this scheme has higher speed and bigger scale than traditional CSA array multiplier.
Verilog
Complement
Cite
Citations (2)
This paper describes a 24×24 Multiplier which is used for SOC( System On Chip). The multiplier supports both signed and unsigned integer multiplication by a additional sign bit.Designing use Wallace tree composed to add up Partial-product in order to reduce the critical path delay. This ALU unit delays not to go beyond 9.32ns by means of Hspice simulating.so it has the higher speed and function.
Booth's multiplication algorithm
Critical path method
Cite
Citations (0)
The Modified Booth multiplier is attractive to many multimedia and digital signal processing systems. This paper presents the design of 16∗16 Modified Booth multiplier. The multipliers such as Braun array multiplier and Array multiplier are used for unsigned multiplication. This paper focusing on design of Modified Booth Multiplier which performs both signed and unsigned multiplication. Here used Carry Select Adder it increases the speed of multiplier operation. Booth encoder multiplier with Carry select Adder utilizes the minimum hardware, reduced chip area, low power dissipation and reduced the cost of the system.
Booth's multiplication algorithm
Cite
Citations (12)