A binary multiplier is an electronic circuit used in digital electronics, such as computer, to multiply two binary numbers. A binary computer does exactly the same, but with binary numbers. In binary encoding each long number is multiplied by one digit (either 0 or 1) and that's much easier than in decimal, as the product by 0 or 1 is just 0 or same number. Therefore the multiplication of two binary numbers comes down to the process of calculating the partial products(which are 0 or the first number), shifting them left and the adding them together. Twin precision can be efficiently used to attain double output in multipliers and this method is simulated in signed multipliers. Twin precision is defined as one of the coherent method to attain double throughput in the multipliers. Twin precision is implemented using Modified Booth multiplier. The added advantage of reduced partial product is the reason for using Modified Booth multiplier. The possibility of combining N & N/2 bit multiplication in the same N bit tree multiplier is called as TP multiplier, where N is the bit of the multiplier. Since the partial product generation of MB multiplication is based on the encoding and decoding logic, it is not possible to use the results of full precision(N bit) for narrow width(N/2 bit) MB multiplication. Therefore MB algorithm reduces N number of partial product rows to N/2 rows. Multiplexers are needed to select the approximate partial products for N and N/2 multiplications. When more number of multiplexers are used area increases. Here in this paper, TP implementation it is done using an extra logic block for obtaining double throughput. Optimized TP multiplier gave a way for overall reduction in power, delay & area. This is then implemented in floating point multiplication and is taken as application study. It is observed that the speed of the floating point multiplier to genrate product is found faster than the present multipliers. Simulations and evaluations are done in Cadence RTL compiler using TSMC 90nm library.
[1]
Chein-Wei Jen,et al.
High-Speed Booth Encoded Parallel Multiplier Design
,
2000,
IEEE Trans. Computers.
[2]
Jalil Fadavi-Ardekani,et al.
M*N Booth encoded multiplier generator using optimized Wallace trees
,
1992,
Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.
[3]
Paolo Montuschi,et al.
Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
,
2011,
IEEE Transactions on Computers.
[4]
A signed binary multiplication technique pdf
,
2015
.
[5]
O. L. Macsorley.
High-Speed Arithmetic in Binary Computers
,
1961,
Proceedings of the IRE.
[6]
Jalil Fadavi-Ardekani.
M×N Booth encoded multiplier generator using optimized Wallace trees
,
1993,
IEEE Trans. Very Large Scale Integr. Syst..
[7]
Gabriel H. Loh.
Exploiting data-width locality to increase superscalar execution bandwidth
,
2002,
MICRO 35.
[8]
Seshasayanan Ramachandran,et al.
An optimised twin precision multiplier for ASIC environment
,
2015,
EURASIP J. Adv. Signal Process..
[9]
Magnus Själander,et al.
An efficient twin-precision multiplier
,
2004,
IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings..