Parity testing with XOR networks: for an XOR-based parity checker, what outputs occur for even-parity input words versus odd-parity input words?

Difficulty: Easy

Correct Answer: low, high

Explanation:


Introduction / Context:
Parity checkers determine whether the number of 1-bits in a word is even or odd. XOR gates form the core of simple parity circuits because their output is 1 for odd parity and 0 for even parity.


Given Data / Assumptions:

  • Parity checker constructed from cascaded XORs.
  • Definition: “even-parity word” → even count of 1s; “odd-parity word” → odd count of 1s.
  • Output convention: logic-low = 0, logic-high = 1.


Concept / Approach:
Because XOR toggles its output for each input bit equal to 1, the final output equals 1 if the number of toggles is odd; equals 0 if even. Hence, even parity → 0, odd parity → 1.


Step-by-Step Solution:

Feed all bits of the word into a tree of XOR gates. Interpret the final XOR output: 0 indicates an even count of 1s; 1 indicates an odd count. Map to wording: even-parity word → low; odd-parity word → high.


Verification / Alternative check:
Test a 4-bit word with two 1s (even): XOR output 0. Test with three 1s (odd): XOR output 1. This matches the stated mapping.


Why Other Options Are Wrong:

“High, low” reverses the correct mapping. Options using “odd, even” or “even, odd” are not voltage levels and do not answer the electrical output behavior. “None” is invalid because a correct mapping exists.


Common Pitfalls:
Mixing up conventions when an additional inverter is used after XOR (some designs invert the output to signal “OK” on even parity). Here, pure XOR output is assumed.


Final Answer:
low, high

More Questions from Digital Computer Electronics

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion