From Boolean Expressions to Circuits
HTML-код
- Опубликовано: 10 июн 2014
- Video explaining how to derive a digital circuit from a Boolean expression. We first derive the sum of products representation and then from there the circuit as a set of AND gates implementing the products and their outputs all going into an OR gate.
7 years later and these are still the most reliable, best explanations on the entire internet. I feel like half my tuition money should go to you because my entire class comes here to learn what our teacher doesn't make clear. we all appreciate you so, so much!! thank you!!
I totally agree with you, it's the most straight-forward and easiest way to explain, that's 100% going into my playlist and I'll be forever grateful for this
Literally its 4 am and i finally understand my assignment bc of this
9764311589009765😎2456800
THANK YOU! My professor insisted there was no "way" of doing this and you just "have to see" it. this helps so so much
As a programmer that has been working for 6 years, and never got any formal programming education. This has definitely helped me a lot. Not being able to search specifically for what I want and stumbling upon it is a better feeling than anything.
Thank you, my good sir.
This makes a lot of sense thanks! I hope you keep posting.
Abelardo,
I would suggest putting videos 13-30 in a playlist Digital Logic or something similar, and videos 1-12 in a playlist called AVR Assembly Programming. Thank you very much for your videos, you went sufficiently in depth while remaining clear and easy to understand which is a lot to ask for when seeing tutorials on assembly programming. Cheers!
You are a great teacher. You speak very well and make it very easy to understand. Thank you for your help!
This seriously answered the topic that my professor did not explain properly in our course in college this 4th quarter. Thank you very much, liked and subscribed.
So happy to have found this video! I got confused about this topic and here you explained it so well! Not only have I totally understand SOP and Circuits I have even learned how to simplify the circuit too. Thank you very much! Will recommend this vid to my classmates.
WOW! This video is so useful that it will change my entirely life if I use it at the university.
Very well explained !!! Thank you so much!
omg i have a midterm tmrw and u just helped me !! thanks a lot
thank you so much i had no idea what we were doing in uni, you are a life savour
Oftentimes, I don't comment on videos; I enjoy reading others'. I skipped a 3-hour lecture on Digital Circuit Design in search for better explanation on online, and I will never regret it at all. Please continue to post more videos with your vivid explanation. Much love from Ghana....
Thank you for this straightforward explanation. In fact, gazing at the playlist this is a part of, the playlist is EXACTLY what I need. Now back to the game, “Turing Complete” to make some progress and start building my own CPU 😁 haha.
As a side note, it looks as if I’m not the only one who thinks you do a great job at teaching. You should consider making more content and growing the channel. Redoing this series and others with better video and audio now that it’s been 8 years would do a lot to get new people in since the content has already proven to be successful and a great help to many people. 4k recording is available on any new phone or tablet. Using an iPad with an Apple Pencil would be great. Not to mention you have great handwriting that’s pleasing to watch.
Good stuff!
This is so clear! Thank you so much
Wow... Just wow... Thank you so much for making it easy to understand.
Cystal clear, thank you!
Who is here in 2022 . Respect and love for you respected Sir from Pakistan
its brilliant, thank you!
Really superb cool evolution
you are a legend mate, thanks
Now I get it! Thanks!!!
Thank you so much. They look easy now haha
Very well explained 👍
if i want to go from the SOP to the truth table, how do I know what are the combinations of x,y,z that result in 0 in the output?
Thank you so much for the video, helped me for my semester exam
Thank you very much sir....your tutorial is very useful
You're a beast.
Very helpful, thank you!!!!
Very helpful. Thank you
Perfect! Thanks!
Nice explained!!!👍
Thank you dude, I was going to start crying over this lol
Can you so much for this beautiful video I really appreciate
You are awesome! thank you!
Thanks sir understood very well
Dont the input only need to be xyz? that way if any of these is 0 e.g. off it essentially is a negated signal?
I am a little confused, If the required output from those expressions is logic "1" then for example the input of X'Y'Z' would not give the desired output from the AND gate and further onto the OR gate ?
Thank you so much sir☺
How does one decide how to layout the given logic gates in x/y space after you reduce the gates? For more complicated circuits, this is where I get stuck.
OMG THANK YOU I LOVE YOU SOO MUCH SUBBED AND LIKE :)
I'm confused about the relationship between the expression and the truth table. For example, the third and fourth values down have 0 1 0 = 1. Now, maybe I'm missing something but, I thought the expression was XY + Z' so... shouldn't that be the same as 0 x 1 + 0 and shouldn't that equal 0 instead of 1... OH NVM! Pff, sorry, its Z' so its actually 0 1 1 = 1... OMG THIS STUFF IS MADE TO CONFUSE YOU! hahaha Great video btw! First one I found that actually made sense
Thank You Sir ❤
Amazing! From the Boolean algebra to truth table to logic circuit is not bad, but what about use truth table to find Boolean algebra? Can you make a video to show how to simplify the Boolean Algebra? make example: there are 4 inputs truth table and the Boolean algebra from that truth table is crazy long, how to simplify so we can draw the most concise logic circuit ? Thanks
Multiplexer. How many bits are needed for the selector of a multiplexer with 5 inputs? How can one write
the logical equation and to draw the corresponding circuit?
god bless you sir.
Superb🚀
Thanks for this man. Circuits literally hit me like a truck and this helped clear it up a bit
Thank you sir ❤️
How would i derive a logic circuit out of a truth table if i can use a max of 2 inputs for my gates?
Thank you sir
thanx a lot sir
that makes it soo easier holy whatt
how do you simplify it?
thank you my lord
Thanks!
abe knows the good boolean math
wow you're a god
Thank you very much. Very Clear. Very helpful.
thanks!
Same for Pos right? just where there is And gate I will draw Or and where there is Or I will draw And
I don't know why teachers can't explain this easily?
tried to simplify the SOP but only got xyz + zbar, how to get rid of the z to get xy + zbar?
I got the same answer as yours
Thanq bro
Thaaaaannnkkkksssss
GOOD 1
Why does the 000 row has a 1 as the result?
look at the boolean expression, xy+z'
xy+z'
=(0*0)+1
=0+1
=1
شكرًا
pleas there is an mistake in the last step 1 1 1 not = 1
A room has 3 switches (A,B and C) and 2 light bulbs (F and G). F can only be switched on if all 3 switches are on and G will be off if all 3 switches are on. switch A alone does not work for F. F can be on if a combination of 2 switches are on at the same time. C does not work for G. G can be on if a combination of 2 switches are on at the same time. 1. Draw the truth table to represent this scenario for both bulb F and Bulb G. 2. Write down the boolean expression from the truth table for Bulb F. 3. Write down the boolean expression from the truth table for Bulb G. 4. Draw the combinational logic circuit for both Bulb F and Bulb G. Do all this on paper. Once you are done, take a picture of your paper and upload the picture here.
Sir i need explaintion of kmap please
could one also write the boolean expression as (x ∧ y) ∨ z´ ?
^ and V are propositional logic symbols
👌👌👌👌
Thank you. ❤❤
تستاهل لايك
K map please can you explain it
Better you would show how to apply simplification rule on boolean expression, as a proof for E1 == E2
Should've added a "for dummies" at the end, I didn't understand a thing and all the other tutorials are for circuits with two inputs
How to you convert a SOP to a Boolean Expression though?
This video could be completed with a proof of the canonical form.
Thanksss
0:15 z what? x+y×z what? You say something but I don't know what and it's catching me off guard.
@VaiCity Thanks, it was "prime" that I was getting stuck on. It was my first time hearing someone use that word in boolean algebra, as I had just started learning about the topic. I still don't understand why anyone would say "prime" instead of "not", which is infinitely more descriptive and intuitive, but I do know now that that's what prime means in this context
@VaiCity yup
I got here from a playlist about making computers within Minecraft and I have no clue what you mean when you say "z prime". Is it just yet another way of saying Not? Why is there yet another way of saying Not? I'm kind of getting tired of having to learn twelve hundred different naming conventions for the same thing.
Okay, yeah. Watching the rest of the video, I can figure out easily that "prime" is just "Not" but I'm still frustrated haha
This video is so blur nothing is displayed cleanly
Viktor irl
How can you teach but not respond to questions or comments ?
No need to reply !