00:04

in the last presentation we did the

00:06
analysis of clop sequential circuits
00:09
with D flip-flop and in this
00:11
presentation we will continue the
00:13
analysis with JK flip-flop and I have
00:16
taken the circuit in which there are two
00:18
JK flip-flops the A and the B these are
00:23
my two JK flip-flops and in this circuit
00:26
in this sequential circuit you can see
00:28
there is an input combinational logic but
00:31
there is no output combinational logic
00:33
as compared to the last presentation so
00:36
our task is easier why because we don't
00:39
have to worry about the output equation
00:41
the output is simply the output of this
00:44
two flip-flops that's why we don't have
00:47
to find out the output equation we have
00:49
to only find out the input equation so
00:52
what asked is little bit easier but at
00:54
the same time
00:55
our task is tough because we have to
00:58
find out the next state values depending
01:01
upon the values of the JA, KA, JB, and KB
01:04
you will get this thing when we will
01:06
move to our state table so without
01:08
wasting any time let's move to our step 1
01:12
step1 we will find out the
01:17
input equation and that the input
01:21
equation is nothing but the expression
01:23
for JA, KA, JB and KB so first I will
01:27
find out the expression for J which is
01:30
very simple
01:31
it's simply QB you can see QB is
01:34
connected to JA so JA is equal to QB
01:39
now I will find out the expression for K
01:42
a K is what it is the output of this and
01:46
gate and the two inputs to this and gate
01:49
is JA here it is JA and this input is
01:53
X compliment X is my input X is my input
01:57
and I have taken the compliment and then
02:00
I have given it to this and gate so the
02:02
output of this and gate is X compliment
02:06
J aim which is equal to K a so I will write K
02:11
equals X compliment JA we are done
02:16
with the A flip-flop now we will move to
02:18
the B flip-flop first I will find out J
02:21
be it is equal to X compliment and the
02:25
KB is the output of this XOR gate let's
02:29
see what are the inputs of this XOR gate
02:32
the first input is QA and the second
02:36
input is X so the output is XOR QA
02:42
so KB is equal to XOR our QA this
02:47
is my odd ones detector I can also write
02:49
it as X complement QA or QA complement X
02:55
so we are done with our step one in
02:58
which we have find out the different
03:01
expressions for our different input now
03:03
we will use this to find out our state
03:06
table and finally by using the state
03:09
table we will have our state diagram now
03:11
I will copy these expressions so that I
03:13
can paste it near to my state table and
03:17
I will use these equations to fill the
03:19
state table so copy and then paste now
03:25
let's take it near to my state table I
03:28
have already made the state table so
03:31
that we can save some time okay it will
03:36
work here fine now you can see the
03:41
present state is QA QB X is my input and
03:45
QA plus QB plus is my next state so
03:51
let's find out what is the next state by
03:53
using the characteristic table of the JK
03:56
flip-flop for that we have to find out
03:57
the values of JA, KA, JB and KB so let's
04:01
start with JA, J is what it is simply
04:04
QB so whatever be the value of QB
04:07
it's going to be JA so I will copy QB
04:11
and I will paste it
04:21
here now we will see for ka JX
04:27
complement JA so let's check what we
04:30
have X complement JA here this is X
04:33
this is JA the complement of 0 is 1 and
04:36
it is ended with 0 so it will give us 0
04:40
0 0 will give us 0 again 1 1 will give us 1
04:45
0 1 will give us 0, 1 a 0 will give us 0
04:50
0 0 again 0, 1 1 it is 1 and
04:56
finally 0 and 1 is 0 so we are done with
05:00
JA KA now we can find out the next state
05:04
values of a flip-flop so let's do it
05:07
you already know the properties of the
05:09
JK flip-flop or the truth table of the
05:11
JK flip-flop so by using it we will find
05:14
out the next state and let's check for
05:17
this first case when QA is 0 we don't
05:21
have to see QB because it is the present
05:24
state of B flip-flop we have to find out
05:26
the next state of a flip-flop so we have
05:28
to see the present state of a flip-flop
05:30
so we will see QA 0 and a JA KA both
05:35
are 0 it means the memory state the next
05:38
state is going to be 0 so QA plus is 0
05:42
and for this case Q is 0 and JA KA are
05:46
again 0 0 so again the memory state QA 0
05:51
JA is 1, K is 1 it means toggling and in
05:54
toggling we just take the compliment of
05:57
the present state so 0 is the present
05:59
state taking its compliment I'm having
06:01
one and for this case QA 0, J is 1, K is 0
06:07
so simply QA plus is 1 again
06:11
0 0 that's why a memory state QA is 1 so it's going
06:14
to be 1 0 0 memory state Q is 1 again it
06:18
is 1 and the 1 1 toggling one is the QA
06:22
so complement of Q is 0 so because of
06:25
I'm having the next state is 0 and
06:28
for the last case 1 0
06:31
and the QA is 1 no problem the next
06:34
state is going to be 1 so to fill the
06:37
values of next state you must know the
06:39
truth table of the JK flip-flop if you
06:42
don't know it I cannot help you here you
06:44
have to remember the truth table for the
06:46
JK flip-flop if you know the
06:48
characteristic table it will work but if
06:50
you know the truth table you know how we
06:52
are filling these values so we are done
06:55
with the a flip-flop now we will move
06:57
for the B flip-flop and for that we have
07:00
to find out JB and KB, JB is x complement
07:04
so it's simply the complement of all
07:07
these values so I'm having 1 0 1 0 1 0 1 & 0
07:16
KB is the XOR combination of X and
07:19
QA so it is simply the odd ones
07:23
detector so we will see the odd number
07:26
of ones in Q a and X let's start with it
07:30
0 0 it means no 1’s so 0 is here 0 1
07:37
odd one is there so 1 0 0 again 0 0 1 is
07:42
1 1 0 is 1 1 1 even number of 1 so 0 1 0
07:49
is again 1 and finally 1 1 even ones are
07:53
there so 0 now we are done with the JB
07:56
and KB the two inputs of our B flip-flop
08:00
and by using it we will find out the
08:02
next state that is Q B-plus so let's
08:05
start with it and we will now see the
08:09
present state of the B flip-flop which
08:12
means Q B, so QB is 0, JB is 1, KB is 0
08:17
it means QB plus is 1, QB is 0, JB 0, KB is 1
08:22
it means 0 again 1 0 it means 1,
08:27
0 1 means 0, 1 1 is toggling toggling means
08:30
the complement of the present state
08:32
present state is 0 and we will take its
08:35
complement so it will give us 1,
08:37
0 0 is memory state 0 is the present state so
08:40
we are having 0 as the memory and the 1
08:43
1 again
08:45
I have to take the compliment of 1 so
08:47
it will give us 0 and finally zero
08:50
0 the memory state present state is 1
08:52
and it's going to be 1 so this is the
08:55
complete state table we are done with
08:58
the step number 2 also and the final
09:02
step is to make the state diagram by
09:04
using this state table and as there are
09:07
two flip-flops there are total four
09:09
possible States and these states are S0 which is 0 0
09:13
S1 is 0 1, S2 is 1 0
09:21
and S3 is 1 1, I will make these states
09:25
here and by using this state table we
09:28
will see the transition in the state
09:30
diagram so these are my four states ok
09:36
and this is S0 so 0 0, this is S1 0 1
09:42
this is S2 1 0 this is S3 so 1 1 now
09:47
let's see for the first case when the
09:50
input is 0 and we are on S0 0 0 means
09:54
we are on as 0 we are here and the input
09:58
is 0 so the next state that is QA plus
10:02
and QB plus is 0 1 so from 0 0 we are
10:07
going on 0 1 like this ok and the input
10:12
is 0 simply now we will see for this
10:16
case when we are on 0 0 it means
10:20
S0 and the input is 1 in this case the
10:22
input was 0 and it drives us from s 0 to
10:26
S1 now if I make the input 1 what I am
10:29
getting is the same state the next state
10:32
is same as the present state, so I'm
10:34
going to be on S0 when the input is 1
10:38
and when I am on S1 0 1 is my S1 and
10:44
if I make the input equals to 0, I am
10:47
going on 1 1, it means I'm going on S3
10:52
if I make the input equal to 0 and when
10:55
input is 1, and I'm on S1 the
10:58
state is 1 0 it means it is S2 so I'm
11:01
going to be on S2 from S1 if input is 1
11:06
now let's check when we are on S2 and
11:09
the input is 0 we are going to be on S3
11:13
so from S2, I am going on S3 when input
11:17
is 0 and the venom on S2 and input is 1
11:21
I'm going to be on S2 itself so the same
11:28
state if the input is 1 and for the last
11:32
case when I am on S3 that means 1 1 if
11:36
input is 0, I'm going to be on as 0
11:40
so this is S0 when input is 0 final case
11:44
when I am on S3 and if input is 1
11:48
I'm going to be on S3 so I'm going to be on
11:51
S3 if input is 1 so this is the complete
11:55
state diagram for this circuit that I
11:57
have made and this is a proper way to
12:00
deal with the sequential circuit in this
12:03
case we have to do a little bit of extra
12:05
work because of this next state we have
12:08
to find out this next state depending
12:10
upon the values of JA, KA, JB, KB whereas
12:14
in case of D flip-flop the next state
12:16
the next state Q and plus 1 is simply
12:19
equal to the value of D so there is no
12:21
need to see the present state and see
12:24
the values of JA KA or J became this
12:27
is the extra work that we have to do in
12:29
this presentation but really we are
12:31
lucky that we don't have to find out the
12:34
expression for Y otherwise there may be
12:36
one more column for Y that is our output
12:39
and we have to see for the output also
12:41
so that must have taken four to five
12:44
extra minutes of our so this is all for
12:46
this presentation I will end it here