Quine McCluskey Lecture

Поділитися
Вставка
  • Опубліковано 18 вер 2024
  • This video introduces the Quine McCluskey combinational logic simplification algorithm.

КОМЕНТАРІ • 29

  • @ElusiveEnds
    @ElusiveEnds 7 років тому +6

    Thanks! Very well laid out explanation and thanks for also covering Petrick's method.

  • @ricaulcastellon9615
    @ricaulcastellon9615 5 років тому +1

    Man, you have done a hell of a job. You are not only good, but surpass anybody's expectations. YOU ARE DE BEST!!!

  • @alirezagholamshahi7589
    @alirezagholamshahi7589 Рік тому

    That was a really complete lecture about Q-M method that also included Q-m with dont cares, I appreciate the effort for making this video.

  • @cankavas
    @cankavas 4 роки тому +1

    You are a very talented tutor, great lecture thx.

  • @Romopis21
    @Romopis21 2 роки тому

    Thanks. I was finally able to understand McCluskey's method thanks to your explanation.

  • @AdrenalineAkash13
    @AdrenalineAkash13 4 роки тому +1

    Last-minute Saver .....Awesome keep uploading

  • @BaySelvi
    @BaySelvi 2 роки тому

    thank you sir a lot. There is a midterm tomorrow and your tutorial has wide range of covarege of the concept. Thank you a lot one more time.

  • @endarkened5153
    @endarkened5153 3 роки тому +1

    Much more clear compared to the textbook. This is why word choice is real important for instruction

  • @eaguiar313
    @eaguiar313 7 років тому +3

    Finally understood it! Thanks so much!

  • @leroykim5410
    @leroykim5410 9 років тому +3

    Thanks! your lecture gave me a lot of help!

  • @vishnukolluri
    @vishnukolluri 3 роки тому +1

    Excellent explanation ❤️❤️👍

  • @segunkuye2841
    @segunkuye2841 Рік тому

    Thanks for the clarity

  • @spaceghost8327
    @spaceghost8327 6 місяців тому

    amazing thank you, 9 years later

  • @zanon9148
    @zanon9148 7 років тому +1

    Thanks for the help, really god explanation

  • @idatumaattoni9846
    @idatumaattoni9846 5 років тому

    Excellent rendition

  • @jimnewton4534
    @jimnewton4534 5 років тому

    Can I still use the QM method if I start with an arbitrary DNF rather than a sum of minterms? I could expand any DNF to a sum of minterms, but that might be exponentially explosive, and exorbitant if the number of variables is large.

  • @choukriazzouzi5796
    @choukriazzouzi5796 2 роки тому

    Is there any videos in your,channel about simple automatics (calculating the parameters of the regulators like pi and pid )

  • @B2STShock
    @B2STShock 5 років тому

    Thank you so much!!!!

  • @OpRaven-62
    @OpRaven-62 4 місяці тому

    23:28 isn't 6,7 missing? 6 is 110, 7 is 111, they differ only in the LSB, so it would be 11-
    nvm, just as i hit send you uncovered it

  • @mohfa1806
    @mohfa1806 8 років тому +1

    i salute you sir

  • @주유소직원
    @주유소직원 2 роки тому

    이걸 보게 될 줄이야.

  • @adam2430
    @adam2430 7 років тому

    Mr Ricky Castles ... very good movie ...

  • @alimohammadi3182
    @alimohammadi3182 7 років тому +1

    der hammer

  • @yohanmathew2013
    @yohanmathew2013 2 роки тому

    tANKS !**!

  • @choukriazzouzi5796
    @choukriazzouzi5796 2 роки тому

    How to do it with undefined cases

    • @rickycastles1510
      @rickycastles1510  2 роки тому +1

      do you mean with don't cares? In those cases the first steps are exactly the same, treat the don't cares as minterms. Then when you get to the prime implicant chart, don't include the don't cares.

    • @choukriazzouzi5796
      @choukriazzouzi5796 2 роки тому

      @@rickycastles1510 thanks this is really helpful ❤❤