The Karnaugh map method is very commonly used for the simplification of Boolean expressions, since no algebraic rules are applied in this method. It is simply a graphic method and provides systematic approach for getting the simplified Boolean expression. Kindly Minimize the logic function Y (A, B, C, D) = ∑m (0 1, 2, 3, 5 7, 8, 9, 11, 14). Use Karnaugh map. Draw logic circuit for the simplified function.
The Karnaugh map method is very commonly used for the simplification of
Boolean expressions, since no algebraic rules are applied in this method. It is
simply a graphic method and provides systematic approach for getting the
simplified Boolean expression. Kindly Minimize the logic function Y (A, B, C, D)
= ∑m (0 1, 2, 3, 5 7, 8, 9, 11, 14). Use Karnaugh map. Draw logic circuit for the
simplified function.
A combinational circuit is one in which the various gates in the circuit, such as the encoder, decoder, MUX, and DEMUX, are combined. At any given point, the output of a combinational circuit is solely determined by the levels present at the input terminals.
There is no memory in the combinational circuit. The prior state of the input has no bearing on the current state of the circuit.
In a combinational circuit, the output only depends on the value of input as regards the previous value of output. Output only depends on the present value of the input.
Steps to design combinational logic circuits :
- Identify the number of inputs and the number of outputs.
- Based on working draw truth table.
- Draw k-map and minimize the logic.
- Design circuit using logic gates.
Step by step
Solved in 2 steps with 2 images
