Hi guys. I need some help showing that a logic circuit will do what I say it will.
My professor provided a 4-input, 3-output truth table and I diagrammed out a series of gates that'll get the outputs he wanted. It's somewhat convoluted, though, so he wants me to convince him that it actually works. The thing is, I don't know any boolean algebra (we're not learning it, just the most basic bit operations), so I don't know how I should go about doing this.
I've attached the circuit made from gates and the truth table data he gave.
For output 1, my circuit does 1 AND 2 AND 3 AND 4.
For output 3, it does 1 XOR 2 XOR 3 XOR 4.
For output 2, though, it gets more complicated. I'm 100% positive that it works, but I don't know how I can show it algebraically instead of with my truth tables.
Sorry about the crude drawing, but it should be understandable. Help appreciated.
My professor provided a 4-input, 3-output truth table and I diagrammed out a series of gates that'll get the outputs he wanted. It's somewhat convoluted, though, so he wants me to convince him that it actually works. The thing is, I don't know any boolean algebra (we're not learning it, just the most basic bit operations), so I don't know how I should go about doing this.
I've attached the circuit made from gates and the truth table data he gave.
For output 1, my circuit does 1 AND 2 AND 3 AND 4.
For output 3, it does 1 XOR 2 XOR 3 XOR 4.
For output 2, though, it gets more complicated. I'm 100% positive that it works, but I don't know how I can show it algebraically instead of with my truth tables.
Sorry about the crude drawing, but it should be understandable. Help appreciated.