Toggle search
Search
Toggle menu
notifications
Toggle personal menu
Editing
K-map
(section)
From Turing Complete
Views
Read
Edit
Edit source
View history
associated-pages
Page
Discussion
More actions
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== So this is it? === Not quite. Since we can only do 1,2,4 and 8 bit blocks, we have to combine multiple blocks together, to cover all {{On}} outputs. Each one of them has to be part of a block. Overlapping blocks are no problem, they are actually quite helpful to create big blocks for missing bits. ==== Example ==== This is our truth table, that we already plugged into our Karnaugh map: [[File:KMap_Example4.png]] Now we have to do blocks of 1,2,4 or 8 (as big as possible) to cover all {{On}} output bits. We can do it like this: [[File:KMap_Example9.png]] We need 3 blocks to cover all bits: #[[File:YellowBox.png|14px]] A yellow 2-bit block #[[File:BlueBox.png|14px]] A blue 4-bit block #[[File:WhiteBox.png|14px]] A white 4-bit block Combined they look like this: {| class="truthtable" style="border: 2px solid darkgray; padding: 2px" | || [[File:D_boxed.png]] || [[File:C_boxed.png]] || [[File:B_boxed.png]] || [[File:A_boxed.png]] |- | [[File:YellowBox.png]] || [[File:Cross_gray.png|24px]] || [[File:On.png|24px]] || [[File:On.png|24px]] || [[File:On.png|24px]] |- | [[File:BlueBox.png]] || [[File:On.png|24px]] || [[File:Cross_gray.png|24px]] || [[File:Off.png|24px]] || [[File:Cross_gray.png|24px]] |- | [[File:WhiteBox.png]] || [[File:On.png|24px]] || [[File:Cross_gray.png|24px]] || [[File:Cross_gray.png|24px]] || [[File:On.png|24px]] |} To build the blocks, we '''AND''' the inputs and after that we '''OR''' the blocks together [[File:KMap_circuit_combining_blocks.png|640px]] And that's it! We created a circuit that describes the truth table completely!
Summary:
Please note that all contributions to Turing Complete are considered to be released under the Creative Commons Attribution-ShareAlike (see
TuringComplete:Copyrights
for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)