Digital logic circuit simlification using Karnaugh Maps.
How to use a visual method to solve boolean algebraic equations and truth tables.
Part 5 of the digital logic design tutorial series.
My favorite feature of Karnaugh maps is that you can easily insert "don't care" states into a map.
My favorite feature of Karnaugh maps is that you can easily insert "don't care" states into a map.
I was going to incude don't cares but totally forgot to mention it
My favorite feature of Karnaugh maps is that you can easily insert "don't care" states into a map.
More interestingly, they show which "bridging terms" are
necessary for glitch free operation of asynchronous circuits.
For those that think async circuits' behaviour is unimportant, consider:
- latches and flip-flops are asynchronous internally
- "discrete" logic designs often have asynchronous circuits, sometimes driving clock/reset lines.
- if, in a synchronous design, one of the signals takes more than one clock cycle to settle, then you may find asynchronos problems that aren't flagged by most digital simulators
Example of 2: I saw someone else's machine where that caused a car-sized bit of metal to move uncontrollably at several m/s until hitting the big red emergency button cut all power
Example of 3: I accidentally created a design which simulated correctly in an inertial delay simulator, but a transport delay simulator revealed the potential problem. Just as well, since respinning the implementation would have taken 3 months and several years salary.
The price I pay for doing tutorials:
The price I pay for doing tutorials:
Authors and viewers assess price/cost differently. I don't see a way of avoiding that.
The price I pay for watching a video is to lose 10X minutes of my remaining life whereas speed reading the same information would only take X minutes. Those 9X matter to me, and hence even yootube static pages don't appear in my browser
In other words, if there isn't a 150 word "elevator pitch" to the effect of "if you watch this then you will
gain knowledge of A1, A2, A3, B, C", then there are better things for my eyeballs to settle on
Having said that, at least you give a "table of contents".
Wow. This video has already been online for four days, but noone has complained that the solution for the second example is not the most optimal.
Following rules will always give a good result. But as humans we are often really good at spotting patterns.
The result used 10 gates with a total of 18 inputs.
I claim it can be done with 9 gates and a total of 16 inputs.
Wow. This video has already been online for four days, but noone has complained that the solution for the second example is not the most optimal.
Following rules will always give a good result. But as humans we are often really good at spotting patterns.
The result used 10 gates with a total of 18 inputs.
I claim it can be done with 9 gates and a total of 16 inputs.
Are you taking into account my correction at 18:35?
I made an editing mistake and didn't extend the correction past like a minute or something.
Are you taking into account my correction at 18:35?
I made an editing mistake and didn't extend the correction past like a minute or something.
Ah, right. I fell for the fact that you first added that NOT, but didn't notice that it magically vanished again.
So with that missing NOT, we actually have 19 inputs on 11 gates for the Karnaugh method.
Who noticed that the bottom half is the same as the top half rotated by two bits?
The price I pay for doing tutorials:
Good thing the supply of good stuff from the dumpster hasn't dried up