
#1
Sep1909, 03:38 AM

P: 92

I know this is probably in the wrong board, but.
I'v just been looking into some Boolean algebra to convert truth tables into a set of logic gates representing a circuit. If i were attempting to represent a certain truth table, but i was limited to ONLY using NAND gates. (their the only one's i can find). How would i go about doing this. IM assuming i get a boolean expression for the truth table, and then attempt to factorize it into a certain form which uses only NAND gates. BUt im not exactly sure how to proceed. 



#2
Sep1909, 08:02 AM

Sci Advisor
P: 842




#3
Sep1909, 09:09 AM

P: 1,636

You can also do this with NOR gates, they are both very flexible.




#4
Sep1909, 12:58 PM

P: 410

Electronics and logic gate questionIs this for a particular application, or is it a classroom problem? KM 


Register to reply 
Related Discussions  
Finding a min gate input count realization of enabling logic...?  Engineering, Comp Sci, & Technology Homework  3  
logic gate XOR and XNOR  Computers  7  
Quantum logic gate measurement?  Quantum Physics  2  
NAND or NOR Logic Gate, which is less reliable at higher speeds  Electrical Engineering  5  
digital logic gate power suppy  Electrical Engineering  11 