Karnaugh Map (K-map) Rules for Simplification Explained

Поділитися
Вставка
  • Опубліковано 24 гру 2024

КОМЕНТАРІ • 15

  • @ALLABOUTELECTRONICS
    @ALLABOUTELECTRONICS  3 місяці тому +7

    _For more information related to K-map, check the following videos:_
    *1) Karnaugh Map (K-map) Explained (2-variable and 3 Variable K-map)*
    ua-cam.com/video/lw1STgKUpW0/v-deo.htmlsi=K8YgqgC6zQVJbI2z
    *2) 4-Variable K-map Explained:*
    ua-cam.com/video/v08rGyVYaII/v-deo.htmlsi=oH099gQqaCqmUMef
    *3) K-map: Prime Implicant and Essential Prime Implicant Explained:*
    ua-cam.com/video/fmAwCosFSRs/v-deo.htmlsi=v2WhEnYbS4d--Zgb
    *4) Don't care condition in K-map:*
    ua-cam.com/video/ZayoUTi2tsA/v-deo.htmlsi=Y-j05dHiUVji07Oy

  • @EMERGINGGamer
    @EMERGINGGamer 3 місяці тому +5

    Looks like the video is out at perfect timing for me

  • @현일황-c3f
    @현일황-c3f 3 місяці тому +1

    Thanks to your lecture, Can you make the video about Three phase circuits?

  • @mayurshah9131
    @mayurshah9131 3 місяці тому +1

    Just superb, please continue such informative videos ❤❤

  • @sanjayshah9838
    @sanjayshah9838 3 місяці тому +1

    V.Nice as usual 🎉

  • @urnoob5528
    @urnoob5528 3 місяці тому +1

    false
    groups can be diagonal in certain cases
    and they simplify to xor or xnor

    • @ALLABOUTELECTRONICS
      @ALLABOUTELECTRONICS  3 місяці тому +4

      Here I am talking about minimisation. When we do diagonal grouping, that’s not minimisation. What I mean to say is, the number of literals will still remain the same in the Boolean expression. As you said, yes in some cases all though it represents XOR or XNOR function but still you are not reducing literals in the expression.

    • @urnoob5528
      @urnoob5528 3 місяці тому +1

      @@ALLABOUTELECTRONICS not sure what u mean by literal here, number of variables? as in if there was A and B left in the expression with normal grouping, expressing it in xor or xnor form would still have the same number of variables, A and B, is this what u mean?
      otherwise, when i think about the "minimization" for xor and xnor, im thinking about expressing it in the shortest form, using their respective symbols

  • @muskanustad3834
    @muskanustad3834 3 місяці тому +3

    Thanks sir, you are helping me a lotttt by providing such high quality content ❤❤

  • @jeffsanto-t3c
    @jeffsanto-t3c 3 місяці тому +1

    Bro explain cascade amplifier

  • @muskanustad3834
    @muskanustad3834 2 місяці тому

    Sir please make a playlist on Static Timing Analysis 🙏🏻

  • @TheWordBoost
    @TheWordBoost 10 днів тому

    Thank you

  • @ahmadjaradat3011
    @ahmadjaradat3011 2 місяці тому

    Thanks

  • @TheWerdase
    @TheWerdase 3 місяці тому

    Now working as an engineer for quite a while, I see K-maps pretty useless to learn. They are cool, and gets you going, but shifts the mentality in a wrong way nowadays. Since nobody ever designs digital circuits using K-maps anymore, students do not learn the proper way of thinking. Focus should be on system-wide knowledge, a literal shitton of analysis and let the synthesizers figure out the most efficient logic soulution for a given circuit. Somehow in programming, we automatically rely on compilers and say it is a given. It should be the same for synthesizers too. Ditch K-maps and teach analysis, design principles and actually useful knowledge.

    • @urnoob5528
      @urnoob5528 3 місяці тому +3

      100 years later something breaks in these
      and nobody knows wtf to do and how to fix them
      because nobody knows the basic stuff anymore, using ur logic
      do not be the one to use, instead, be the one to create them, u will learn and understand more than others, making u just all in all a better engineer