SR to D Conversion: DFF from SR Flip-Flop
Standard cell libraries often build edge-triggered D flip-flops by wrapping simpler SR latch structures. Converting an SR core into a D-type data storage element requires ensuring the forbidden state is permanently unreachable.
Construct a D flip-flop using an SR flip-flop as the core. The output Q must capture the value of D on the rising edge of the clock. Map the D input to the internal S and R terminals to structurally guarantee that S and R can never simultaneously be 1. This strictly complementary mapping serves as the hardware proof that the forbidden state is impossible.
| D | S | R | |-----|-----|-----| | 0 | 0 | 1 | | 1 | 1 | 0 |
Constraints
- Use exactly one SR flip-flop.
- Use exactly one NOT gate.
- Do not use any other logic gates or storage elements.
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.