Part 3 answers: Is the receiver ready?
Two blocks that run at different, varying rates have to agree, every cycle, on whether a piece of data moved. A handshake is that agreement. Get it wrong and words are lost, duplicated or corrupted, usually only under the one traffic pattern your tests did not try.
This part starts with no backpressure at all, builds up to valid/ready and its rules, then covers request/acknowledge, register slices, skid buffers, the half-throughput trap and the theory of latency-insensitive design.
Say exactly when a valid/ready transfer happens, and why both sides always agree.
Explain why a registered ready needs a two-entry skid buffer.
Spot the 50% throughput bug on a waveform.
Answer each in your head before opening it. If two or more feel shaky, revisit Part 2: Encoding and Framing first.
Any two of: an explicit last flag (such as TLAST), a length field in the header, a unique delimiter symbol, a sync header that starts the next block, or a return to idle.
To guarantee transitions for clock recovery and to keep the run from looking like a reserved flag pattern.
20%: 2 of every 10 line bits carry no data.
# | Lesson | Level | Status |
|---|---|---|---|
3.1 | F · Foundation | Ready | |
3.2 | F · Foundation | Ready | |
3.3 | F · Foundation | Ready | |
3.4 | W · Working | Ready | |
3.5 | W · Working | Ready | |
3.6 | W · Working | Ready | |
3.7 | W · Working | Ready | |
3.8 | S · Senior | Ready | |
3.9 | S · Senior | Ready | |
3.10 | S · Senior | Ready | |
3.11 | P · Principal | Ready | |
— | all levels | Ready | |
— | all levels | Ready |
Every lesson in this part is ready. Work through them in order: each one sets up the problem the next one solves.
This course teaches why protocols are designed the way they are. These lessons show how to build or sign off the same ideas, so this part links to them instead of repeating them.