using only two-input NOR gates to implement the following function
F(A,B,C,D)=(A⊕B)'(C⊕D)
=(AB'+A'B)'(CD'+C'D)
=(AB')'(A'B)'(CD'+C'D)
=(A'+B)(A+B')(CD'+C'D)
how to simplify further
boolean-algebra
add a comment |
F(A,B,C,D)=(A⊕B)'(C⊕D)
=(AB'+A'B)'(CD'+C'D)
=(AB')'(A'B)'(CD'+C'D)
=(A'+B)(A+B')(CD'+C'D)
how to simplify further
boolean-algebra
add a comment |
F(A,B,C,D)=(A⊕B)'(C⊕D)
=(AB'+A'B)'(CD'+C'D)
=(AB')'(A'B)'(CD'+C'D)
=(A'+B)(A+B')(CD'+C'D)
how to simplify further
boolean-algebra
F(A,B,C,D)=(A⊕B)'(C⊕D)
=(AB'+A'B)'(CD'+C'D)
=(AB')'(A'B)'(CD'+C'D)
=(A'+B)(A+B')(CD'+C'D)
how to simplify further
boolean-algebra
boolean-algebra
asked Feb 18 '17 at 13:53
samexmm
143
143
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
We can write: $$(bar A + B)(A + bar B) = A bar A + bar A bar B + AB + Bbar B = AB + bar A bar B $$ Hope it helps.
add a comment |
When rewriting a formula for implementation with NOR gates, we aim for a product-of-sums form, because then the translation is immediate. In this case, the trick is to rewrite $(C oplus D)$ as $(C+D)(C'+D')$ to obtain a product of sums (POS).
Once you have your POS, you get a two-level NOR-NOR circuit with one NOR for each clause of the POS and one NOR gate to combine the outputs of the first-level gates. Of course, you also need four inverters, which you may consider one-input NOR gates.
Note that this procedure is the dual of the one that turns any sum of products into a two-level NAND-gate circuit.
In this case the second-level NOR gate would have four inputs, because there are four clauses in the product of sums. If you can only use two-input gates, then you need to decompose the four-input NOR into three two-input NORs and two inverters. If inverters are off limits, you can use two-input NOR gates with their inputs tied together instead.
If you want to go beyond two-level implementations things get significantly more interesting, but I bet you haven't gotten to that subject yet.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2150055%2fusing-only-two-input-nor-gates-to-implement-the-following-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
We can write: $$(bar A + B)(A + bar B) = A bar A + bar A bar B + AB + Bbar B = AB + bar A bar B $$ Hope it helps.
add a comment |
We can write: $$(bar A + B)(A + bar B) = A bar A + bar A bar B + AB + Bbar B = AB + bar A bar B $$ Hope it helps.
add a comment |
We can write: $$(bar A + B)(A + bar B) = A bar A + bar A bar B + AB + Bbar B = AB + bar A bar B $$ Hope it helps.
We can write: $$(bar A + B)(A + bar B) = A bar A + bar A bar B + AB + Bbar B = AB + bar A bar B $$ Hope it helps.
answered Feb 18 '17 at 13:59
Rohan
27.7k42444
27.7k42444
add a comment |
add a comment |
When rewriting a formula for implementation with NOR gates, we aim for a product-of-sums form, because then the translation is immediate. In this case, the trick is to rewrite $(C oplus D)$ as $(C+D)(C'+D')$ to obtain a product of sums (POS).
Once you have your POS, you get a two-level NOR-NOR circuit with one NOR for each clause of the POS and one NOR gate to combine the outputs of the first-level gates. Of course, you also need four inverters, which you may consider one-input NOR gates.
Note that this procedure is the dual of the one that turns any sum of products into a two-level NAND-gate circuit.
In this case the second-level NOR gate would have four inputs, because there are four clauses in the product of sums. If you can only use two-input gates, then you need to decompose the four-input NOR into three two-input NORs and two inverters. If inverters are off limits, you can use two-input NOR gates with their inputs tied together instead.
If you want to go beyond two-level implementations things get significantly more interesting, but I bet you haven't gotten to that subject yet.
add a comment |
When rewriting a formula for implementation with NOR gates, we aim for a product-of-sums form, because then the translation is immediate. In this case, the trick is to rewrite $(C oplus D)$ as $(C+D)(C'+D')$ to obtain a product of sums (POS).
Once you have your POS, you get a two-level NOR-NOR circuit with one NOR for each clause of the POS and one NOR gate to combine the outputs of the first-level gates. Of course, you also need four inverters, which you may consider one-input NOR gates.
Note that this procedure is the dual of the one that turns any sum of products into a two-level NAND-gate circuit.
In this case the second-level NOR gate would have four inputs, because there are four clauses in the product of sums. If you can only use two-input gates, then you need to decompose the four-input NOR into three two-input NORs and two inverters. If inverters are off limits, you can use two-input NOR gates with their inputs tied together instead.
If you want to go beyond two-level implementations things get significantly more interesting, but I bet you haven't gotten to that subject yet.
add a comment |
When rewriting a formula for implementation with NOR gates, we aim for a product-of-sums form, because then the translation is immediate. In this case, the trick is to rewrite $(C oplus D)$ as $(C+D)(C'+D')$ to obtain a product of sums (POS).
Once you have your POS, you get a two-level NOR-NOR circuit with one NOR for each clause of the POS and one NOR gate to combine the outputs of the first-level gates. Of course, you also need four inverters, which you may consider one-input NOR gates.
Note that this procedure is the dual of the one that turns any sum of products into a two-level NAND-gate circuit.
In this case the second-level NOR gate would have four inputs, because there are four clauses in the product of sums. If you can only use two-input gates, then you need to decompose the four-input NOR into three two-input NORs and two inverters. If inverters are off limits, you can use two-input NOR gates with their inputs tied together instead.
If you want to go beyond two-level implementations things get significantly more interesting, but I bet you haven't gotten to that subject yet.
When rewriting a formula for implementation with NOR gates, we aim for a product-of-sums form, because then the translation is immediate. In this case, the trick is to rewrite $(C oplus D)$ as $(C+D)(C'+D')$ to obtain a product of sums (POS).
Once you have your POS, you get a two-level NOR-NOR circuit with one NOR for each clause of the POS and one NOR gate to combine the outputs of the first-level gates. Of course, you also need four inverters, which you may consider one-input NOR gates.
Note that this procedure is the dual of the one that turns any sum of products into a two-level NAND-gate circuit.
In this case the second-level NOR gate would have four inputs, because there are four clauses in the product of sums. If you can only use two-input gates, then you need to decompose the four-input NOR into three two-input NORs and two inverters. If inverters are off limits, you can use two-input NOR gates with their inputs tied together instead.
If you want to go beyond two-level implementations things get significantly more interesting, but I bet you haven't gotten to that subject yet.
edited Feb 18 '17 at 14:31
answered Feb 18 '17 at 14:06
Fabio Somenzi
6,41221221
6,41221221
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2150055%2fusing-only-two-input-nor-gates-to-implement-the-following-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown