Abdullah Aldahami (11074595) March 12, 2010.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
March 12, 2010
Literature Review (3)A Decimal Fully Parallel and Pipelined Floating Point MultiplierBy: RamyRaafat, Amira M. Abdel-Majeed, RodinaSamyTarekElDeeb, Yasmin Farouk, MostafaElkhouly, Hossam A. H. Fahmy” Electronics and Communication Department, Cairo University”Appeared in: Signals, Systems and Computers, 2008 42nd Asilomar Conference Publication Date: Oct. 2008
Where A is the multiplicand, B is the multiplier, and P is the product. It is assumed that A and B are each n digits hence P is maximally 2n digits that must be rounded in order to fit in a limited precision of n digits.
Xi+1 = (Xi + A.Bi) . 10-1
Where X is the partial product, X0= 0 and 0 ≤ i ≤ n-1.
Xi+1 = (Xi + A.B’l + A.B”l) . 10-1
Where A.B’l and A.B”l are the secondary multiples which together equal the proper primary multiple.
D = – 1sign× Significand × 10E-Bias
Where, E is the biased non-negative integer exponent.
E = e + Bias
Where e is the unbiased exponent defined in the IEEE Std 754-2008. The significand can be encoded either in binary or in Densely Packed Decimal (DPD), which in the IEEE Std 754-2008 is referred to as the decimal encoding. The exponent must be in the range [Emin, Emax], after biasing.
PE = Ea + Eb – Bias
Where, Ea and Eb are the biased exponents of the multiplicand and multiplier operands, respectively.
of the multiplier encoding and the
multiple sets selection units.
Kogge-stone tree that aims to propagate
the carry faster.