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
Information TheoryThe Chinese University of Hong Kong via Coursera Fundamentals of Electrical Engineering
Rice University via Coursera Digital Signal Processing
École Polytechnique Fédérale de Lausanne via Coursera Circuits and Electronics 1: Basic Circuit Analysis
Massachusetts Institute of Technology via edX Solar: Solar Cells, Fuel Cells and Batteries
Stanford University via Stanford OpenEdx