For computation or display in fixed-point arithmetic, each real number has a variable number of integer digits (in order left to right from the most to the least significant digit) in base but always fractional digits to the right of the point. Thus,
For example, for the usual mundane applications of money, and .
Fixed-point arithmetic can adequately represent any rational number provided that and has no prime factors doesn’t (counting repeated prime factors). Addition and subtraction in fixed-point arithmetic present no special problems for such numbers. When it comes to multiplication and division, we run into cases where the result cannot be adequately represented though the operands can.
In those cases it may be practical to perform the computations in floating point and display the results in fixed-point. In fact, this is what many business calculators do (such as cash registers); they compute in binary floating point and display in decimal fixed-point. Another option is to continue the calculations in fixed-point by settling for crude approximations. Depending on the application and the user, the loss of precision may be acceptable. There are two ways to handle the loss of precision: if , we could then assign (propagating the change as needed to the more significant digits); or we could simply ignore everything to the right of .
Older versions of FractInt for 80386 IBM-compatibles used fixed-point arithmetic. Most computers (and even game consoles) today have floating point units, reducing the need for fixed-point. Even so, newer implementations of the C programming language are expected to provide fixed-point data types and appropriately overload built-in functions to handle those data types (see ISO/IEC TR 18037:2004).
|Date of creation||2013-03-22 16:32:31|
|Last modified on||2013-03-22 16:32:31|
|Last modified by||PrimeFan (13766)|
|Synonym||fixed point arithmetic|