Save this video free

Lecture 12: Combinational Logic Gates in CMOS - Part 2

NorDIC Lab · 1:12:53 · Watch on YouTube

Lecture 12: Combinational Logic Gates in CMOS - Part 2 Watch on YouTube →

Overview

CMOS combinational logic is built by expressing Boolean functions in sum-of-products form, mapping products to series NMOS transistors and sums to parallel branches, then creating the complementary PMOS network and sizing both against an inverter. The lecture extends this method to performance: stacked transistors add resistance and parasitic capacitance, input history and body effect shift delays, and design choices such as limiting fan-in to about four, placing the slowest signal near the output, and restructuring logic manage trade-offs among speed, area, and power.

Key takeaways

Chapters

0:00 Sum-of-Products as the Starting Point for CMOS Logic
5:36 Building the NMOS and Complementary PMOS Networks
10:09 Sizing Series NMOS Branches Against a CMOS Inverter
13:38 Sizing PMOS Pull-Up Paths Across Multiple Series Blocks
18:48 Larger Transistors Improve Drive but Increase Short-Circuit Current
22:21 Multi-Input VTCs and Body Effect in Stacked Transistors
27:46 Input State Changes NMOS Strength and Switching Threshold
34:26 Parasitic RC Networks Explain Multi-Step Output Transitions
40:14 Previous Input States Determine NAND Gate Delay
44:37 Place the Slowest NAND Input Near the Output
52:24 Fan-In Limits, Stack Delay, and NAND-versus-NOR Bottlenecks
59:10 NOR Stack Ordering and the Cost of Deep Series Paths
1:01:12 Propagation Delay Creates Glitches and Miller Coupling
1:08:05 Adder Carry Ordering, Progressive Sizing, and Logic Reconstruction

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

Transcript excerpt

0:00 that So, in the last class we discussed the key principle towards designing any combinational logic circuit. All right? We looked at a couple of examples. We talked about why NMOS transistors are necessary to uh design the pull down network, which brings down a node to zero. ground, right? We never use PMOSes to discharge nodes. We always use NMOSes to discharge and PMOSes to charge. Okay, we talked about the reasoning behind it. We talked about how to represent and and or logic with series and parallel connected transistors. And then we moved forward to start implementing random Boolean logic functions in NMOS network. And then whatever you do to the NMOS

0:47 network, you do the complementary connection in the PMOS network and you get a CMOS logic circuit. That's where we stopped, but actually we went ahead a little bit more. We also looked at sizing. We saw that when you have multiple transistors in series or parallel, it is necessary to size them up properly to balance the balance the charging and discharging branches. Okay? Don't worry, you don't have to remember everything. We are going to do one practice run today together. And hopefully everything will come back to us, all right? Let's do that. Let's use this page to do it from scratch. Let's start with a Boolean logic function. I would I would love to randomize it. Can anybody volunteer tell me a Boolean logic function? Please. >> AB or A not B not.

1:36 >> AB or A not B not. Okay. A Any Anything else to add to it? >> Or A times B times C. >> Or ABC. What else? Anything else? Please. No? So, by the way, just so you know, I'm going to be able to reduce it further to say, for

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.