How do I convert CC-NOT gates to OR operators?

  • Thread starter khkwang
  • Start date
  • #1
60
0
Fredkin Gates are supposed to be universal. So far I've gotten AND, OR and NOT out of them but I can't figure out XOR. Any help?

I know that A XOR B = (A AND NOT B) OR (B AND NOT A), but trying to recreate that with Fredkin Gates is not very elegant... is that the only way?

Edit: I guess I can't change the title of my thread...

-----------------------------------------------------------------------------------------
nvm this bottom part of this post, it's been solved already.

According to Feynman Lectures in Computing, by using only C-NOT, CC-NOT and NOT gates we can recreate AND, OR and XOR gates.

I understand how to create AND and XOR, but I can't work out the OR. I spent a good few hours pondering and trying out different truth tables but I just don't get it. Can anyone demonstrate a way?
 
Last edited:

Answers and Replies

  • #2
rcgldr
Homework Helper
8,770
569
If you have AND and NOT, then NOT ( (NOT (INPUT1)) AND (NOT (INPUT2)) ) = ((INPUT1) OR (INPUT2))
 
  • #3
60
0
Ahh so simple. Can't believe I forgot something so basic. Thanks, you actually helped me clear up a whole other question as well.
 
Last edited:

Related Threads on How do I convert CC-NOT gates to OR operators?

  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
1
Views
1K
Replies
3
Views
735
Replies
12
Views
2K
Replies
1
Views
12K
  • Last Post
2
Replies
37
Views
7K
  • Last Post
Replies
1
Views
2K
Top