Lecture

Sequential Systems: Microcontrollers

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the understanding of sequential systems, focusing on state graph description and state machine design, with a practical solution using microcontrollers. It also delves into logical systems, truth tables, and a real-world example of controlling a drill movement. The presentation includes quizzes to identify system inputs and outputs, as well as the implementation of state machines with combinational systems. The lecture concludes with simulations, integrated circuit realizations, and a simpler solution using microcontrollers. A detailed program is provided for system computation and output activation using digital inputs. Throughout the lecture, the instructors emphasize the practical application of sequential systems in microcontroller-based projects.

Official source

Ontological neighbourhood

Logic

Classical logic: First-order logic

Related concepts (32)

Logical truth

Logical truth is one of the most fundamental concepts in logic. Broadly speaking, a logical truth is a statement which is true regardless of the truth or falsity of its constituent propositions. In other words, a logical truth is a statement which is not only true, but one which is true under all interpretations of its logical components (other than its logical constants). Thus, logical truths such as "if p, then p" can be considered tautologies.

Truth table

A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arguments, that is, for each combination of values taken by their logical variables. In particular, truth tables can be used to show whether a propositional expression is true for all legitimate input values, that is, logically valid.

Formal system

A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system. A formal system is essentially an "axiomatic system". In 1921, David Hilbert proposed to use such a system as the foundation for the knowledge in mathematics. A formal system may represent a well-defined system of abstract thought.

Truth value

In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values (true or false). In some programming languages, any expression can be evaluated in a context that expects a Boolean data type. Typically (though this varies by programming language) expressions like the number zero, the empty string, empty lists, and null evaluate to false, and strings with content (like "abc"), other numbers, and objects evaluate to true.

Truth function

In logic, a truth function is a function that accepts truth values as input and produces a unique truth value as output. In other words: The input and output of a truth function are all truth values; a truth function will always output exactly one truth value; and inputting the same truth value(s) will always output the same truth value.

Related lectures (64)

Propositional Logic: Translations and Equivalences

Covers translating natural language to propositional logic and proving tautologies.

Introduction & Propositional Logic

Covers the basics of propositional logic, logical connectives, truth tables, and compound propositions.

FSM Design and Synthesis

Explains the design and synthesis of Finite State Machines in logic systems.

Concept of Proof in Mathematics

Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.

Understanding Microcontrollers: Combinatorial Systems