{"id":41171,"date":"2023-09-19T11:54:37","date_gmt":"2023-09-19T06:24:37","guid":{"rendered":"https:\/\/examdays.com\/blog\/?p=41171"},"modified":"2023-09-19T11:54:38","modified_gmt":"2023-09-19T06:24:38","slug":"xnor-gate-truth-table-circuit-diagram-formula-ic-number","status":"publish","type":"post","link":"https:\/\/examdays.com\/blog\/xnor-gate-truth-table-circuit-diagram-formula-ic-number\/","title":{"rendered":"XNOR Gate Truth Table Circuit Diagram Formula IC Number"},"content":{"rendered":"\n

The output level of an XNOR gate is high only when its two inputs are the same, either 0 or 1. The symbol of an XNOR gate is the same as XOR. Only a complement symbol is added. Sometimes, an XNOR gate is also called an equivalence gate.<\/p>\n\n\n\n

An “exclusive-NOR gate” is a combination of an exclusive-OR gate and a NOT gate but has the same truth table as a standard NOR gate, usually when the logic level is \u201c1\u201d and the output is \u201clow. Any inputs are at logic level \u201c1\u201d. \u201d to logic level \u201c0\u201d.<\/p>\n\n\n\n

XNOR Gate<\/h2>\n\n\n\n

However, a binary \u201c1\u201d or \u201c0\u201d output is obtained only if both inputs are at the same logic level. For example, “00” or “11”. This input combination gives us the Boolean expression: Q = (A \u2295 B) = A.B + A.B.<\/p>\n\n\n\n

2-input Ex-NOR gate<\/h3>\n\n\n\n

This is a simple form of hybrid gate XNOR. This XNOR gate has only two input values \u200b\u200band an output value. There are 22=4 combinations of inputs. When both inputs are set to high(1) then output level is high. The Boolean expression of a two-input XNOR gate is as follows:<\/p>\n\n\n\n

Y=(A\u2a01B)’
Y=((AB)’+AB)<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

XNOR GATE Logic Design<\/u><\/strong><\/h2>\n\n\n\n
\"\"<\/figure>\n\n\n\n

XNOR GATE Truth Table:<\/u><\/strong><\/h2>\n\n\n\n

Giving the Boolean expression of  Q = AB + AB<\/p>\n\n\n\n

Input<\/strong><\/td>Output<\/strong><\/td><\/tr>
A<\/strong><\/td>B<\/strong><\/td>Y<\/strong><\/td><\/tr>
0<\/td>0<\/td>1<\/td><\/tr>
0<\/td>1<\/td>0<\/td><\/tr>
1<\/td>0<\/td>0<\/td><\/tr>
1<\/td>1<\/td>1<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

The 3-input XNOR Gate<\/u><\/strong><\/p>\n\n\n\n

Unlike a 2-input XNOR gate, a 3-input XNOR gate has three inputs. There are 23=8 combinations of inputs. The Boolean expression of a logical Ex-OR gate is as follows:<\/p>\n\n\n\n

Y=(A\u2a01B\u2a01C)’
Y=(ABC)’+ABC’+AB’C+A’BC<\/p>\n\n\n\n

Logic Design<\/u><\/strong><\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

The Boolean expression of  Q = ABC + ABC + ABC + ABC.<\/p>\n\n\n\n

We mentioned earlier that the Ex-NOR function is a combination of various basic logic gates, Ex-OR, and NOT gates, and using the above 2-input truth table, we can expand the Ex-NOR function as:<\/p>\n\n\n\n

 Q = A \u2295 B = (A.B) + (A.B).<\/p>\n\n\n\n

Truth Table:<\/u><\/strong><\/p>\n\n\n\n

Input<\/strong><\/td>Output<\/strong><\/td><\/tr>
A<\/strong><\/td>B<\/strong><\/td>C<\/strong><\/td>Y<\/strong><\/td><\/tr>
0<\/td>0<\/td>0<\/td>1<\/td><\/tr>
0<\/td>0<\/td>1<\/td>0<\/td><\/tr>
0<\/td>1<\/td>0<\/td>0<\/td><\/tr>
0<\/td>1<\/td>1<\/td>1<\/td><\/tr>
1<\/td>0<\/td>0<\/td>0<\/td><\/tr>
1<\/td>0<\/td>1<\/td>1<\/td><\/tr>
1<\/td>1<\/td>0<\/td>1<\/td><\/tr>
1<\/td>1<\/td>1<\/td>0<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Ex-NOR gate equivalent circuit<\/h2>\n\n\n\n

We can design XNOR or Ex-NOR gates using gates like AND, OR, and NOT gates. The disadvantage of this implementation is that we use different types of gates to create a single XNOR gate. By using only NAND gates, we can also implement an Ex-NOR gate. This is the simple way to design an Ex-NOR gate functionality.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Use of Ex-NOR gate:<\/h2>\n\n\n\n

Ex-NOR gates are mainly used in electronic circuits that perform arithmetic operations and data checking such as adders, subtractors, or parity checkers. Since the Ex-NOR gate gives a logic level “1” output when its two inputs are equal. , which is used to compare the magnitude of two binary digits or numbers, and Ex-NOR gates are used in digital comparator circuits.<\/p>\n\n\n\n

How is XOR different from XNOR?<\/strong><\/p>\n\n\n\n

XOR<\/strong>: If their number is odd, the output is one. Otherwise, the output will be zero.<\/p>\n\n\n\n

XNOR:<\/strong> This is the negative logic of XOR. So if their number is equal, the output will be one. Otherwise, the output will be zero.<\/p>\n\n\n\n

The truth table of both:<\/p>\n\n\n\n

X and Y are input, and Z is Output<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

What is the advantage of using an XNOR over XOR?<\/strong><\/p>\n\n\n\n

XNOR and XOR are very different functions and, in fact, complement each other. Because they are so opposite, they are not interchangeable.<\/p>\n\n\n\n

XOR can be written as “either X or Y but not both”.<\/p>\n\n\n\n

It outputs true (or 1) if the inputs are different and false (or 0) if the inputs are the same. Conversely, XNOR can be written as \u201cX and Y are the same\u201d. It outputs true (or 1) if the inputs are the same and false (or 0) if the inputs differ.<\/p>\n\n\n\n

Is the XNOR gate associative?<\/strong><\/p>\n\n\n\n

Yes, it is a associative. Let me suggest a simple method to memorize the function of the XNOR gate. An XNOR gate gives an output when the number at the input is equal to 1 and 0. Now, this operation is not entirely dependent on XNOR being associated with a particular variable; XNOR is being associated.<\/p>\n\n\n\n

Conclusion<\/u><\/strong>:<\/p>\n\n\n\n

XNOR gate is a combination of an exclusive-OR gate and a NOT gate but has the same truth table as a standard NOR gate, usually when the logic level is \u201c1\u201d and the output is \u201clow. Any inputs are at logic level \u201c1\u201d. \u201d to logic level \u201c0\u201d.<\/p>\n\n\n\n

Table Of Contents<\/div><\/div>