Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

FSM Design and Synthesis

In course

EE-110: Logic systems (for MT)

Ce cours couvre les fondements des systèmes numériques. Sur la base d'algèbre Booléenne et de circuitscombinatoires et séquentiels incluant les machines d'états finis, les methodes d'analyse et de synthèse de systèmelogiques sont étudiées et appliquée ...

Description

This lecture covers the design and synthesis of Finite State Machines (FSMs), focusing on steps such as completeness, consistency, and handling ghost states. It explains how to create transition tables and code tables, ensuring the FSM is both complete and consistent. Examples illustrate incomplete and inconsistent states, emphasizing the importance of meeting specific conditions for each state. The lecture concludes with the discussion of ghost states, unused codes in the code table, and different approaches to handling them.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Alexandre Schmid

Alexandre Schmid received the M.Sc. degree in microengineering and the Ph.D. degree in electrical engineering from the Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland, in 1994 and 2000, respectively. Since 1994, he has been with the EPFL, working with the Integrated Systems Laboratory as a Research and Teaching Assistant, and with the Electronics Laboratories as a Postdoctoral Fellow. In 2002, he was a Senior Research Associate with the Microelectronic Systems Laboratory, where he has been conducting research in the fields of bioelectronic interfaces and implantable biomedical electronics, nonconventional signal processing and neuromorphic hardware, and reliability of nanoelectronic devices, and also teaches with the Microengineering and Electrical Engineering Departments of EPFL. Since 2011, he is a Maître d'Enseignement et de Recherche (MER) Faculty Member with EPFL. He is a coauthor of two books, Reliability of Nanoscale Circuits and Systems, Methodologies and Circuit Architectures, Springer, 2011, and Wireless Cortical Implantable Systems, Springer, 2013, and a coeditor of one book, as well as over 100 articles published in journals and conferences. Dr. Schmid has served as the General Chair of the Fourth International Conference on Nano-Networks in 2009 and has been serving as an Associate Editor of the Institute of Electrical, Information, and Communication Engineers Electronics Express since 2009.

Official source

Ontological neighbourhood

Theoretical computer science

Theory of computation: Automata theory

Related concepts (32)

Transition metal

In chemistry, a transition metal (or transition element) is a chemical element in the d-block of the periodic table (groups 3 to 12), though the elements of group 12 (and less often group 3) are sometimes excluded. The lanthanide and actinide elements (the f-block) are called inner transition metals and are sometimes considered to be transition metals as well. Since they are metals, they are lustrous and have good electrical and thermal conductivity.

Post-transition metal

The metallic elements in the periodic table located between the transition metals to their left and the chemically weak nonmetallic metalloids to their right have received many names in the literature, such as post-transition metals, poor metals, other metals, p-block metals and chemically weak metals. The most common name, post-transition metals, is generally used in this article. Physically, these metals are soft (or brittle), have poor mechanical strength, and usually have melting points lower than those of the transition metals.

Block (periodic table)

A block of the periodic table is a set of elements unified by the atomic orbitals their valence electrons or vacancies lie in. The term appears to have been first used by Charles Janet. Each block is named after its characteristic orbital: s-block, p-block, d-block, f-block and g-block. The block names (s, p, d, and f) are derived from the spectroscopic notation for the value of an electron's azimuthal quantum number: sharp (0), principal (1), diffuse (2), or fundamental (3).

Consistency

In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent if it has a model, i.e., there exists an interpretation under which all formulas in the theory are true. This is the sense used in traditional Aristotelian logic, although in contemporary mathematical logic the term satisfiable is used instead.

Finite-state machine

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.

Related lectures (45)

Regular Expressions (Recap)

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Software Disasters and Successes: Verification Impact and Transition Systems

Explores software verification impact, disasters, successes, and transition systems.

Finite Automata: Basics

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

Periodic Table: Electronic Configuration

Explores exceptions to the Aufbau principle in the periodic table, emphasizing electronic configurations and their impact on chemical properties.

Universal Source Coding