fixed-point

Computing Dictionary

fixed-point definition

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)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

00:10

00:09

00:08

00:07

00:06

00:05

00:04

00:03

00:02

00:01

Fixed-point is always a great word to know.
So is zedonk. Does it mean:
the offspring of a zebra and a donkey.
a chattering or flighty, light-headed person.
Dictionary.com, LLC. Copyright © 2012. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature