Kmap1

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.

实现下面 Karnaugh 地图描述的电路

在编码之前尝试简化 k 映射。尝试“总和乘积”和“乘积总和”窗体。我们无法检查您是否具有 k 映射的最佳简化。但是我们可以检查你的约简是否等效，我们可以检查你是否可以将k-map转换为电路。

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