A 32-bit Decimal Floating-Point Logarithmic Converter

Chen, Dongdong; Choi, Younhee; Lee, Moon Ho; Ko, Seok‐Bum

doi:10.1109/arith.2009.22

Cited by 10 publications

(13 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pineiro et al [8] introduced an algorithm for the computation of logarithms for binary floating point numbers. Chen et al [3] adapted the same algorithm to decimal floating point numbers. 1) Algorithm: A logarithmic result log 10 (x) can be achieved according to [3] based on the mathematical identity:…”

Section: A Logarithm (Log 10 )mentioning

confidence: 98%

“…The selection of the k value depends on achieving the constraint e 2 j 10 −2j 2ln(10) < 10 −n , where n is the required accurate precision to be calculated. According to [3], the value of e 1 is obtained by look up table (I), where the input is in the range 0.5 ≤ m < 1 and the number in the range 0.1 ≤ m < 0.5 needs to be adjusted. The adjustment can be done by multiplying the input with (2, 3 or 5) and adding a value of (log(2), log (3) or log (5)) to the logarithm result.…”

Section: A Logarithm (Log 10 )mentioning

confidence: 99%

“…According to [3], the value of e 1 is obtained by look up table (I), where the input is in the range 0.5 ≤ m < 1 and the number in the range 0.1 ≤ m < 0.5 needs to be adjusted. The adjustment can be done by multiplying the input with (2, 3 or 5) and adding a value of (log(2), log (3) or log (5)) to the logarithm result. e j+1 values are selected by rounding the scaled remainder for iterations j ≥ 2.…”

Section: A Logarithm (Log 10 )mentioning

confidence: 99%

“…However, software algorithms are not suitable for numerical intensive and real time applications due to their slow operation, 100 to 1000 slower than what can be implemented in hardware [2]. Therefore, new algorithms and hardware implementations for elementary decimal floating point arithmetic functions have been introduced recently [3] [4] [5]. The accurate computation of the floating point powering function is difficult and requires wider calculating precisions as explained by the Table Maker's Dilemma [6].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Algorithm and architecture for on-line decimal powering computation

Hassan¹,

ElDeeb²,

Fahmy

2010

2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

An architecture for the computation of a decimal powering function is presented in this paper. The algorithm consists of a sequence of overlapped operations: 1) digit recurrence logarithm, 2) sequential multiplication, and 3) on-line antilogarithm. A correction scheme is introduced between the overlapped operations to guarantee correct on-line calculations. Execution times are estimated for decimal64 and decimal128 formats of the IEEE 754-2008 standard for floating point arithmetic.

show abstract

Section: A Logarithm (Log 10 )mentioning

confidence: 98%

Section: A Logarithm (Log 10 )mentioning

confidence: 99%

Section: A Logarithm (Log 10 )mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Algorithm and architecture for on-line decimal powering computation

Hassan¹,

ElDeeb²,

Fahmy

2010

2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

show abstract

“…Some researchers focused on other functions such as log [69,70], antilog [71], and power [72,73]. Others presented a larger set of elementary functions calculations [74].…”

Section: Decimal Square Root and Other Functionsmentioning

confidence: 99%