Express boolean functions by enumerating the "on" values
_ _ _ _ _ _ _ _ _ _ _ _ | | | _| _| |_| |_ |_ | |_| |_| |_| |_ | _| |_ |_ |_| | |_ _| | _| |_| | |_| _| | | |_| |_ |_| |_ |
Left upper segment can be expressed as
This requires an unusual numbering of the Karnaugh map.
Sometimes a particular input just doesn't matter
_ _ _ _ _ _ _ _ _ | | | _| _| |_| |_ |_ | |_| |_| ??? ??? ??? | |_| _ |_| | |_ _| | _| |_| | |_| _| ??? ??? ??? |_ | |
Best done with a Karnaugh map.
A public domain circuit minimization tool from UC-Berkeley used in many university logic design courses.
.i 4 .o 1 # Comments .p 16 # 0000 0 # \ CD 00 01 11 10 0001 0 # AB\ ------------------------------ 0010 1 # 00 | 0(0) 1(0) 3(1) 2(1) 0011 1 # 01 | 4(1) 5(1) 7(1) 6(1) 0100 1 # 11 | 12(0) 13(0) 15(1) 14(1) 0101 1 # 10 | 8(0) 9(0) 11(1) 10(0) 0110 1 0111 1 1000 0 1001 0 1010 0 1011 1 1100 0 1101 0 1110 1 1111 1 .e
.i 4 .o 1 .p 4 01-- 1 --11 1 0-1- 1 -11- 1 .e