WEBVTT

00:00.060 --> 00:02.610
So let's start designing and overlapping segments.

00:03.000 --> 00:12.420
OK, so from the diagram that we required for Street AC2 as well as to justifying this type type.

00:14.040 --> 00:14.640
Dictate.

00:16.350 --> 00:17.190
Is.

00:18.480 --> 00:20.530
OK, here we required food elements.

00:20.550 --> 00:24.330
We have a zero as well as two and.

00:24.840 --> 00:28.200
Right, and we'll just declare a signal stic.

00:29.150 --> 00:39.920
OK, and now, depending on the type of methodology that you will be targeting, you need to choose

00:39.920 --> 00:43.910
whether you require a two state variable or a single seat variable.

00:43.940 --> 00:47.210
So what we'll do is we'll follow the process methodology.

00:47.480 --> 00:54.620
So this will be pretty easy and less lengthy compared to three percent methodology and easy as compared

00:54.620 --> 00:56.350
to single process methodology.

00:56.390 --> 00:59.240
OK, so for that reason, we require a two state.

00:59.930 --> 01:05.360
So one of the process where we will be writing the research logic will required or will work on a state

01:05.630 --> 01:08.660
and the process that will be decoding the state.

01:08.840 --> 01:09.890
We need to.

01:11.000 --> 01:17.840
You have other variables, which is next right now will proceed and let us first try to reset logic

01:17.840 --> 01:24.900
process or a reset decoder process, or you can give any name that you want to reset logic.

01:25.400 --> 01:28.670
This is the process that will be sensitive to a clock.

01:28.790 --> 01:30.110
OK, begin.

01:31.130 --> 01:38.900
And we'll just start in process right now here will be checking whether we have a rising age of a clock.

01:40.330 --> 01:48.510
So if you have a rising age of a clock, then in that case, if we said, OK, so for us, we have the

01:48.520 --> 01:51.060
reset button as Oreste.

01:51.880 --> 01:53.110
So if reset is one.

01:54.840 --> 02:05.310
So if we is one, then in that case, in that key state will be close to SC, right?

02:05.340 --> 02:15.510
So this is this we already knew El's and state will be close to the next step, which is the state being

02:15.780 --> 02:17.250
generated by our.

02:18.200 --> 02:20.460
Next process will we'll just.

02:22.480 --> 02:27.100
And if and then we just in the process, this makes sense.

02:27.700 --> 02:35.170
So this completes the first process and which is predominantly coming for all the example that we have

02:35.170 --> 02:36.140
considered so far.

02:36.160 --> 02:36.490
Right.

02:38.670 --> 02:41.730
Now will proceed and write a code for.

02:42.720 --> 02:49.180
The risk of further out, particularly as follows the next days, again, since we are targeting a due

02:49.220 --> 02:52.360
process methodology, so we will have a single process.

02:52.550 --> 02:54.280
So let me just add a next.

02:54.440 --> 02:59.630
And from the figure, you can guess that this is a media machine because you are all could depend on

02:59.900 --> 03:03.650
the state as well as an OK so process.

03:03.780 --> 03:09.320
And then we'll be making it due to vote state as well as as well as an input.

03:09.350 --> 03:17.150
So for us, the input in this debate will begin and then we'll add and process.

03:20.070 --> 03:26.160
Now we proceed, so here what we need to do is depending on the value of a state we have, we need to

03:26.160 --> 03:29.040
decide what should be the next year as well as what should be done.

03:29.400 --> 03:31.460
So we'll just be working on it.

03:31.480 --> 03:35.340
State, OK, is and we just add.

03:35.790 --> 03:37.180
And this.

03:38.440 --> 03:46.090
OK, so this is the usual also follow that once you are a block, for example, here we have our block,

03:46.420 --> 03:47.140
so immediately.

03:47.150 --> 03:47.420
Right.

03:47.430 --> 03:52.930
And so once we are in the process, block you immediately in the process, will later on will be finding

