The figure below represents the Karnaugh map for a function $\text{F(A,B,C,D).}$ Note, $\text{‘X’}$ stands for don’t care.
The simplified logical expression in the sum-of-products (SOP) form (i.e., the minimum number of product terms and the minimum number of literals in every product term) for $\text{F(A,B,C,D)}$ can be converted into a circuit implementation using only NAND gates, which is shown in:
- a
- b
- c
- d
