So let's start designing and overlapping segments.
OK, so from the diagram that we required for Street AC2 as well as to justifying this type type.
Dictate.
Is.
OK, here we required food elements.
We have a zero as well as two and.
Right, and we'll just declare a signal stic.
OK, and now, depending on the type of methodology that you will be targeting, you need to choose
whether you require a two state variable or a single seat variable.
So what we'll do is we'll follow the process methodology.
So this will be pretty easy and less lengthy compared to three percent methodology and easy as compared
to single process methodology.
OK, so for that reason, we require a two state.
So one of the process where we will be writing the research logic will required or will work on a state
and the process that will be decoding the state.
We need to.
You have other variables, which is next right now will proceed and let us first try to reset logic
process or a reset decoder process, or you can give any name that you want to reset logic.
This is the process that will be sensitive to a clock.
OK, begin.
And we'll just start in process right now here will be checking whether we have a rising age of a clock.
So if you have a rising age of a clock, then in that case, if we said, OK, so for us, we have the
reset button as Oreste.
So if reset is one.
So if we is one, then in that case, in that key state will be close to SC, right?
So this is this we already knew El's and state will be close to the next step, which is the state being
generated by our.
Next process will we'll just.
And if and then we just in the process, this makes sense.
So this completes the first process and which is predominantly coming for all the example that we have
considered so far.
Right.
Now will proceed and write a code for.
The risk of further out, particularly as follows the next days, again, since we are targeting a due
process methodology, so we will have a single process.
So let me just add a next.
And from the figure, you can guess that this is a media machine because you are all could depend on
the state as well as an OK so process.
And then we'll be making it due to vote state as well as as well as an input.
So for us, the input in this debate will begin and then we'll add and process.
Now we proceed, so here what we need to do is depending on the value of a state we have, we need to
decide what should be the next year as well as what should be done.
So we'll just be working on it.
State, OK, is and we just add.
And this.
OK, so this is the usual also follow that once you are a block, for example, here we have our block,
so immediately.
Right.
And so once we are in the process, block you immediately in the process, will later on will be finding
that finding an error when you follow this process becomes very, very easy.
So when we have a seal.
Right.
So when we have Aniceto, in that case, if this is when we mutu students might say.
Dean is one right in that case are next and next, it should be Esswein.
And I'll put in that case is the out is a quiz for you.
So we be combining the next three as well.
I'll put in the same process ends if we can figure out Elseworlds means when we have a zero, so we
jump back to status and output is also zero.
So we can just copy this to Streetman.
We'll just be sitting here.
So next week when we have been is zero is a zero.
And the is still to this complete, the declaration for us right now will proceed on the declaration
for Essence when we have an announcement eight.
Similarly here, we need to end the threat, so.
So when we have an istván, OK, so if.
They'll be finding that we have.
Zero.
Then we jump to a nest, right?
So is zero then in that case.
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
this again.
OK, in that case.
I see, so if we are innocent and we do see what rape is, basically we will see when then we will be
staying in NSW and our people that this is also.
So this makes sense.
So once we complete our.
State will decide and end the fight, so this complete declaration for right now, what we'll do is
we'll just complete this entire state.
OK, and now we'll just be sorry to hear.
Right?
So now we'll start writing a code for when we are in this to and if we receive one.
So we'll just use this to.
So if Christie won, the state should be a straight out to the Sillitoe when we are in a to receive
zero.
We jump back to Estie, right.
So here we will be jumping to LSU and out to the.
So when you copy an entire state, see that you go through each and every line through the possibility
of adequately reduce to will again go ahead and will be stored here.
Right.
So when we are in a story, so we are in a story if we do see one.
Right.
So we reach to state.
So if we do see one.
We jump to the street and in this case, out of this one.
Right ends and indicate when we are in history and we receive zero, we jump to any state assume and
then output in that case is also see.
So this completes all the study that we have inside our street diagram.
Finally, when we have another look, what we will be doing is you can already guess that next week.
OK, so next it will be equal to as Steidl.
Right.
And the out should be equal to equal.
Right.
So this completes the entire state machine with a K Street.
Now we'll just need everything that we have, an extra spaces and we'll proceed to what we want to,
in fact, will be.
Finally, we get a green indication over here.
So everything seems to be fine for a while right now, will proceed and see whether we are able to.
Verifier.
Steve.
So what we'll do is we'll just click on Run Simulation.
So we have designed a state mission for one zero and remember, OK, now what we'll do is we'll do the
clocks right click.
Foods slok, OK, will apply.
One nine zero, OK?
Remember that we have two hundred nine.
OK, first let us just make our set to be OK and try to execute our code for less than a thousand nanoseconds.
We'll be finding that we predominantly state, as you right now, will try to execute our code single
cycle by cycle.
Right.
So the first thing that you'll be doing is we change this, put it on the top two hundred nanosecond
because that is our property.
So this will allow us to execute our code for single rate, will remove the risk.
So we will apply for constraints zero.
Now, first state inside our sequence is one, so we'll just use force and apply one, OK, and will
execute our code for single cycle and you'll be noticing that we move on to an extra.
They do this right now will make the zero because inside the sequence, the next step that we have is
zero, OK.
And will execute again for a single clock.
Right.
So we have one zero now will again use for sponsoring one.
Try to execute the call, and we again required one movement, so we just execute once, OK?
And it'll be finding that as we detect one zero one one, you'll be able to see one.
Right, if you again add one since this is overlapping.
OK, so we'll be finding if you just again, the one so this will take us to the streets and then just
we need to check Setu.
And one right.
So what we'll do is we'll just apply for Negi.
OK, audience cheering If we just apply zero, OK, in that case, we just need to detect one on one,
right?
So we'll just apply zero zero here will just apply C2, OK, and then we just apply to one to one.
And one more one and able to see.
That again, becomes.
Right, so our sequence counter is working fine.
So this is how you can test your sequence.
In fact, the good idea could be that you write it as speech so that your assignment on how you will
be writing the test for this sequence.
So you'll have more insight into how we can verify design automatically.
But this sequence rectories seems to be working fine, right?