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映射。尝试使用乘积和求和形式。我们无法检查您是否对Karnaugh映射进行了最佳简化。但我们可以检查您的简化是否等效,以及您是否能将Karnaugh映射转换为电路。
module top_module(
input a,
input b,
input c,
input d,
output out );
assign out = (~a&~d) | (~b&~c) | (a & ~b & d) | (b&c&d);
endmodule
分析:
框图我是这么圈的,可能不是最简,如果有更简单的方法,可以评论区讨论下
m0+m1+m12+m13
m0+m4+m3+m7
m7+m11
m9+m10
然后进行简化 得到式子
运行结果: