Save this video free

Lecture 11: Combinational Logic Gates in CMOS - Part 1

NorDIC Lab · 1:10:51 · Watch on YouTube

Lecture 11: Combinational Logic Gates in CMOS - Part 1 Watch on YouTube →

Overview

CMOS combinational gates use an NMOS pull-down network to discharge the output and a complementary PMOS pull-up network to charge it; series connections represent AND conditions and parallel connections represent OR conditions. The lecture develops the network-construction method, explains why it initially produces an inverted function, and shows how to size transistor widths against a CMOS inverter reference while prioritizing worst-case paths.

Key takeaways

Chapters

0:00 Combinational Logic Depends on Input Combinations, Not History
3:20 Why NMOS Pulls Down and PMOS Pulls Up
9:20 Series and Parallel Transistors Encode Boolean Conditions
13:00 Constructing NMOS Networks from Boolean Expressions
20:30 Build the PMOS Network by Complementing NMOS Connections
27:00 CMOS Pull-Up and Pull-Down Networks Serve Opposite Output States
32:30 Why the Basic CMOS Network Method Produces an Inverted Output
40:30 Rail-to-Rail Swing Makes an Output Inverter Worth Keeping
47:00 Transistor Width Sets Drive Strength While Process Sets Length
50:30 Size Series NMOS Devices to Match an Inverter
56:20 Parallel PMOS Branches Create a Worst-Case Sizing Tradeoff
1:01:10 Prioritize the Weakest Charging or Discharging Case
1:03:40 Translate a Mixed Boolean Function into Complementary Networks
1:07:00 Calculate Widths Along Individual Worst-Case Paths

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:00 Let's get started. Our lecture today is a natural next step from CMOS inverter. And when I was teaching you CMOS inverter, I told you many times that this is basically the foundational circuit that all the other logic circuits are based on. So, in today's lecture, we'll talk about combinational logic gates. And let me first address the elephant in the room, the first word. What is combinational, right? Why is it combinational logic? So, combinational logic is a circuit that whose output depends on the combination of inputs, okay? Not the sequence of input, remember. Okay, did A come first and then B came and then C came? No, we don't care about the sequence or timing.

0:48 We care about the combination. When I'm evaluating my output, I'm looking at the available inputs and the combination of available inputs. And what do I mean by combination? Remember, we're talking about digital circuits here, okay? Digital circuit. And in digital circuit, you only recognize two levels, low and high. Zero and one. But one is not always one, you know? VDD is your one. VDD could be 0.9, VDD could be 0.7, it could be 1.5, it could be 5 V, it doesn't matter. VDD is logical one. So, I look at Imagine you have three inputs, input one, two, and say three. You see how many of these are zero and how many of these are one. And then you decide to provide an output accordingly based on how you design this circuit. So, the output of this logic circuit depends on the combination of input. And

1:36 there is no history involved. That is more important thing. History meaning we don't care what happened in the previous cycle to the output. Because there are some circuits that will consider the history

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, NorDIC Lab.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.