VOOZH about

URL: https://www.coursera.org/learn/vlsi-cad-logic

⇱ VLSI CAD Part I: Logic | Coursera


Ends soon! Keep adding new skills with 10,000+ programs for $239 (usually $399). Save now.

VLSI CAD Part I: Logic

62,761 already enrolled

Included with

Ask Coursera

Gain insight into a topic and learn the fundamentals.
4.6

557 reviews

Intermediate level
Some related experience required
Flexible schedule
2 weeks at 10 hours a week
Learn at your own pace
94%
Most learners liked this course

Gain insight into a topic and learn the fundamentals.
4.6

557 reviews

Intermediate level
Some related experience required
Flexible schedule
2 weeks at 10 hours a week
Learn at your own pace
94%
Most learners liked this course

There are 6 modules in this course

A modern VLSI chip has a zillion parts -- logic, control, memory, interconnect, etc. How do we design these complex chips? Answer: CAD software tools. Learn how to build thesA modern VLSI chip is a remarkably complex beast: billions of transistors, millions of logic gates deployed for computation and control, big blocks of memory, embedded blocks of pre-designed functions designed by third parties (called “intellectual property” or IP blocks). How do people manage to design these complicated chips? Answer: a sequence of computer aided design (CAD) tools takes an abstract description of the chip, and refines it step-wise to a final design. This class focuses on the major design tools used in the creation of an Application Specific Integrated Circuit (ASIC) or System on Chip (SoC) design. Our focus in this first part of the course is on key Boolean logic representations that make it possible to synthesize, and to verify, the gate-level logic in these designs. This is the first step of the design chain, as we move from logic to layout. Our goal is for students to understand how the tools themselves work, at the level of their fundamental algorithms and data structures. Topics covered will include: Computational Boolean algebra, logic verification, and logic synthesis (2-level and multi-level).

Recommended Background Programming experience (C, C++, Java, Python, etc.) and basic knowledge of data structures and algorithms (especially recursive algorithms). An understanding of basic digital design: Boolean algebra, Kmaps, gates and flip flops, finite state machine design. Linear algebra and calculus at the level of a junior or senior in engineering. Exposure to basic VLSI at an undergraduate level is nice -- but it’s not necessary. We will keep the course self-contained, but students with some VLSI will be able to skip some background material.e tools in this class.

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.

What's included

1 video2 readings1 assignment4 programming assignments1 plugin

1 videoTotal 25 minutes
  • Welcome and Introduction25 minutes
2 readingsTotal 15 minutes
  • Syllabus10 minutes
  • Tools For This Course5 minutes
1 assignmentTotal 5 minutes
  • Demographics Survey5 minutes
4 programming assignmentsTotal 40 minutes
  • KBDD10 minutes
  • MiniSat10 minutes
  • Espresso10 minutes
  • SIS10 minutes
1 pluginTotal 15 minutes
  • Welcome! Please tell us about yourself.15 minutes

In this module, we will introduce advanced Boolean algebra math concepts that make it possible to take a "computational" approach to Boolean algebra.

What's included

6 videos2 readings

6 videosTotal 91 minutes
  • Computational Boolean Algebra: Basics15 minutes
  • Computational Boolean Algebra: Boolean Difference16 minutes
  • Computational Boolean Algebra: Quantification Operators13 minutes
  • Computational Boolean Algebra: Application to Logic Network Repair16 minutes
  • Computational Boolean Algebra: Recursive Tautology10 minutes
  • Computational Boolean Algebra: Recursive Tautology—URP Implementation21 minutes
2 readingsTotal 20 minutes
  • Week 1 Overview10 minutes
  • Week 1 Assignments10 minutes

Week 2 introduces two powerful and important representation techniques that allow us to do SERIOUS computational Boolean algebra, on industrial-scale designs.

What's included

7 videos2 readings1 assignment1 programming assignment

