Digital Logic - Logic simplification

Поділитися
Вставка
  • Опубліковано 12 вер 2024
  • This is one of a series of videos where I cover concepts relating to digital electronics. In this video I talk about Demorgan's Theorem and some other logic simplification formulas.

КОМЕНТАРІ • 18

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

    Great videos. You explain it a whole lot better than my terrible professor.

  • @robincespedesfalla5905
    @robincespedesfalla5905 4 роки тому

    you teach more than my teacher , men you are magnificent .God bless you men

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

    You are my savior Good Sir!

  • @gauravkelkar8824
    @gauravkelkar8824 7 років тому +2

    @5:52, how is the comlpement on B written, if he didnt write it. maybe the video recording is not or partially mirrored or MAGIC!!!!
    or it might be photoshoped.

  • @blakebecker7926
    @blakebecker7926 6 років тому

    Great video series, thank you for posting these!

  • @robingadney4678
    @robingadney4678 4 роки тому

    Hi jack been watching your videos with interest found them to be excellent many thanks take care

  • @taekwondotime
    @taekwondotime 6 років тому +4

    *It's a shame that they don't use the "&" and "|" operators from the field of software development to represent the AND and OR operators in boolean algebra, because that's how they're actually represented in computer programming* .
    Example: F = (A&B) | C
    ... becomes ... if(A == true && B == true || C == true) .... then do something.
    For whatever reason, using "+" to represent OR and a "." to represent AND just doesn't compute with my brain. My brain will always see those operations as addition and multiplication and my eyes see algebra (general algebra). Boolean algebra really wrecks my brain! :(
    The reason why you would simplify these equations is not only for simpler, less expensive circuits, but for performance reasons when writing software. These boolean algebra equations become conditional IF statements in software. The more branches you have and the more nesting you have, the slower your computer program will be, especially if those comparisons are performed millions of times in a loop.

  • @raesmyname
    @raesmyname 10 років тому +6

    Are you writing backwards the whole time?

  • @ArunNalluri
    @ArunNalluri 8 років тому

    Awesome thanks for videos!!

  • @adityacapalasetty7232
    @adityacapalasetty7232 10 років тому +1

    really helpful...thanks

  • @RaiZRiZ
    @RaiZRiZ 10 років тому +7

    I want to buy you a drink!

  • @oxey_
    @oxey_ 8 років тому

    Really useful! I luv u ;3;

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

    Can someone explain to me the last simplification? It does not make sense for me.

  • @twitchmix9415
    @twitchmix9415 6 років тому +1

    Which one of you disliked this video!?!?!

  • @mcsnickerman7262
    @mcsnickerman7262 3 роки тому

    When I was writing down de Morgan’s law I almost started numbering from 0

  • @Titorelli
    @Titorelli 9 років тому +1

    If you press play and then continuously click on the circle at 45 second for about half a second between each click, it sounds like hes saying "vaginal".
    I need to go to bed...

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

    I wanna marry you sir,you explain very good :)