03:52.930 --> 03:58.210
that finding an error when you follow this process becomes very, very easy.

03:58.990 --> 04:01.850
So when we have a seal.

04:02.080 --> 04:02.270
Right.

04:02.390 --> 04:12.430
So when we have Aniceto, in that case, if this is when we mutu students might say.

04:15.500 --> 04:24.950
Dean is one right in that case are next and next, it should be Esswein.

04:25.930 --> 04:31.360
And I'll put in that case is the out is a quiz for you.

04:31.810 --> 04:34.270
So we be combining the next three as well.

04:34.270 --> 04:43.750
I'll put in the same process ends if we can figure out Elseworlds means when we have a zero, so we

04:43.750 --> 04:46.500
jump back to status and output is also zero.

04:46.510 --> 04:48.400
So we can just copy this to Streetman.

04:48.400 --> 04:49.770
We'll just be sitting here.

04:50.110 --> 04:54.730
So next week when we have been is zero is a zero.

04:55.920 --> 05:04.170
And the is still to this complete, the declaration for us right now will proceed on the declaration

05:04.170 --> 05:07.470
for Essence when we have an announcement eight.

05:10.490 --> 05:13.730
Similarly here, we need to end the threat, so.

05:15.910 --> 05:18.670
So when we have an istván, OK, so if.

05:19.950 --> 05:21.390
They'll be finding that we have.

05:22.400 --> 05:22.960
Zero.

05:23.000 --> 05:25.040
Then we jump to a nest, right?

05:25.070 --> 05:30.710
So is zero then in that case.

05:32.530 --> 05:41.650
We'll be having our next few days and I'll put it to you, this makes sense else and we'll just be seeing

05:41.650 --> 05:42.260
this again.

05:42.440 --> 05:44.560
OK, in that case.

05:45.540 --> 05:55.680
I see, so if we are innocent and we do see what rape is, basically we will see when then we will be

05:55.950 --> 05:59.260
staying in NSW and our people that this is also.

05:59.700 --> 06:00.630
So this makes sense.

06:00.640 --> 06:01.800
So once we complete our.

06:02.780 --> 06:10.190
State will decide and end the fight, so this complete declaration for right now, what we'll do is

06:10.190 --> 06:12.170
we'll just complete this entire state.

06:12.700 --> 06:17.110
OK, and now we'll just be sorry to hear.

06:17.390 --> 06:17.750
Right?

06:18.020 --> 06:23.670
So now we'll start writing a code for when we are in this to and if we receive one.

06:23.900 --> 06:25.410
So we'll just use this to.

06:26.550 --> 06:33.390
So if Christie won, the state should be a straight out to the Sillitoe when we are in a to receive

06:33.390 --> 06:33.800
zero.

06:33.870 --> 06:36.350
We jump back to Estie, right.

06:36.390 --> 06:39.210
So here we will be jumping to LSU and out to the.

06:43.090 --> 06:48.700
So when you copy an entire state, see that you go through each and every line through the possibility

06:48.700 --> 06:53.620
of adequately reduce to will again go ahead and will be stored here.

06:53.710 --> 06:54.070
Right.

06:54.370 --> 06:59.950
So when we are in a story, so we are in a story if we do see one.

07:00.160 --> 07:00.500
Right.

07:00.520 --> 07:01.870
So we reach to state.

07:02.530 --> 07:04.210
So if we do see one.

07:05.530 --> 07:10.240
We jump to the street and in this case, out of this one.

07:11.290 --> 07:18.100
Right ends and indicate when we are in history and we receive zero, we jump to any state assume and

07:18.100 --> 07:20.170
then output in that case is also see.

07:20.290 --> 07:23.900
So this completes all the study that we have inside our street diagram.

07:24.270 --> 07:31.220
Finally, when we have another look, what we will be doing is you can already guess that next week.

07:31.990 --> 07:36.280
OK, so next it will be equal to as Steidl.

07:36.700 --> 07:37.020
Right.

