Digital Arithmetic 2004
DOI: 10.1016/b978-155860798-9/50010-5
|View full text |Cite
|
Sign up to set email alerts
|

Floating-Point Representation, Algorithms, and Implementations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 77 publications
0
2
0
Order By: Relevance
“…First, the operands may be swapped, as shown in Figure 2, so that A N is the operand with the larger exponent in the rest of the circuit. This is similar to a technique used in BFP addition [20]. Also, the effective operation (EOP) is computed, based on the input operation (OP) and the signs of the operands, A sign and B sign , as EOP = OP xor A sign xor B sign , where OP is zero for addition and one for subtraction.…”
Section: Bid Addition/subtraction Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…First, the operands may be swapped, as shown in Figure 2, so that A N is the operand with the larger exponent in the rest of the circuit. This is similar to a technique used in BFP addition [20]. Also, the effective operation (EOP) is computed, based on the input operation (OP) and the signs of the operands, A sign and B sign , as EOP = OP xor A sign xor B sign , where OP is zero for addition and one for subtraction.…”
Section: Bid Addition/subtraction Algorithmmentioning
confidence: 99%
“…As a potential technique for implementing BID addition in the decimal64 format with p = 16, consider the addition of A N = 1,234,567,890,123,456 × 10 17 [20], and many processors include a 64-bit by 64-bit multiplier. With a rounder of this size, we divide the problem space into three cases.…”
Section: Bid Addition/subtraction Techniquementioning
confidence: 99%