Digital Short Notes
Digital Short Notes
Maximum positive value is taken as logic „1 Maximum positive value is taken as logic „0 Finding the dual of a given Boolean expression
+5V ----> logic “1”
„ 1. ∗ ↔ +
+5V ----> logic “0” 2. 0 ↔ 1
0V ----> logic “0 “ 3. Keep the variables as it is
0V ----> logic “1 “
A+ 0 = A A∗ 𝟏 = 𝑨 BVREDDY
1+A= 1 A∗ 𝟎 = 𝟎
A∗ 𝑨 = 𝑨 Distribution Law
A+A=A (Mingle wala)
𝑨𝑩 = 𝑨 + 𝑩 (A+B)(A+C)= A+BC
A∗ 𝑨 = 0 A(B+C)=AB+AC
A+𝑨= 1 𝑨 + 𝑩 = 𝑨𝑩
A+BC= (A+B)(A+C)
BVREDDY
BVREDDY
NOT GATE AND GATE OR GATE
𝒀=𝑨 Y = AB Y =A+B
The output is the compliment of the input BVREDDY
• Output is „0‟ if any one input „0‟ • Output is „1‟ if anyone of the inputs are „1‟
A Y=A A Y=A • Y = AB = 𝚺 𝟑 = 𝚷(𝟎, 𝟏, 𝟐) • Y = A+B = 𝚺 𝟏, 𝟐, 𝟑 = 𝚷(𝟎)
• Enable input ⟹ 1 • Enable input ⟹ 0 BVREDDY
RS • Disable input ⟹ 0 • Disable input ⟹ 1
• Commutative law ⟹ Obeys • Commutative law ⟹ Obeys
Y= 𝑨 • Associative law ⟹ Obeys • Associative law ⟹ Obeys
A VS A
A+B A
A AB A A A+B A+B
B B AB
B B
A A RS A
A A RS A B
A B VS A B VS B Y=
A+B
Y = AB
A
A AB
AB A+B
B
B
A A
A+B A
A+B
AB
B B B
BVREDDY
NAND GATE NOR- GATE
𝒀 = 𝑨𝑩 𝒀=𝑨+𝑩
• Output is ‘1’ if any one input is ‘0’ • Output is ‘0’ if any one of the input is ‘1’
• 𝒀 = 𝑨𝑩 = ∑ 𝟎, 𝟏, 𝟐 = ∏(𝟑) • 𝒀 = 𝑨 + 𝑩 =∑ 𝟎 = ∏(𝟏, 𝟐, 𝟑)
• Enable input --1 • Enable input --0
• Disable input– 0 BVREDDY • Disable input– 1
• Commutative law ---> Obeys • Commutative law ---> Obeys
• Associative law ----> not Obeys • Associative law ----> not Obeys
A 𝐀𝐁 A 𝐀+𝐁
A A+ B A A.B
B B 𝐀𝐁 B B
A+ B BVREDDY
RS
RS
A B A B
A B VS A
VS
B Y=𝑨 + 𝑩
Y =𝐀𝐁
A A
A
AB
B A+B
B B
BVREDDY BVREDDY
EX-OR GATE BVREDDY A
A A B
A ⊕ 𝐴B = A + B
AB ⊕ BC = B(A ⊕ C)
Y = A⊕B
A
B
BVREDDY
A A A B
EX-NOR GATE BVREDDY
Y = A⊙B Y = A⊙B
Output is „1‟ for even number of „1‟s in the input VS
A B
Y = A ⊙ B = ∑ 0,3 = Π(1,2) VS
B B
Commutative law ⟹ Obeys
Associative law ⟹ not Obeys
A⊙0=A
A⊙1=A BVREDDY
A⊙A=1 A Y = A⊙B
A
Y = A⊙B
A⊙A=0 B B
A ⊙ A ⊙ A ⊙………...n times = A , n is odd
1, n is even
A⊙B=A⊕B
A⊕B=A⊙B BVREDDY
CD
Minterm mode Maxterm mode
CD CD CD CD
Implicant : Each minterm in canonical SOP expression is known as AB CD
C+D C+D C+D C+D
AB
Implicant . AB ABCD A BC D A BC D A BC D
A+B +C+D A+B +C+D
0 1 3 2 A+B A+B +C+D A+B +C+D
Prime Implicant is a product term , obtained by combining maximum 0 1 3 2
ABCD ABCD ABCD ABCD
possible cells in the K- Map. While doing so make sure that a smaller AB A+B +C+D A+B +C+D A+B +C+D A+B +C+D
4 5 7 6 A+B
group is not completely inside a bigger group . 4 5 7 6
ABCD ABCD ABCD ABCD
Essential Prime Implicant : A prime Implicant is an EPI , if and only AB
12 13 15 14 A+B
A+B +C+D A+B +C+D A+B +C+D A+B +C+D
if it contains at least one minterm which is not covered by multiple ABCD ABCD
12 13 15 14
ABCD ABCD
AB
groups 8 9 11 10 A+B
A+B +C+D A+B +C+D A+B +C+D A+B +C+D
8 9 11 10
Worst case delay for Sum = Max( xor ,and)+ (𝑡𝑝𝑑 )𝑎𝑛𝑑 + (𝑡𝑝𝑑 )𝑜𝑟 + (𝑡𝑝𝑑 )𝑥𝑜𝑟 BVREDDY
Multiplexer (MUX) Decoder is a special case of
Data selector BVREDDY One input to many output Decoder is a multi input ,multi Demultiplexer , in which the
Many to one Data distributor output logic circuit which coverts select lines or Demultiplexer
Universal logic gate
One to many circuit coded input into coded output , are treated as input's to the
Parallel to serial converter
𝟐𝒏 × 1 1 × 2𝑛 where the input and output codes decoder and input of
2𝑛 ----------> number of data inputs n---------> number of select lines are different Demultiplexer is treated as
n -----------> number of select inputs 2𝑛 --------> number of output lines Enable input of the Decoder
1 ------------> number of outputs 1 ----------> number of inputs n -------------> number of inputs
BVREDDY -------------> number of outputs
Logic Gate Number of
MUX All 2 variable functions
Encoder is a combinational circuit , which is 1. By using one 4 × 1 Mux
required used to convert Some but not All 3 variable functions
BVREDDY
BUFFER 1 1. Octal to binary ( 8 × 3 encoder ) All 2 variable functions
NOT 1 2. Decimal to Binary ( 10× 4 encoder ) 2. By using one 4 × 1 Mux + NOT
3. Hexadecimal to Binary ( 16 × 4 encoder ) Gate All 3 variable functions
AND 1
2𝑛 𝑋 𝑛 All 3 variable functions
OR 1 n -------------> number of outputs 3. By using one 8 × 1 Mux
2𝑛 -------------> number of inputs Some but not All 4 variable
NAND 2
For an Encoder at a time only one among functions
NOR 2 the all inputs is high , reaming all inputs All 3 variable functions
should be zero 4. By using one 8 × 1 Mux +
EX-OR 2 All 4 variable functions
If multiple inputs are simultaneously NOT Gate
EX-NOR 2 high, then the output is not valid, to avoid One 𝟐𝒏 × 1 MUX
HA 3 this restriction we will go for priority 5. n- variable function
encoder.
HS 2 One 𝟐𝒏−𝟏 × 1 MUX + one NOT Gate
BVREDDY
Sequential Circuits For SR NAND latch , if the input sequence is BVREDDY
00 ---------> 11 , then the following cases arises
The logic circuit whose outputs at any instant of time
If the delay of both gates are same then we don‟t have any stable output
depends on the present inputs as well as on the past outputs , the output is oscillatory , this condition is known as critical race
are called sequential circuits, in sequential circuits ,the output However if the delay of both gates are not equal then there exist a
signals are fed back to the input side . BVREDDY
stable output , but it depends on the individual delay of the gates
Out put of combinational circuit depends on input combinations .
For SR NOR latch , if the input sequence is
Output of sequential circuits depends on input sequence.
11 ---------> 00 , then the following cases arises
For unequal delay of gates also the operation is valid
If the delay of both gates are same then we don‟t have any stable output
NAND LATCH
A NOR LATCH , the output is oscillatory , this condition is known as critical race .
x X However if the delay of both gates are not equal then there exist a
A
stable output , but it depends on the individual delay of the gates .
B y Y
B FLIP FLOP
In a latch the output changes immediately in response to external input , so
A B X Y A B X Y to have an additional control , we are introducing a signal called “ CLOCK
0 0 1 1 “ , whose purpose is same as Enable pin of Decoder.
0 0 1 1
Latch +Clock = Flip Flop
0 1 0 1 0 1 1 0 Latches are universally not unique and hence their truth tables are not
1 0 1 0 1 0 0 1 unique .
Flip Flops are universally unique , and their truth tables are unique .
1 1 Memory 1 1 Memory
BVREDDY
1 0 0 1 1 1 0 0 1 1
BVREDDY State
CLK J K Q+
1 0 1 0 0
1 0 1 0 0
0 × × Q
CLK S R Q+ State Memory 1 0 1 1 0
1 0 1 1 0
0 × × Q
Memory 1 0 0 Q
Memory 1 1 0 0 1
1 1 0 0 1
1 0 0 Q
Memory 1 0 1 0 1 1 0 1 1
Reset
1 0 1 0 1 1 0 1 1
Reset 1 1 0 1 1 1 1 0 1
1 1 1 0 ×
Set
1 1 0 1
Set 1 1 1 𝑸 1 1 1 1 0
1 1 1 × 1 1 1 1 × Toggle
Invalid
Q Q+ J K
Q Q+ S R S=0 R=X J = 0K = X J=X K=0
S=X R=0 0 0 0 X J=1 K=X
S=1 R=0
0 0 0 X
0 1 1 X Q=0 Q=1
0 1 1 0 Q=0 Q=1
1 0 X 1
1 0 0 1 J=X K=1
CLK D Q Q+ J Q
D J Q D CLK T Q Q+
JK JK
Flip Flop 0 X Q Q CLK Flip Flop 0 X Q Q
K Q BVREDDY K Q
1 0 0 0 + 1 0 0 0
Q =T⊕Q
Q+ = D
1 0 1 0 1 0 1 1
CLK T Q+
CLK D Q+ 1 1 0 1 0 X Hold 1 1 0 1
0 X Hold 1 0 Q
1 0 0 1 1 1 1 1 1 1 0
1 1 Toggle
1 1 1
BVREDDY
D=0
Q Q+ D Q Q+ T T=0 T=0
D=1 T=1
D=1
0 0 0 0 0 0
Q=0 Q=1 Q=0 Q=1
0 1 1 D=0 0 1 1
T=1
1 0 0 1 0 1
BVREDDY
Use the Code :
1 1 1 1 1 0
BVREDDY
Race Around Condition BVREDDY
Master – Slave Flip Flop BVREDDY
The output of the FF changes to 0 1 0 …. Continuously
at the starting of the next clock the output is uncertain , which
JM = 1 S QM JS QS
is called as Race Around Condition (RAC )
M S
RAC occurs in any FF if the following conditions satisfies KM = 1 R QM KS QS
1. If the FFs are operated in level triggering
2. if (tpd ) < (Tclk )on ,
3. If the FFs are operated in Toggle mode CLK
If the above 3 conditions satisfies simultaneously then there is 1. In case of Master Slave configuration , Master is applied with input clock and
a continuous race in the output of the FF between 0 and 1 to Slave is applied with inverted clock , so out of two FFs at a time only one of
reach the next state , who will be the winner of the race in not the FF respond and other will not respond . As a result, Many times toggling in
certain , that depends on tpd and ( Tclk ) on . a single clock cycle has been converted to one time toggle , hence RAC is
Remedy avoided .
1. ( Tclk )on < (tpd ) < T BVREDDY 2. In Master Slave configuration , command signal is generated by master FF
2. By using Edge triggered FF and the response of the command signal is given by slave FF
3. By using Master Slave FF 3. Master slave FF can store 1 – bit of data
C
O F
N L
V I
E
R
of P
S BVREDDY
A F
T L
I
O O
N P
BVREDDY
CLK CLK
CLK CLK CLK CLK CLK
1
𝑓𝐶𝐿𝐾 ≤
𝑡𝑝𝑑 Use the Code :
BVREDDY
Ring counter Johnson ring counter
Mealy Modal
0/0
1. Mod No = n BVREDDY 1. Mod No = 2n
NS , O/P
2. Number of used states= n 2. Number of used states= 2n Present a 1/0
X =0 X= 1 1/1
state
Number of unused states = 2𝑛 − 𝑛 Number of unused states =22𝑛 − 𝑛
0/0 0/1
d b
3.Time period of each FF = n(𝑇𝐶𝐿𝐾 ) 3.Time period of each FF = 2n(𝑇𝐶𝐿𝐾 ) a a ,0 b,0
0/0 c 1/0
4. Frequency of each FF =
𝑓𝑐𝑙𝑘
4. Frequency of each FF =
𝑓𝑐𝑙𝑘 b b, 1 c,0
𝑛 2𝑛
1/0
5. Suffer from lock out problem 5. Suffer from lock out problem c d, 0 c,0