Ok now this one is good. It explains the why behind the maps and why we select parts over others. All the other videos just rush through and give final results without explaining how they get there. Thank you.
Hello and thank you very much for your comment! Really glad you found the video useful! I think I went into this level of detail because I personally had a lot of trouble just... _getting_ Karnaugh maps in general. Glad to know that was a good choice =)
0612 TV w/ NERDfirst You're welcome. I'm a software engineer student, so anytime I need more info I'm going to search your videos first. I'll like and comment on the ones that help me out. Already subscribed! Cheers
You're welcome! I struggled with these a fair bit as well when I first came across them, and that was what helped me at the time. Glad to be of help =)
Best explanation ever ! I've just discovered your channel and can't wait to see all the other videos. By the way, can you make an explanation about Quine-McCluskey algorithm for Logic circuits
Hello and thank you very much for your comment! I haven't heard of the Quine-McCluskey algorithm before today, but I'll look into it and see what I can do!
Hello and thank you very much for your comment! Yeah I know what you mean. Sometimes in a school context there are just too many things to handle and the curriculum gets messy. Glad I could help out with that situation :)
@@NERDfirst Thank you! I wonder have you produced a video covering the k map of a 7 segment display digit, I am trying to learn about the subject and it gets a bit overwhelming as the variables increase, I am certain I could learn from your good presentation method
Ooooh, that's an intriguing idea. Though at first glance there isn't very much to do - KMaps are useful for reducing things that are in the "sums-of-products" or "products-of-sums" format. For a single 7-segment display, it's really only a product (ie. an AND of all the segments that need to be switched on, AND the complements of the segments that need to be switched off) - there are no sums involved. eg. To get the number 5 (according to this diagram: en.wikipedia.org/wiki/Seven-segment_display#/media/File:7_Segment_Display_with_Labeled_Segments.svg), the expression is just: ACDFGB'E'dp' Since there are no sums ("ORs"), there's really nothing to simplify.
Hello and thank you for your comment! Does your course really only cover this? That's not really a lot for a full course. At any rate, hope this summary was useful for you!
@@NERDfirst yes thank you. I was simplifying the statement using boolean algebra and missed a step. I'm just wondering what's the efficacy of using Boolean algebra to simplify instead of K-maps? which technique scales better?
Oh, Boolean algebra scales better for sure. I shudder at the thought of drawing K-maps for, say, 7 or 8 variables. And don't forget, the key advantage of a K-map is the ability to visually see relationships between the 1s (or the 0s) - Once you have a large map it becomes difficult anyway which defeats the purpose.
Yes, exactly! The idea is, since each group represents many of the possible outcomes AND can do so with a reduced number of gates, we aim to have as few groups as possible, that are also as large as possible. That's also why we're so happy to make use of the "don't care" conditions - Because they help us make larger groups!
Hello and thank you for your comment! The Karnaugh Map designs you see in the video were all created as part of my slides. Any slideshow application would do, eg. Powerpoint or Google Slides.
Hello and thank you for your comment! I did not show any self-written program or code in this video, could you please clarify what source code you are looking for?
Hello and thank you very much for your comment! I'm sorry you've had a bad experience! Unfortunately these videos are catered to those with no prior knowledge at all, so it's necessary to establish the fundamentals before we jump into the main topic!
Hello again! I understand your frustration but I'm afraid it's a necessary evil. After all, not everyone has as much background knowledge as you do :) As a general rule of thumb, for longer videos (and not just for mine!) check in the video description. As in this case, I've included timestamps for you to jump ahead!
![[LIVE] : ONE ลุมพินี 78 | คู่เอก "ปกรณ์ vs ฟาบิโอ"](http://i.ytimg.com/vi/LSOmgl0Th2c/mqdefault.jpg)
![🎤 จับฉลากร้องเพลง x P’ #XXSIVK [EP.1] (2/2) เพื่อนจับได้คำไหน..ต้องร้องคำนั้น เริ่ม! 💓🎶 #MXFRUIT](http://i.ytimg.com/vi/1bJvMJXmeS4/mqdefault.jpg)
You've explained something that my lecturer could not teach in an hour. Thank you 🙏
You're welcome! Very happy to be of help =)
+1
Very helpful. This was much easier to understand than my professor's explanation.
Hello and thank you for your comment! Very happy to be of help =)
Brilliant and Excellent video. Explanations, diagrams and plenty of relevant examples. This is the ideal video to learn about K-maps. Hats off!!!
Hello and thank you very much for your comment! Very happy to be of help =)
Ok now this one is good. It explains the why behind the maps and why we select parts over others. All the other videos just rush through and give final results without explaining how they get there. Thank you.
Hello and thank you very much for your comment! Really glad you found the video useful! I think I went into this level of detail because I personally had a lot of trouble just... _getting_ Karnaugh maps in general. Glad to know that was a good choice =)
0612 TV w/ NERDfirst
You're welcome. I'm a software engineer student, so anytime I need more info I'm going to search your videos first. I'll like and comment on the ones that help me out. Already subscribed!
Cheers
People like you saves millions of lives each year.......
Hello and thank you for your comment! Millions might be a few too many, but I'll take the compliment! Glad you liked the video =)
Thank you so much! Super informative, gonna pass this midterm!!
That's great to hear! All the best for your exams :)
Thanks to the youtube's search engine i ve found your vid. Great job!
Hello and thank you for your comment! Glad you liked the video =)
one of the best and easiest explanations of this topic I have ever seen! truly superb
Hello and thank you very much for your comment! Very happy to be of help :)
Thank you for this wonderful explanation : ) I'm so happy that I finally understand our lesson in Advance Digital Electronics.
You're welcome! Very happy to be of help :)
Thank you
Very helpful and easy to follow
You're welcome! Very happy to be of help =)
You did first class job on this video.
Hello and thank you for your comment! Glad you liked the video =)
Great video. Helped a lot.
Hello and thank you very much for your comment! Very happy to be of help =)
Omg thanks for much. I was really confused on the variable portion but your color code in 15:06 was so helpful.
You're welcome! I struggled with these a fair bit as well when I first came across them, and that was what helped me at the time. Glad to be of help =)
Best explanation ever ! I've just discovered your channel and can't wait to see all the other videos. By the way, can you make an explanation about Quine-McCluskey algorithm for Logic circuits
Hello and thank you very much for your comment! I haven't heard of the Quine-McCluskey algorithm before today, but I'll look into it and see what I can do!
Finally i got this, thank you!
You're welcome! Glad to be of help =)
You covered everything in 20 mins what my instructor covered in 2 months.
Hello and thank you very much for your comment! Yeah I know what you mean. Sometimes in a school context there are just too many things to handle and the curriculum gets messy. Glad I could help out with that situation :)
Yes. We're all grateful for your quality content. Thank you very much.
Very, very helpful. Thank you!
You're welcome! Very happy to be of help =)
Many thanks!
You're welcome! Glad to be of help =)
it's really very helpful....cleared my doubts ....nice concept
Hello and thank you very much for your comment! Very happy to be of help =)
Best video for me today
My tutor just sent me this video, I said I know that guy! I used to subscribe to your patreon
Hello Ty! Thank you very much for your comment and support over the months :) Hope you've been doing well!
Hi there,
Very nice video I like your no nonsense approach and clarity all which helped enable understanding thank you
You're welcome! Very happy to be of help =)
@@NERDfirst Thank you!
I wonder have you produced a video covering the k map of a 7 segment display digit,
I am trying to learn about the subject and it gets a bit overwhelming as the variables increase, I am certain I could learn from your good presentation method
Ooooh, that's an intriguing idea.
Though at first glance there isn't very much to do - KMaps are useful for reducing things that are in the "sums-of-products" or "products-of-sums" format. For a single 7-segment display, it's really only a product (ie. an AND of all the segments that need to be switched on, AND the complements of the segments that need to be switched off) - there are no sums involved.
eg. To get the number 5 (according to this diagram: en.wikipedia.org/wiki/Seven-segment_display#/media/File:7_Segment_Display_with_Labeled_Segments.svg), the expression is just: ACDFGB'E'dp'
Since there are no sums ("ORs"), there's really nothing to simplify.
Nicely explained. The pace was also appropriate. Keep it up :)
Hello and thank you very much for your comment! Glad you liked the video =)
Very good my man. Excellent and Thank You!
Hello and thank you very much for your comment! Glad to be of help =)
Exellent episode thanks so much for the very fine presentation👌👌👍👍
You're welcome! Very happy to be of help =)
thank a lot this video help me to understand k-map for do what
You're welcome! Glad to be of help =)
dude just summed up one of my computer engineering course
Hello and thank you for your comment! Does your course really only cover this? That's not really a lot for a full course. At any rate, hope this summary was useful for you!
Thank You
You're welcome! Glad to be of help =)
Cheers mate, you explained it well.
Thank you very much! Glad you found the video useful :)
Thanks❤
You're welcome! Glad to be of help :)
You're a legend, Thank you
You're welcome! Glad to be of help =)
It was a really good video. I enjoyed it, and learned a lot.
Hello and thank you very much for your comment! Very happy to be of help =)
great video dude, keep up the good work
Hello and thank you for your comment! Glad to be of help =)
Lastima que mi teacher no es un nerd!!!
Exelente vdo!!!
Muchas gracias! Very happy to be of help :)
Thanks, very well explained! :)
You're welcome! Very happy to be of help =)
Very helpful
Thank you very much! Glad to be of help =)
15:00 Wouldn't A'C +AB be the most simplest solution or am I missing something?
Hello and thank you for your comment! That wouldn't work as the input 000 would not give you an output of 1: A'C + AB = 1x0 + 0x0 = 0
@@NERDfirst yes thank you. I was simplifying the statement using boolean algebra and missed a step. I'm just wondering what's the efficacy of using Boolean algebra to simplify instead of K-maps? which technique scales better?
Oh, Boolean algebra scales better for sure. I shudder at the thought of drawing K-maps for, say, 7 or 8 variables. And don't forget, the key advantage of a K-map is the ability to visually see relationships between the 1s (or the 0s) - Once you have a large map it becomes difficult anyway which defeats the purpose.
So do keeping all of the groups as large as possible, even if not required to get the result, minimize the number of gates required further?
Yes, exactly! The idea is, since each group represents many of the possible outcomes AND can do so with a reduced number of gates, we aim to have as few groups as possible, that are also as large as possible. That's also why we're so happy to make use of the "don't care" conditions - Because they help us make larger groups!
U just made my day!😜
Hello and thank you very much for your comment! Glad to be of help =)
thanks, mate
You're welcome! Glad to be of help =)
Wow...
SUPPPERRRBBB!!!
Thank you very much! Very happy to be of help, and it's great to see you've been enjoying my work :)
in which software u desiign
k map
Hello and thank you for your comment! The Karnaugh Map designs you see in the video were all created as part of my slides. Any slideshow application would do, eg. Powerpoint or Google Slides.
thank you for information. i want to your source code but just karnaugh map
Hello and thank you for your comment! I did not show any self-written program or code in this video, could you please clarify what source code you are looking for?
elisabet resbal do you use the kmap result to make the circuit or the truth table output?
Holy crap when you went from truth table to all the functions it clicked
Hello and thank you for your comment! That's great to hear, glad I could help you make sense of it.
Which software did you use to make those K-Map?
Hello and thank you for your comment! That's just PowerPoint!
The Best
Thank you very much! Glad you liked the video :)
why u talk to much on the next video directly on topic
Hello and thank you very much for your comment! I'm sorry you've had a bad experience! Unfortunately these videos are catered to those with no prior knowledge at all, so it's necessary to establish the fundamentals before we jump into the main topic!
@@NERDfirst i konw that but u go far beyond
Hello again! I understand your frustration but I'm afraid it's a necessary evil. After all, not everyone has as much background knowledge as you do :)
As a general rule of thumb, for longer videos (and not just for mine!) check in the video description. As in this case, I've included timestamps for you to jump ahead!