Digital Circuits Boolean Algebra

Offered By: Colin O'Flynn via YouTube

Course Description

Overview

Explore Boolean algebra and digital circuits in this 44-minute lecture from ECED2200. Learn about operations with 0 and 1, idempotent rules, involution, associative rules, distributive properties, consensus, and DeMorgan's laws. Dive into circuit simplification techniques, including absorption and proof by perfect induction. Gain valuable insights into digital logic design and optimization, despite minor visual issues due to screen resolution changes during recording.

Syllabus

Intro
OPERATIONS WITH O AND 1
IDEMPOTENT RULES
INVOLUTION
ASSOCIATIVE RULES
DISTRIBUTIVE
CONSENSUS
DEMORGAN
SIMPLIFICATION (A+B) B-A.B
SIMPLIFYING CIRCUITS
GENERAL NOTES
ABSORPTION A+A.BA
PROOF BY PERFECT INDUCTION (A+B) B-A.B
SECTION SUMMARY

Taught by

Colin O'Flynn

Related Courses

Digital System Design
Indian Institute of Technology, Ropar via Swayam Build a Modern Computer from First Principles: From Nand to Tetris (Project-Centered Course)
Hebrew University of Jerusalem via Coursera 系统平台与计算环境
Xi'an Jiaotong University via Coursera 计算导论与C语言基础
Peking University via Coursera Comparative Research Designs and Methods
University of Naples Federico II via Federica