Bitwise NOT of 1011 0110 — NOT gate

exam standardone's complement of a byte

Answer

01001001

Why this example is worth doing

Inverting all eight bits gives the one's complement, which is not the same as negating the number — two's complement additionally adds 1, and the difference is exactly the reason for the asymmetric signed range. The page states the relationship −x = x̄ + 1 and links to the two's complement tool, where the same byte is worked through both ways. It is the clearest bridge on the site between gate logic and number representation.

Try your own input in the NOT gate. Truth table, symbol and algebraic form for the inverter, Ā.

How the answer is reached

Column by column

A10110110

result01001001

Column by column — columns bit, A, result
bitAresult
710
601
510
410
301
210
110
001

Compare with

Open the NOT gate

This input is entered in the tool itself — it is too rich for a link to carry.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • Gate symbols follow whichever standard the header toggle is set to: ANSI/IEEE Std 91-1984 distinctive shapes, or IEC 60617-12 rectangles.

Sources

  • ANSI/IEEE Std 91-1984, Graphic Symbols for Logic Functions
  • IEC 60617-12, Graphical Symbols for Diagrams — Binary Logic Elements