By Topic

Decimal floating-point antilogarithmic converter based on selection by rounding: algorithm and architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen, D. ; Dept. of Electr. & Comput. Eng., Univ. of Saskatchewan, Saskatoon, SK, Canada ; Han, L. ; Ko, S.-B.

This study presents the algorithm and architecture of the decimal floating-point (DFP) antilogarithmic converter, based on the digit-recurrence algorithm with selection by rounding. The proposed approach can compute faithful DFP antilogarithmic results for any one of the three DFP formats specified in the IEEE 754-2008 standard. The proposed architecture is synthesised with an STM 90-nm standard cell library and the results show that the critical path delay and the number of clock cycles of the proposed Decimal64 antilogarithmic converter are 1.26 ns (28.0 FO4) and 19, respectively, and the total hardware complexity is 29325 NAND2 gates. The delay estimation results of the proposed architecture show that it has a significant decrease in terms of latency in contrast with recently published high performance decimal CORDIC implementations.

Published in:

Computers & Digital Techniques, IET  (Volume:6 ,  Issue: 5 )