[理工] [數位邏輯]-布林代數化簡問題
1. Reduce to a minimum product of sums:
_ _ _ _ _
F=(W+X+Z)(W+Y+Z)(W+X+Y)(W+Y+Z)
2. Multiply out to obtain a sum of products:
_ _ _ _ _ _
F=(W+X+Y)(W+Y+Z)(W+X+Y)(W+Y+Z)
3. Eliminate the XOR and then factor to obtain a minimum product of sums:
_ _
F=(WX⊕ Y)+Y Z
以上三題請高手們幫忙,小弟用笨方法兜了老半天每次都出現不同結果 >.<
在此先謝過了.
初次發問如有錯誤請鞭小力些 Orz
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.172.2.44