1
00:00:01,310 --> 00:00:07,990
What are the essential elements of a finite state machine, this structure will address this question.

2
00:00:10,270 --> 00:00:18,610
A sequential digital circuit receives a set of inputs and generates a set of outputs, FSANZ can describe

3
00:00:18,640 --> 00:00:19,500
its behavior.

4
00:00:21,350 --> 00:00:25,300
States and transitions are the two essential elements in enforcing.

5
00:00:26,280 --> 00:00:31,870
And it's Synchronoss sequential circuit that is the focus of this course, the clock's ticking, all

6
00:00:31,890 --> 00:00:39,030
synchronises, all the actions in the single cycle design flaw explained earlier in this course.

7
00:00:39,540 --> 00:00:47,460
At each clock cycle, the FSM is evaluated and if some conditions are satisfied, it goes from one state

8
00:00:47,610 --> 00:00:48,300
to the other.

9
00:00:49,260 --> 00:00:56,280
These conditions can be based on the current state or specific values on the circuit inputs.

10
00:00:57,610 --> 00:00:58,300
For example.

11
00:01:00,160 --> 00:01:09,080
In Exito, if condition one is satisfied, the second goes to status one, otherwise it stays in Asiel.

12
00:01:10,250 --> 00:01:17,810
In one if condition to satisfy the second Gosta state to otherwise it stays in a swamp.

13
00:01:18,910 --> 00:01:23,660
In S2, if conditions truly satisfy the second Gosta state, it's zero.

14
00:01:23,770 --> 00:01:26,470
Otherwise, it stays in as to.

15
00:01:28,940 --> 00:01:34,040
And FSM requires a set of memory cells or registers to keep the state's.

16
00:01:35,520 --> 00:01:39,360
It's set of conditions that defines all the transitions.

17
00:01:40,420 --> 00:01:48,000
A conditional statement such as each case that implements the conditions and is executed in each cycle.

18
00:01:50,470 --> 00:01:53,410
FSM can model digital signals as well.

19
00:01:53,830 --> 00:02:01,570
Let's consider the circuit with the clock signal as its only input and one output the which chose this

20
00:02:01,570 --> 00:02:02,720
periodic signal.

21
00:02:03,340 --> 00:02:07,130
Now we can use an FSM to model the behavior of the circuit.

22
00:02:07,870 --> 00:02:10,000
Firstly, let's find the states.

23
00:02:11,200 --> 00:02:14,890
One period in signaled contains four clock cycles.

24
00:02:16,090 --> 00:02:24,430
We can assign each clock cycle to a state, therefore the corresponding FSM has four states in the first

25
00:02:24,430 --> 00:02:30,760
state, this is one in the second, third and fourth states DL.

26
00:02:31,660 --> 00:02:38,200
So this would be the FSM representing this signal, known that there is no condition for the transition

27
00:02:38,200 --> 00:02:41,480
between two states with the rising age of the clock.

28
00:02:41,770 --> 00:02:45,190
You always go from one state to the other.

29
00:02:47,880 --> 00:02:53,910
Describing an EF assimilationists would be the subject of the next lecture, in the next lecture, I

30
00:02:53,910 --> 00:02:57,840
will introduce a lecture code template to represent and.

31
00:02:59,900 --> 00:03:06,830
These are our takeaway messages, estates and transitions are the two essential elements in an.

32
00:03:08,360 --> 00:03:15,290
Registers conditions and a conditional statement are three fundamental programming elements to write

33
00:03:15,440 --> 00:03:16,330
a code for an.

34
00:03:19,470 --> 00:03:22,350
Draw the FSM representing this signal, DiGRA.