BitFlow

XNOR Gate

beginner · combinational · 25 XP

Sign in to write your solution, run it in the simulator and submit it for grading.

Sign in or create a free account →

Problem

XNOR Gate Implement a 2-input XNOR gate. Output is high when inputs are **equal** — this is the equivalence gate. **Truth Table** | a | b | y | |---|---|---| | 0 | 0 | 1 | | 0 | 1 | 0 | | 1 | 0 | 0 | | 1 | 1 | 1 |

Constraints

  • Use ~(a ^ b) or (a ~^ b).

Examples

Input: a=1, b=1

Output: y=1

Input: a=0, b=1

Output: y=0

Common questions

What does the XNOR Gate problem ask you to build?
XNOR Gate Implement a 2-input XNOR gate. Output is high when inputs are **equal** — this is the equivalence gate. **Truth Table** | a | b | y | |---|---|---| | 0 | 0 | 1 | | 0 | 1 | 0 | | 1 | 0 | 0 | | 1 | 1 | 1 |
What constraints does XNOR Gate have?
Use ~(a ^ b) or (a ~^ b).
What is an example input and output for XNOR Gate?
Input a=1, b=1 gives output y=1.
Which Verilog concepts does XNOR Gate practise?
combinational, gates.