A worked mechanism
A registered predecode must preserve the original event cycle.
The chapter’s four-bit counter uses old values at a rising edge. Compare the predecode and the eventual count-15 consumer.
Before edge A
count == 14
count = 14. Combinational predecode recognizes the upcoming event.
After edge A
enable held for a cycle
Nonblocking updates make count = 15 and registered enable = 1.
At edge B
Consume once
The consumer sees old enable = 1 and old count = 15. It performs exactly the original count-15 action.
After edge B
count = 0 · enable = 0
The counter wraps to 0 and enable clears. The distributed enable no longer contains a multi-bit comparator.
Work it through
Why comparing against 15 is one edge late
If the registered predecode tests 15 instead, enable becomes high only after the count-15 sampling edge. A separate clocked consumer then observes it at count 0.
Compare against 14 to preserve this fixture’s event alignment.
Watch for this
The registered enable still has ordinary setup and hold paths. This transformation removes decode reconvergence; it does not waive STA.
Check your reasoning
Trace pre-edge count, pre-edge enable, post-edge state, and consumer events across 14 → 15 → 0, including reset initialization.
Check your understanding
Questions to reason through.
Why can a two-flop synchronizer not safely synchronize a data bus?
Each bit can resolve and be sampled on a different destination cycle, producing a word that never existed in the source domain. Multi-bit transfers need a protocol that holds a coherent word, such as a handshake, Gray-coded control transfer, or asynchronous FIFO.
Put it into practice
Explain the decision behind the design.
- Register a decoded enableRemove glitches and unsafe short timing paths.→
- Clock-domain crossing strategiesSelect a safe structure for controls, events, and buses.→
Complete the guide

