Kmap1

Problem Statement

Implement the circuit described by the Karnaugh map below.

Try to simplify the k-map before coding it. Try both product-of-sums and sum-of-products forms. We can't check whether you have the optimal simplification of the k-map. But we can check if your reduction is equivalent, and we can check whether you can translate a k-map into a circuit.

module top_module(
    input a,
    input b,
    input c,
    output out  ); 
    
    assign out = b | (!b & c) | (a & !b & !c); 
    
endmodule

 

 

 

---

 

1. 붉은색 = b만 1로 고정 -> F = b
2. 초록색 = bc = 01로 고정 -> F = b'c
3. 파란색 = F = ab'c'
4. F = b + b'c + ab'c'