Hi everyone, i am currently struggling in my digital design and logic class that includes boolean simplifications and whatnot. I seem to understand how to simplify and am able to comprehend how the karnaugh maps work but what i do not understand is for example, on our midterm, how you simplify a boolean expression and draw the logic circuit with only two NOR gates or if he gives u the truth terms (sigma 1.2.3, etc) how to use the kmap and output the function in only nand and nor gates. is there a way to attack these problems?
an example f(a,b,c,d)= (a exclusive or b)'(c exclusive or d). draw a logic diagram using only two input nor gates to implement the following.
using only two level nor gates
i dont need the solutions just a methodical way to approach these types of problems
The Attempt at a Solution
i jsut want to know if there is a certain way i am suppose to be apporaching these kinds of problems