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

Lecture

Digital Logic: Circuits and Design

In course

CH-234: Organic functions and reactions II

To develop basic understanding of the reactivity of aromatic and heteroaromatic compounds. To develop a knowledge of a class of pericyclic reactions. To apply them in the context of the synthesis. ...

Description

This lecture covers the fundamentals of digital logic, including Boolean algebra, logic gates, and combinational circuits. It also delves into sequential circuits, flip-flops, and state machines, providing a comprehensive understanding of digital system design.

Instructors (2)

Nicolai Cramer

Nicolai Cramer was born in Stuttgart, Germany; he studied chemistry at the University of Stuttgart where he graduated in 2003, and earned his PhD in 2005 under the guidance of Professor Sabine Laschat. After a research stage at Osaka University, Japan, he joined the group of Professor Barry M. Trost at Stanford University as a postdoctoral fellow in 2006. From 2007 on, he worked on his habilitation at the ETH Zurich associated to the chair of Professor Erick M. Carreira and recieved the venia legendi in 2010. In 2010, he started as Assistant Professor at the EPF Lausanne and was promoted to Associate Professor in 2013 and to Full Professor in 2015. His main research program encompasses enantioselective metal-catalyzed transformations and their implementation for the synthesis of biologically active molecules. Author profile (Angew. Chem. Int. Ed.) CV

Felix Daniel Bobbink

Official source

Ontological neighbourhood

Electrical engineering

Electronic engineering: Digital electronics

Related concepts (32)

Sequential logic

In automata theory, sequential logic is a type of logic circuit whose output depends on the present value of its input signals and on the sequence of past inputs, the input history. This is in contrast to combinational logic, whose output is a function of only the present input. That is, sequential logic has state (memory) while combinational logic does not. Sequential logic is used to construct finite-state machines, a basic building block in all digital circuitry.

Digital electronics

Digital electronics is a field of electronics involving the study of digital signals and the engineering of devices that use or produce them. This is in contrast to analog electronics and analog signals. Digital electronic circuits are usually made from large assemblies of logic gates, often packaged in integrated circuits. Complex devices may have simple electronic representations of Boolean logic functions. The binary number system was refined by Gottfried Wilhelm Leibniz (published in 1705) and he also established that by using the binary system, the principles of arithmetic and logic could be joined.

Combinational logic

In automata theory, combinational logic (also referred to as time-independent logic or combinatorial logic ) is a type of digital logic which is implemented by Boolean circuits, where the output is a pure function of the present input only. This is in contrast to sequential logic, in which the output depends not only on the present input but also on the history of the input. In other words, sequential logic has memory while combinational logic does not.

Logic gate

A logic gate is an idealized or physical device that performs a Boolean function, a logical operation performed on one or more binary inputs that produces a single binary output. Depending on the context, the term may refer to an ideal logic gate, one that has, for instance, zero rise time and unlimited fan-out, or it may refer to a non-ideal physical device (see ideal and real op-amps for comparison). In the real world, the primary way of building logic gates uses diodes or transistors acting as electronic switches.

Boolean circuit

In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length. Boolean circuits are defined in terms of the logic gates they contain. For example, a circuit might contain binary AND and OR gates and unary NOT gates, or be entirely described by binary NAND gates. Each gate corresponds to some Boolean function that takes a fixed number of bits as input and outputs a single bit.

Related lectures (28)

Combinatorial Logic Circuits

Covers the basics of logical systems, Boolean algebra, logic gates, and coding in digital circuits.

Logical Circuits: Basics MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers logical circuits, gates, and their combinations to perform basic operations on bits, including adding binary numbers.

Digital Systems Overview: Evolution and Fundamentals Log in to Mediaspace to watch this video

Explores the evolution of digital systems, covering basics like Boolean algebra and logic gates, and emphasizes teamwork skills and professional vocabulary.

Digital Circuits: Logic Basics Log in to Mediaspace to watch this video

Introduces digital circuits, covering binary systems, logic operators, Boolean algebra, memory elements, and practical examples like BCD decoders and shift registers.

Logic Systems: Basics and Operators Log in to Mediaspace to watch this video