# Fixed-point

programming

A number representation scheme where a number, F is represented by an integer I such that F=I*R^-P, where R is the (assumed) radix of the representation and P is the (fixed) number of digits after the radix point.

On computers with no floating-point unit, fixed-point calculations are significantly faster than floating-point as all the operations are basically integer operations. Fixed-point representation also has the advantage of having uniform density, i.e., the smallest resolvable difference of the representation is R^-P throughout the representable range, in contrast to floating-point representations.

For example, in PL/I, FIXED data has both a precision and a scale-factor (P above). So a number declared as ‘FIXED DECIMAL(7,2)’ has a precision of seven and a scale-factor of two, indicating five integer and two fractional decimal digits. The smallest difference between numbers will be 0.01.

(2006-11-15)

Tagged: f

Read Also:

- Fixed-point representation
noun 1. (computing) the representation of numbers by a single set of digits such that the radix point has a predetermined location, the value of the number depending on the position of each digit relative to the radix point Compare floating-point representation

- Fixed point combinator
mathematics (Y) The name used in combinatory logic for the fixed point function, also written as “fix”. (1994-10-20)

- Fixed-price
noun 1. a price established by a seller, by agreement or by authority, as the price to be charged invariably.

- Fixed-rate pacemaker
fixed-rate pacemaker n. An artificial pacemaker that emits electrical stimuli at a constant frequency regardless of the heart’s rhythm.