Find the Minimal SOP Using a 5 Variable K-Map

  • Topic: Engineering 
  • Thread starter rugerts
  • Start date
  • Tags Tags
    Variable
1 reply · 2K views · last reply
rugerts
Messages
153
Reaction score
11
Homework Statement
Find the minimal SOP using the 5 var kmap
Relevant Equations
boolean algebra laws and axioms
Handwritten 5-variable K-map pair for K3, split by x=0 (x') and x=1 (x), each a 4x4 grid with q3q2 and q1q0 axes and cells numbered 0 to 31 in red.


Handwritten K-map work for a 5-variable function: two 4x4 Karnaugh maps, one for X=0 (complemented) and one for X=1, with minterm groupings circled, followed by the derived K3 SOP expressions and a boxed minimum SOP expression for K3.


My concern is that, when I tried checking my work, it doesn't match up with what's found on Logic Friday, a program I tried using to minimize the function.
Logic Friday software truth table with 5 inputs X, q3, q2, q1, q0 and output K3, listing terms 0 to 31; K3 is 1 for terms 10, 11, 12, 13, 15, 24, 25, 27, 29, 30, 31 and 0 for 8, 9, 14, 26, 28, with X for don't-care terms.

Text output from a logic minimization tool: a long unminimized sum-of-products expression for K3 entered by truthtable, followed by the minimized form K3 = X q2 q1 + X' q2' q1 + X' q2 q1' + X q2' q1' + q2 q0 + q1 q0'.
 

Discussion

Similar threads

Finding minimal SOP from 5-input Karnaugh map
  • shamieh
  • · Replies 1 ·
  • AI and Computer Science
Replies
1