Dr.

Alshimaa Hamdy
ORCID: orcid.org/0000-0003-4650-0484
Web of Science Researcher
ID: publons.com/researcher/AAP-2239-2020/
Google Scholar Citation: Dr. Alshimaa Hamdy (Alshimaa H. Ismail)
 Complements

 1’s Complement
 All ‘0’s become ‘1’s
 All ‘1’s become ‘0’s
Example (10110000)2
⇨ (01001111)2
 If you add a number and its 1’s complement …

Digital Numbering System Dr. Alshimaa Hamdy 2

 Complements
 2’s Complement
OR
◆ Take 1’s complement then add 1
◆ Toggle all bits to the left of the first ‘1’ from the right

Digital Numbering System Dr. Alshimaa Hamdy 3

 Logic Gates

Binary Logic Gates

 Digital Computers

- Imply that the computer deals with digital information, i.e., it deals
with the information that is represented by binary digits
- Why BINARY ? instead of Decimal or other number system ?

* Consider electronic signal

1 7
6
5 signal
4
3 range
2
0 1
0
binary octal

* Consider the calculation cost - Add 0

Digital Numbering System
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
1 1 2 3 4 5 6 7 8 9 10
0 1 2 2 3 4 5 6 7 8 9 1011
3 3 4 5 6 7 8 9 101112
0 0 1 4 4 5 6 7 8 9 10111213
5 5 6 7 8 9 1011121314
1 1 10 6 6 7 8 9 101112131415
7 7 8 9 10111213141516
Dr. Alshimaa Hamdy
8 8 9 1011121314151617 4
9 9 101112131415161718
 BASIC LOGIC BLOCK - GATE -
Binary Binary
Digital Gate Digital
. Output
Input .
. Signal
Signal

 Types of Basic Logic Blocks

*
Logic Blocks whose output logic value
depends only on the input logic values

*
Logic Blocks whose output logic value
depends on the input values and the
state (stored information) of the blocks

 Functions of Gates can be described by

Digital Numbering System - Truth Table

Dr. Alshimaa Hamdy 5

- Boolean Function
- K-Map
 Name Symbol Function Truth Table
A B X
A X=A•B 0 0 0
AND X or 0 1 0
1 0 0
B X = AB 1 1 1
A B X
A 0 0 0
OR X X=A+B 0 1 1
1 0 1
B 1 1 1
A X
I 0 1
A X X = A’ 1 0
A X
0 0
Buffer A X X=A 1 1
A B X
A 0 0 1
NAND 0 1 1
X X = (AB)’ 1 0 1
B 1 1 0
A B X
A 0 0 1
NOR X X = (A + B)’ 0
1
1
0
0
0
B 1 1 0
A B X
A X=AB
XOR X or
0
0
0
1
0
1
Exclusive OR 1 0 1
B X = A’B + AB’
1 1 0
A B X
A X = (A  B)’
XNOR X or
0
0
0
1
1
0
Digital Numbering System Dr. Alshimaa
Exclusive NOR Hamdy 6
B X = A’B’+ AB 1 0 0
or Equivalence 1 1 1
 * Algebra with Binary(Boolean) Variable and Logic Operations
* Boolean Algebra is useful in Analysis of Digital Logic Circuits

- Input and Output signals can be

represented by Boolean Variables
- Function of the Digital Logic Circuits can be represented by
Logic Operations (Boolean Functions)
- From a Boolean function, a logic diagram
can be constructed using AND, OR.. etc

* The most elementary specification of the function of a Digital Logic

Circuit is the Truth Table

- Table that describes the Output Values for all the combinations
of the Input Values, called MINTERMS
Digital Numbering System Dr. Alshimaa Hamdy 7
 LOGIC CIRCUIT DESIGN
x y z F
0 0 0 0
Truth 0 0 1 1
Table 0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
Boolean F = x + y’z
Function

x
F
Logic y
Diagram
z
Digital Numbering System Dr. Alshimaa Hamdy 8
 [1] x + 0 = x [2] x • 0 = 0
[3] x + 1 = 1 [4] x • 1 = x
[5] x + x = x [6] x • x = x
[7] x + x’ = 1 [8] x • X’ = 0
[9] x + y = y + x [10] xy = yx
[11] x + (y + z) = (x + y) + z [12] x(yz) = (xy)z
[13] x(y + z) = xy +xz [14] x + yz = (x + y)(x + z)
[15] (x + y)’ = x’y’ [16] (xy)’ = x’ + y’
[17] (x’)’ = x

Usefulness of this Table

- Simplification of the Boolean function
- Derivation of equivalent Boolean functions
to obtain logic diagrams utilizing different logic gates
-Ordinarily ANDs, ORs, and Inverters
-But a certain different form of Boolean function may be convenient
to obtain circuits with NANDs or NORs
→ Applications of De Morgan's Theorem

Digital Numbering System Dr. Alshimaa Hamdy 9

 Many different logic diagrams are possible for a given Function
F = ABC + ABC’ + A’C .......…… (1)
= AB(C + C’) + A’C [13] ..…. (2)
= AB • 1 + A’C [7]
= AB + A’C [4] ...…. (3)
A
B
(1) C
F

A
(2) B
F
C

A
B
(3) F
Digital Numbering System Dr. Alshimaa Hamdy 10
C
Digital Numbering System Dr. Alshimaa Hamdy 11