7 videosTotal 135 minutes
  • BDD Basics, Part 115 minutes
  • BDD Basics, Part 217 minutes
  • BDD Sharing17 minutes
  • BDD Ordering28 minutes
  • Satisfiability (SAT), Part 114 minutes
  • Boolean Constraint Propagation (BCP) for SAT18 minutes
  • Using SAT for Logic26 minutes
2 readingsTotal 20 minutes
  • Week 2 Overview10 minutes
  • Week 2 Assignments10 minutes
1 assignmentTotal 60 minutes
  • Problem Set #160 minutes
1 programming assignmentTotal 180 minutes
  • Programming Assignment #1: Unate Recursive Complement180 minutes

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.

What's included

8 videos2 readings1 assignment

8 videosTotal 119 minutes
  • 2-Level Logic: Basics9 minutes
  • 2-Level Logic: The Reduce-Expand-Irredundant Optimization Loop13 minutes
  • 2-Level Logic: Details for One Step: Expand21 minutes
  • Multilevel Logic and the Boolean Network Model14 minutes
  • Multilevel Logic: Algebraic Model for Factoring14 minutes
  • Multilevel Logic: Algebraic Division14 minutes
  • Multilevel Logic: Role of Kernels and Co-Kernels in Factoring15 minutes
  • Multilevel Logic: Finding the Kernels18 minutes
2 readingsTotal 20 minutes
  • Week 3 Overview10 minutes
  • Week 3 Assignments10 minutes
1 assignmentTotal 60 minutes
  • Problem Set #260 minutes

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.

What's included

8 videos2 readings2 assignments1 programming assignment

8 videosTotal 123 minutes
  • Mulitlevel Logic and Divisor Extraction—Single Cube Case14 minutes
  • Mulitlevel Logic and Divisor Extraction—Multiple Cube Case21 minutes
  • Multilevel Logic and Divisor Extraction—Finding Prime Rectangles & Summary11 minutes
  • Multilevel Logic—Implicit Don't Cares, Part 118 minutes
  • Multilevel Logic—Implicit Don't Cares, Part 211 minutes
  • Multilevel Logic—Satisfiability Don't Cares11 minutes
  • Multilevel Logic—Controllability Don't Cares20 minutes
  • Multilevel Logic—Observability Don't Cares17 minutes
2 readingsTotal 20 minutes
  • Week 4 Overview10 minutes
  • Week 4 Assignments10 minutes
2 assignmentsTotal 75 minutes
  • Problem Set #360 minutes
  • Auxiliary Quiz of Serious BDDs15 minutes
1 programming assignmentTotal 180 minutes
  • Programming Assignment #2: Serious BDDs180 minutes

There is no new content this week. Instead, you should focus on finishing the last problem set and completing the Final Exam.

What's included

3 assignments1 plugin

3 assignmentsTotal 185 minutes
  • Problem Set #460 minutes
  • Final Exam120 minutes
  • End of Course Survey5 minutes
1 pluginTotal 15 minutes
  • How was the course?15 minutes

Instructor

Instructor ratings
4.8 (125 ratings)
2 Courses68,741 learners

Explore more from Algorithms

Why people choose Coursera for their career

👁 Image

Felipe M.

Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
👁 Image

Jennifer J.

Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
👁 Image

Larry W.

Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
👁 Image

Chaitanya A.

"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

Learner reviews

  • 5 stars

    73.96%

  • 4 stars

    20.82%

  • 3 stars

    2.87%

  • 2 stars

    0.89%

  • 1 star

    1.43%

Showing 3 of 557

SM
·

Reviewed on Jun 6, 2020

It's an amazing course. Those who have ideas about boolean logic will be very much satisfied with the course.

VT
·

Reviewed on Jul 15, 2020

Excellent course in VLSI tools design, that covers most of the basic algorithms and basic idea of tools.

SG
·

Reviewed on Sep 3, 2020

One of the best courses that I have come across in the Coursera platform which is very interesting, I'm very glad that I took this course which leads to exploring some concepts of VLSI.

Frequently asked questions

To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

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.

Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

Financial aid available,