To simplify a Boolean function with a Karnaugh map and realise it with gates in both sum-of-products and product-of-sums forms.
- ICs 7408, 7432, 7404 (or 7400 only)
- Digital trainer kit
- Switches and LEDs
Theory
A truth table can be written as a sum of minterms (SOP) or a product of maxterms (POS). A K-map groups adjacent 1s (for SOP) or 0s (for POS) in powers of two to remove variables. Example: F(A, B, C) = Σm(1, 3, 4, 5, 7) simplifies to F = C + AB′ (SOP), which is (A + C)(B′ + C) in POS.
Read the lesson: Logic gates ›- SOP: B through a NOT gate; A AND B′; OR the result with C
- POS: (A OR C) AND (B′ OR C)
Procedure
Pre-lab check
4 questions · 75% to be readyTry the readings before the lab
| A | B | C | Minterm | F | C + AB′ |
|---|---|---|---|---|---|
| 0 | 0 | 0 | m0 | 0 | 0 |
| 0 | 0 | 1 | m1 | 1 | 1 |
| 0 | 1 | 0 | m2 | 0 | 0 |
| 0 | 1 | 1 | m3 | 1 | 1 |
| 1 | 0 | 0 | m4 | 1 | 1 |
| 1 | 0 | 1 | m5 | 1 | 1 |
| 1 | 1 | 0 | m6 | 0 | 0 |
| 1 | 1 | 1 | m7 | 1 | 1 |
Precautions
- Label every wire on the trainer to avoid mistakes.
- Test all 8 input combinations.
My readings
Type what you measured. It goes into your record book, and to My Garage when you are signed in.
| S. No. | A | B | C | Minterm | F | C + AB′ |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | ||||||
| 3 | ||||||
| 4 | ||||||
| 5 | ||||||
| 6 |
Check my readings
Put the value you set in the first column, then compare. Real parts have tolerance.
F = Σm(1, 3, 4, 5, 7) simplifies to C + AB′. Both SOP and POS circuits give the same truth table.
Everything above is free. The print-ready write-up comes with Maker.
Printed pages leave the observation table empty for your own readings.
Viva questions
Say your answer out loud first, then check. The first 2 answers are free; Maker opens all 4.
Quick answers for your record and viva
What is the aim of the realising a boolean function in sop and pos forms experiment?
To simplify a Boolean function with a Karnaugh map and realise it with gates in both sum-of-products and product-of-sums forms.
What apparatus is needed for realising a boolean function in sop and pos forms?
ICs 7408, 7432, 7404 (or 7400 only), Digital trainer kit, Switches and LEDs.
What is the theory behind realising a boolean function in sop and pos forms?
A truth table can be written as a sum of minterms (SOP) or a product of maxterms (POS). A K-map groups adjacent 1s (for SOP) or 0s (for POS) in powers of two to remove variables. Example: F(A, B, C) = Σm(1, 3, 4, 5, 7) simplifies to F = C + AB′ (SOP), which is (A + C)(B′ + C) in POS.
What result should I get in realising a boolean function in sop and pos forms?
F = Σm(1, 3, 4, 5, 7) simplifies to C + AB′. Both SOP and POS circuits give the same truth table.
What precautions should I take in realising a boolean function in sop and pos forms?
Label every wire on the trainer to avoid mistakes. Test all 8 input combinations.
