Save this video free

Introduction to Logic Circuit Design (University of Utah) - Multiplexers (Lecture 12)

MEDAL-Research · 19:22 · Watch on YouTube

Introduction to Logic Circuit Design (University of Utah) - Multiplexers (Lecture 12) Watch on YouTube →

Overview

The lecture develops multiplexers as combination-logic building blocks: a select signal chooses which data input reaches the output, and n select signals can address 2^n inputs. It then shows how a multiplexer can implement Boolean functions, using two-variable XOR as an example and demonstrating how truth-table rows can be grouped by a chosen select variable to derive the data inputs.

Key takeaways

Chapters

0:00 How a 2:1 Multiplexer Selects Between Two Inputs
5:00 Scaling Multiplexers with Select Signals
10:00 Implementing XOR and Truth Tables with Multiplexers

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

Transcript excerpt

0:09 ‏So our chapter is combination logic circuits. So far it was combination logic circuits but we want to take a little bit better look into them. So it's nothing that much new material just restuding what we have been working on. ‏So there are multiple things that we are we get more familiar one of the main concepts is multiplexers so we have we know multiplexers we have used it but we wan take a much deeper study okay do you remember that we have been talking about multiplexer say that the idea of multiplexer is we can choose something based on this controlling signal so the easiest the simplest multiplexer which

0:59 ‏Bit m contr signal and input in signal signal out of the ‏contr value conn the x1 s is f would be the value of whatever that is connected pin

1:51 number and here is x2 ‏So now I can choose between x1 and x2 that each one i choose basically all right and if remember we talked about that okay this is not a tr this isunality table we need to convert that order to be able to dra and how can we do that need to translate ‏in 3 bit ‏X12 S12

2:44 F1 ‏Similar ‏number would need all the way through that to

3:38 function couldn't I have it easier more logical the official way is join the truth table and then the car up and everything but can I say that in a more intuitive ‏S [گلویش را صاف می‌کند]

4:24 دم زد او x1 sun xib other s او او can I can have bits of controlling the same idea when I have bits of control I

5:16 can control bits I can choose among bits input when s2 ز a s input b so bit of contr and power in always

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, MEDAL-Research.

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.