About this Course
4.7
77 ratings
15 reviews
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Intermediate Level

Intermediate Level

Hours to complete

Approx. 29 hours to complete

Suggested: 6 hours/week...
Available languages

English

Subtitles: English...

Skills you will gain

Logic GateComputer-Aided Design (CAD)Digital DesignBoolean Algebra
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Intermediate Level

Intermediate Level

Hours to complete

Approx. 29 hours to complete

Suggested: 6 hours/week...
Available languages

English

Subtitles: English...

Syllabus - What you will learn from this course

Week
1
Hours to complete
2 hours to complete

Orientation

In this module you will become familiar with the course and our learning environment. The orientation will also help you obtain the technical skills required for the course....
Reading
1 video (Total 25 min), 2 readings, 5 quizzes
Reading2 readings
Syllabus10m
Tools For This Course5m
Quiz1 practice exercise
Demographics Survey5m
Hours to complete
2 hours to complete

Computational Boolean Algebra

In this module, we will introduce advanced Boolean algebra math concepts that make it possible to take a "computational" approach to Boolean algebra. ...
Reading
6 videos (Total 91 min), 2 readings
Video6 videos
Computational Boolean Algebra: Boolean Difference15m
Computational Boolean Algebra: Quantification Operators13m
Computational Boolean Algebra: Application to Logic Network Repair16m
Computational Boolean Algebra: Recursive Tautology9m
Computational Boolean Algebra: Recursive Tautology—URP Implementation20m
Reading2 readings
Week 1 Overview10m
Week 1 Assignments10m
Week
2
Hours to complete
7 hours to complete

Boolean Representation via BDDs and SAT

Week 2 introduces two powerful and important representation techniques that allow us to do SERIOUS computational Boolean algebra, on industrial-scale designs....
Reading
7 videos (Total 135 min), 2 readings, 2 quizzes
Video7 videos
BDD Basics, Part 216m
BDD Sharing17m
BDD Ordering28m
Satisfiability (SAT), Part 113m
Boolean Constraint Propagation (BCP) for SAT17m
Using SAT for Logic25m
Reading2 readings
Week 2 Overview10m
Week 2 Assignments10m
Quiz1 practice exercise
Problem Set #1m
Week
3
Hours to complete
3 hours to complete

2-Level Logic Synthesis, and Multi-Level Logic Synthesis via the Algebraic Model

In Week 3, we will move from "representing" things to "synthesizing" things. In this case, synthesis means "optimization", or maybe the word "minimization" is more familiar from hand work with Kmaps or Boolean algebra....
Reading
8 videos (Total 119 min), 2 readings, 1 quiz
Video8 videos
2-Level Logic: The Reduce-Expand-Irredundant Optimization Loop13m
2-Level Logic: Details for One Step: Expand20m
Multilevel Logic and the Boolean Network Model13m
Multilevel Logic: Algebraic Model for Factoring14m
Multilevel Logic: Algebraic Division14m
Multilevel Logic: Role of Kernels and Co-Kernels in Factoring14m
Multilevel Logic: Finding the Kernels18m
Reading2 readings
Week 3 Overview10m
Week 3 Assignments10m
Quiz1 practice exercise
Problem Set #2m
Week
4
Hours to complete
7 hours to complete

Multilevel Factor Extract and Don't Cares

You now know that to factor a multi-level network to reduce its complexity, you must look at the kernels and co-kernels. You know how to "get" these for any node. But -- what do you do with a big network to actually FIND the right common divisors? This is called EXTRACTION. We then look at a new opportunity to optimize multi-level logic: Don't Cares. In simple designs, we usually regard Don't Cares as "impossible inputs" -- things that just do not happen, so we can choose the value the hardware creates to minimize the logic....
Reading
8 videos (Total 123 min), 2 readings, 3 quizzes
Video8 videos
Mulitlevel Logic and Divisor Extraction—Multiple Cube Case20m
Multilevel Logic and Divisor Extraction—Finding Prime Rectangles & Summary10m
Multilevel Logic—Implicit Don't Cares, Part 117m
Multilevel Logic—Implicit Don't Cares, Part 211m
Multilevel Logic—Satisfiability Don't Cares10m
Multilevel Logic—Controllability Don't Cares19m
Multilevel Logic—Observability Don't Cares17m
Reading2 readings
Week 4 Overview10m
Week 4 Assignments10m
Quiz2 practice exercises
Problem Set #3m
Auxiliary Quiz of Serious BDDs15m

Instructor

Avatar

Rob A. Rutenbar

Adjunct Professor
Department of Computer Science

About University of Illinois at Urbana-Champaign

The University of Illinois at Urbana-Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs. ...

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

More questions? Visit the Learner Help Center.