Issue No. 05 - May (2012 vol. 61)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.43
Dongdong Chen , University of Saskatchewan, Saskatoon
Liu Han , University of Saskatchewan, Saskatoon
Younhee Choi , University of Saskatchewan, Saskatoon
Seok-Bum Ko , University of Saskatchewan, Saskatoon
This paper presents the algorithm and architecture of the decimal floating-point (DFP) logarithmic converter, based on the digit-recurrence algorithm with selection by rounding. The proposed approach can compute faithful DFP logarithm results for any one of the three DFP formats specified in the IEEE 754-2008 standard. In order to optimize the latency for the proposed design, we mainly integrate the following novel features: 1) using the redundant carry-save representation of the data path; 2) reducing the number of iterations by determining the number of initial iteration; and 3) retiming and balancing the delay of the proposed architecture. The proposed architecture is synthesized with 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 logarithmic converter are 1.55 ns (34.4 FO4) and 19, respectively, and the total hardware complexity is 43,572 NAND2 gates. The delay estimation results of the proposed architecture show that its latency is close to that of the binary radix-16 logarithmic converter, and that it has a significant decrease on latency compared with a recently published high performance CORDIC implementation.
Decimal floating-point, decimal logarithmic converter, digit-recurrence algorithm, selection by rounding.
S. Ko, Y. Choi, D. Chen and L. Han, "Improved Decimal Floating-Point Logarithmic Converter Based on Selection by Rounding," in IEEE Transactions on Computers, vol. 61, no. , pp. 607-621, 2011.