Gray-to-binary (and binary-to-Gray) conversion — which gate type is fundamental to the conversion network? Choose the logic function most commonly used to implement these code converters.

Introduction / Context: Gray code differs from binary by ensuring only one bit changes between consecutive values. Converters between Gray and binary are standard textbook circuits, and their structure hinges on a particular logic function applied cumulatively across bits.

Given Data / Assumptions:

• MSB in Gray equals MSB in binary.
• Each lower binary bit is formed by XORing the next-higher binary bit with the corresponding Gray bit.
• Symmetry exists for binary-to-Gray conversion: Gray bit = XOR of adjacent binary bits.

Concept / Approach: The defining operation of these conversions is XOR (exclusive-OR). For Gray→binary: b[n] = g[n], and for each i from n-1 down to 0, b[i] = b[i+1] XOR g[i]. The cumulative XOR chain ensures that each binary bit correctly reflects the parity of the Gray prefix as required.

Step-by-Step Solution:

Verification / Alternative check:

Why Other Options Are Wrong:

Common Pitfalls:

Final Answer: