*Have you been using float or double variables to perform mathematical operations on embedded systems without a Floating-Point Unit (FPU)? You are doing it wrong! That’s incredibly inefficient. Use fixed-point representation instead.*

An

**FPU**is an hardware block specially designed to carry on arithmetic operations on floating point numbers. Even though the

**C/C++**code may work without an

**FPU,**it’s always much faster to use hardware designed for a specific purpose, like this one, instead of relying on a software implementation, something that the compiler will do for you, knowing the hardware restrictions you have but not in an efficient manner. Essentially, it will generate a lot of assembly code, greatly increasing the size of your program and the amount of time required to complete the operation. Thus, if you don’t have an

**FPU**available and you still want to perform those arithmetic operations efficiently you’ll have to

*convert*those numbers to

*fixed-point representation*. Integers! But how? By scaling them. Let’s see how that scaling value may be determined.

The scaling value as well as the resulting scaled number, which is an integer, really much depends on the bit ness of the

**CPU’s**architecture being used. You want to use values that fit in the available registers which have the same width as the CPU buses. So, whether you are working with an

**8, 16**or

**32-**bit architecture, the range of integer values we can store on those registers, being

*b*the number of bits and representing numbers in

**two’s complement,**is given by:

**−2b−1≤value≤2b−1–1**

### Fixed-Point Representation

If one bit is used to represent the sign (and in this text we’ll always consider signed numbers) the remaining ones may be used to represent the integer and fractional parts of the floating-point number. We may textually represent this format as follows (denoted as **Q-**format):

**Qm.n**

Where *m* corresponds to the bits available to represent the integer part of and *n* corresponds to the bits available to represent the fractional part. If ** m **is zero you may use just

*Qn*. So, when you use a register to save both integer and fractional parts (and the sign bit!), the value range is then given by:

**−2m≤value≤2m–2−n**

(note that the expression above is a particular case of this one, for **n=0 and m=b-1).**

It’s up to you deciding how many bits are reserved for *m* and *n* (still, you should base your decision on a good criteria: the more bits, the greater the precision you can achieve; more on this bellow). So, you are essentially *fixing* an *imaginary point* in your register that separates the integer and fractional parts. That’s why it’s called fixed-point.

**Read More: The Art of Representing Floating-Point Numbers as Integers**