Content deleted Content added
Isaidnoway (talk | contribs) →References: list-defined refs not used |
m v2.05b - Bot T19 CW#25 - Fix errors for CW project (Heading hierarchy) |
||
Line 748:
<!-- not at all clear why this needs to be here at all, shouldn't the article just describe BCD? (mfc)-->
<!--as an alternative number system for computing and electronics imo a comparison to the standard one is justified (plugwash)-->
* Scaling by a power of 10 is simple.
* [[Rounding]] at a decimal digit boundary is simpler. Addition and subtraction in decimal do not require rounding.{{dubious|Rounding|date=November 2021}}
Line 755:
* Many non-integral values, such as decimal 0.2, have an infinite place-value representation in binary (.001100110011...) but have a finite place-value in binary-coded decimal (0.0010). Consequently, a system based on binary-coded decimal representations of decimal fractions avoids errors representing and calculating such values. This is useful in financial calculations.
* Practical existing implementations of BCD are typically slower than operations on binary representations, especially on embedded systems, due to limited processor support for native BCD operations.<ref name="Mathur_1989" />
* Some operations are more complex to implement. [[Adder (electronics)|Adder]]s require extra logic to cause them to wrap and generate a carry early. Also, 15 to 20 per cent more circuitry is needed for BCD add compared to pure binary.{{Citation needed|date=May 2011}} Multiplication requires the use of algorithms that are somewhat more complex than shift-mask-add (a [[Binary numeral system#Multiplication|binary multiplication]], requiring binary shifts and adds or the equivalent, per-digit or group of digits is required).
| |||