So I'm a programming student, but we have a computer architecture module. Just recently we started working with Proteus. Up to that point we had been discussing truth tables, binary conversions and k maps. So the jump to logic circuits was pretty fast.
So as part of our homework we were supposed to simplify truth table binary results to boolean algebra via k-map. Which I have done. But I'm completely lost how to do the actual multi-input gate implementation.
Basically there's two exercises:
1. Create a multi-input NAND gate implementation of the circuit with only NAND gates(for the expression).
2. Create a multi-input OR, AND and NOT gate implementation of the circuit for the expression.
My expression is : x = A’BCD’+AB’C’D+AB
Could you lead me the right path? There's 4 inputs going into a single output(A,B,C,D, right?). But how to i display that with OR AND and not gates? Or NAND gates?
So as part of our homework we were supposed to simplify truth table binary results to boolean algebra via k-map. Which I have done. But I'm completely lost how to do the actual multi-input gate implementation.
Basically there's two exercises:
1. Create a multi-input NAND gate implementation of the circuit with only NAND gates(for the expression).
2. Create a multi-input OR, AND and NOT gate implementation of the circuit for the expression.
My expression is : x = A’BCD’+AB’C’D+AB
Could you lead me the right path? There's 4 inputs going into a single output(A,B,C,D, right?). But how to i display that with OR AND and not gates? Or NAND gates?
Last edited: