# One's Complement Fixed-Point Format

## GUIDE: Mathematics of the Discrete Fourier Transform (DFT) - Julius O. Smith III. One's Complement Fixed-Point Format

It appears that you are using AdBlocking software. The cost of running this website is covered by advertisements. If you like it please feel free to a small amount of money to secure the future of this website.

NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION: "Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition", by Julius O. Smith III, W3K Publishing, 2007, ISBN 978-0-9745607-4-8. - Copyright © 2017-09-28 by Julius O. Smith III - Center for Computer Research in Music and Acoustics (CCRMA), Stanford University

<< Previous page  TOC  INDEX  Next page >>

### One's Complement Fixed-Point Format

One's Complement is a particular assignment of bit patterns to numbers. For example, in the case of 3-bit binary numbers, we have the assignments shown in Table 4.3.

Table 4.3:Three-bit one's-complement binary fixed-point numbers.
 Binary Decimal 000 0 001 1 010 2 011 3 100 -3 101 -2 110 -1 111 -0

In general, -bit numbers are assigned to binary counter values in the ''obvious way'' as integers from 0 to , and then the negative numbers are assigned in reverse order, as shown in the example.

The term ''one's complement'' refers to the fact that negating a number in this format is accomplished by simply complementing the bit pattern (inverting each bit).

Note that there are two representations for zero (all 0s and all 1s). This is inconvenient when testing if a number is equal to zero. For this reason, one's complement is generally not used.

<< Previous page  TOC  INDEX  Next page >>