The K-map provides a "graphical" approach to simplifying sum-of-products expressions.

More Questions from Combinational Logic Circuits

• is in the form of a sum-of-products expression.
• The K-map in the figure below shows the correct implementation of the expression X = ACD + AB(CD + BC).
• A combinatorial logic circuit has memory characteristics that "remember" the inputs after they have been removed.
• To implement the full-adder sum functions, two exclusive-OR gates can be used.
• The carry output of each adder in a ripple adder provides an additional sum output bit.
• Single looping in groups of three is a common K-map simplification technique.
• The input at the 1, 2, 4, 8 inputs to a 4-line to 16-line decoder with active-low outputs is 1110. As a result, output line 7 is driven LOW.
• The XOR gate will produce a HIGH output if only one but not both of the inputs is HIGH.
• The Boolean equation results from this Karnaugh map.
• TTL stands for transistor-technology-logic.

Discussion & Comments