07:37.270 --> 07:41.440
And the out should be equal to equal.

07:42.430 --> 07:42.720
Right.

07:43.060 --> 07:46.570
So this completes the entire state machine with a K Street.

07:46.780 --> 07:53.560
Now we'll just need everything that we have, an extra spaces and we'll proceed to what we want to,

07:53.560 --> 07:54.130
in fact, will be.

07:54.130 --> 07:56.180
Finally, we get a green indication over here.

07:56.440 --> 08:04.420
So everything seems to be fine for a while right now, will proceed and see whether we are able to.

08:07.140 --> 08:08.010
Verifier.

08:10.360 --> 08:10.840
Steve.

08:14.070 --> 08:16.650
So what we'll do is we'll just click on Run Simulation.

08:19.240 --> 08:25.330
So we have designed a state mission for one zero and remember, OK, now what we'll do is we'll do the

08:25.330 --> 08:26.710
clocks right click.

08:28.260 --> 08:31.560
Foods slok, OK, will apply.

08:31.590 --> 08:33.160
One nine zero, OK?

08:33.230 --> 08:36.440
Remember that we have two hundred nine.

08:36.900 --> 08:45.500
OK, first let us just make our set to be OK and try to execute our code for less than a thousand nanoseconds.

08:45.510 --> 08:53.160
We'll be finding that we predominantly state, as you right now, will try to execute our code single

08:53.160 --> 08:54.150
cycle by cycle.

08:54.150 --> 08:54.420
Right.

08:54.450 --> 09:00.630
So the first thing that you'll be doing is we change this, put it on the top two hundred nanosecond

09:00.640 --> 09:01.930
because that is our property.

09:01.950 --> 09:08.420
So this will allow us to execute our code for single rate, will remove the risk.

09:08.790 --> 09:11.090
So we will apply for constraints zero.

09:11.490 --> 09:19.590
Now, first state inside our sequence is one, so we'll just use force and apply one, OK, and will

09:19.590 --> 09:23.980
execute our code for single cycle and you'll be noticing that we move on to an extra.

09:24.030 --> 09:30.800
They do this right now will make the zero because inside the sequence, the next step that we have is

09:30.810 --> 09:31.960
zero, OK.

09:32.190 --> 09:34.320
And will execute again for a single clock.

09:34.740 --> 09:35.050
Right.

09:35.310 --> 09:39.690
So we have one zero now will again use for sponsoring one.

09:40.670 --> 09:46.540
Try to execute the call, and we again required one movement, so we just execute once, OK?

09:46.590 --> 09:51.580
And it'll be finding that as we detect one zero one one, you'll be able to see one.

09:51.860 --> 09:56.560
Right, if you again add one since this is overlapping.

09:58.210 --> 10:05.380
OK, so we'll be finding if you just again, the one so this will take us to the streets and then just

10:05.380 --> 10:07.600
we need to check Setu.

10:08.650 --> 10:09.960
And one right.

10:10.860 --> 10:15.090
So what we'll do is we'll just apply for Negi.

10:18.110 --> 10:25.570
OK, audience cheering If we just apply zero, OK, in that case, we just need to detect one on one,

10:25.580 --> 10:25.840
right?

10:25.860 --> 10:37.130
So we'll just apply zero zero here will just apply C2, OK, and then we just apply to one to one.

10:38.440 --> 10:41.920
And one more one and able to see.

10:43.420 --> 10:45.040
That again, becomes.

10:47.140 --> 10:51.040
Right, so our sequence counter is working fine.

10:51.570 --> 10:54.140
So this is how you can test your sequence.

10:54.570 --> 11:01.500
In fact, the good idea could be that you write it as speech so that your assignment on how you will

11:01.500 --> 11:03.710
be writing the test for this sequence.

11:04.110 --> 11:08.270
So you'll have more insight into how we can verify design automatically.

11:08.760 --> 11:11.750
But this sequence rectories seems to be working fine, right?
