I've reduced the following function into minimum gates and need to know if i've done it right, coz i think there's a possible way to reduce it even move but i'm not sure: f=BD+A'BC+AC'D+A'CD+ABC'+A'B'C'D'+AB'CD' I've added my solution in a file. Thanks!!!
So I've figured, But I became paranoid of not reducing my functions fully.. so i wanted to check if it really is the minimal number of gates i could get. Thank you!
It doesn't have less gates than me, but it has more of the same (XOR) gates, which is always a good thing when you try to build your circuit on a breadboard or PCB. Check this out about how I got my result: I made the ? (don't care) terms in a way that allows me to build the (A XOR B XOR C XOR D) gate. Is that clear?