Binary to Gray Code Converter
Asynchronous FIFO pointers are stored in binary but must be converted to a format where only one bit changes at a time before crossing clock domains. This prevents intermediate invalid states from being sampled by the receiving clock.
Convert a 4-bit binary input B into a 4-bit Gray code output G. The most significant bit of the Gray code equals the most significant bit of the binary value. Each subsequent Gray code bit evaluates the parity of the current and next higher binary bit.
| B[3] | B[2] | B[1] | B[0] | G[3] | G[2] | G[1] | G[0] | |--------|--------|--------|--------|--------|--------|--------|--------| | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
Constraints
- Implement using strictly combinational logic.
- Use only XOR gates and direct wire connections.
Topics
Solve this problem
Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.
This problem is part of Codiode Pro. The statement above is free to read.
The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.