Chapter 15
Reduction of State Tables State
Assignment
Microwave & Communication Lab.
Elimination of Redundant States
Ex Rework Z=1 if x=0101 or 1001 occurs.
The network resets after every four inputs.
Set enough states to remember the first three bits of
Chapter 14
Derivation of State Graphs
& Tables
Microwave & Communication Lab.
Sequence Detector
The detector will examine a string of 0s & 1s applied to
the X input and generate an output Z=1 only when a
prescribed input sequence occurs. In this network,
Chapter 13
Analysis of Clocked Sequential
Networks
Microwave & Communication Lab.
A Sequential Parity Checker
When binary data is transmitted or stored, an extra bit a
parity bit is frequently added for purposes of error
detection.
Odd( Even) parity The
Chapter 12
Counters Simular Sequential
Networks
Microwave & Communication Lab.
The counters discussed in this chapter are all synchronous.
This means the operation of the FFs is synchronized by the
common input pulse ( p ) so that when several FFs must
c
Chapter 11
Flip-Flops
Microwave & Communication Lab.
Microwave & Communication Lab.
Gate Delays
Timing Diagrams
Delay When the input to a logic gate is changed, the output will
not change instantaneously. The device within the gate takes a
finite time
Chapter 9
Multiple-Output Networks
Microwave & Communication Lab.
Design of Two-level Multiple-Output Networks
EX: Design a network with four inputs and three outputs
which realize the functions
F1(A,B,C,D) = m(11,12,13,14,15)
F2(A,B,C,D) = m(3,7,11,12,1
Chapter 7
Multi-Level Gate Networks
NAND & NOR Gates
Microwave & Communication Lab.
Multi-Level Gate Networks
The maximum number of gates cascaded in series
between a network input and the output is referred to as the
number of levels of gates.
Thus, a f
Chapter 6
Quine-McCluskey Method
Microwave & Communication Lab.
Determination of Prime Implicants: (using XY+XY=X)
(1)Express a function to a minterm expansion.
EX : f(A,B,C,D)= m(0,1,2,5,6,7,8,9,10,14)
(2)Write each minterm in its binary form, then sepa
Chapter 5
Karnaugh Maps
Microwave & Communication Lab.
Just like a truth table, the Karnaugh map of a function
specifies the value of the function for every combination of the
independent variables.
Construction of Kanaugh Maps :
2-Variable
B
A
0
a0
a1
1
Chapter 4
Minterm and Maxterm Expansion
Microwave & Communication Lab.
Combinational Network Design Using a Truth Table
EX
A
B
C
F
Microwave & Communication Lab.
A
0
0
0
0
1
1
1
1
BC
00
01
10
11
00
01
10
11
F
0
0
0
1
1
1
1
1
F
1
1
1
0
0
0
0
0
Methed1
Wri
Chapter 3-2
Algebraic Simplification
Microwave & Communication Lab.
The Consensus Theorem
proof
XY+XZ+YZ = XY+XZ+(X+X)YZ
= XY+XZ+XYZ+XYZ
= XY(1+Z)+XZ(1+Y)
= XY+XZ
Microwave & Communication Lab.
EX
ab+ac+bc+bc+ab
Sol
Let x = a , y = b , z = c
ab+ac+bc =
Chapter 3-1 Boolean Algebra
(Continued)
Microwave & Communication Lab.
Inversion
De Morgans laws
(X1+X2+X3+Xn)=X1X2Xn
(X1X2Xn)=X1+X2+X3+Xn
(proof by ? ? ? )
The complement of the product is the sum of the
complements.
The complement of the sum is the pro
Chapter 2
Boolean Algebra
Microwave & Communication Lab.
Boolean Variable
X, Y Variables of switching network
0,1 Two different states of switching network
X, Y complement or inverse of state X and Y
AND Denoted by .
Boolean algebra
OR Denoted by +
Boole