Near Field Notes

Note 44Signal integrityRev 1Watch the video · 2:55

Error correction on fast links

How big an error can a fast link fix by itself?

From one wrong bit in a camera packet’s header to 141 wrong bits in a row on 400G Ethernet, wherever they land. That is why a 400G link can get 102 million bits wrong a second and stay in spec. At that limit a block carries 1.30 bad symbols on average against the 15 it can fix, and one block is lost every 4.36 hours.

The receiver finds and fixes the wrong bits from check symbols the sender adds, with nothing sent again.

The margin ends in a cliff. Four times the errors loses 119 million times more blocks.

One 400G Ethernet block

544 symbols of 10 bits

One block, as sent514 data and 30 check symbols, 10 bits eachNo bad symbolsA block arrives with 2 bad symbolsAt the limit a block carries 1.30 on average2 bad of 544The receiver fixes bothIt can find and fix any 152 fixedFixedA burst of 141 wrong bits arrives141 bits in a row touch 15 symbols at most15 bad of 544Fixed: 15 of 15Any 15 bad symbols, anywhere in the block15 fixedFixed142 wrong bits can touch 16One past the budget: the decoder gives up16 bad of 544LostOne block, as sent514 data and 30 check symbols, 10 bits eachNo bad symbolsA block arrives with 2 bad symbolsAt the limit a block carries 1.30 on average2 bad of 544The receiver fixes bothIt can find and fix any 152 fixedFixedA burst of 141 wrong bits arrives141 bits in a row touch 15 symbols at most15 bad of 544Fixed: 15 of 15Any 15 bad symbols, anywhere in the block15 fixedFixed142 wrong bits can touch 16One past the budget: the decoder gives up16 bad of 544LostOne block, as sent514 data and 30 check symbols, 10 bits eachNo bad symbolsA block arrives with 2 bad symbolsAt the limit a block carries 1.30 on average2 bad of 544The receiver fixes bothIt can find and fix any 152 fixedFixedA burst of 141 wrong bits arrives141 bits in a row touch 15 symbols at most15 bad of 544Fixed: 15 of 15Any 15 bad symbols, anywhere in the block15 fixedFixed142 wrong bits can touch 16One past the budget: the decoder gives up16 bad of 544Lost
Simulated: 400G Ethernet’s own code, RS(544,514), with its decoder. Blue cells are data, purple are the 30 check symbols. Red is a bad symbol, green one put right. With 16 bad symbols the decoder gave up in all 300 tries of its round-trip check.

Fast links are allowed to get bits wrong

102 million a second

PCIe up to version 5 was built to get almost every bit right: one wrong bit in 10¹². On a 32 Gb/s lane that is one every 31 seconds.

PCIe 6 and 400G Ethernet send four voltage levels instead of two, and their specs allow far more. PCIe 6 allows a first-bit error rate of 10⁻⁶. 400G Ethernet’s optical link allows 2.4 wrong bits in 10,000.

A 400G module like this one sends 425 Gb/s on the line, eight lanes of 53.125 Gb/s. At 2.4 × 10⁻⁴ that is 102 million wrong bits every second, inside the spec.

A 400G optical module in a switch
Fig. 44aFig. 44aFig. 44a
Rendered for this page.

Counted a second, a PCIe 5 lane was allowed one wrong bit every 31 seconds and a 400G link is allowed 102 million. Each spec counts in its own way, listed under the chart.

With no correction, 94.6% of full-size 1,518-byte Ethernet frames would arrive damaged at that rate, and 11.6% of the smallest, 64 bytes.

So the sender adds check symbols worked out from the data, and the receiver uses them to find the wrong bits and put them right. This is forward error correction. It started with one bit.

Errors each spec allows a second
Fig. 44b0.011102104106108Errors a second, allowed before correctionPCIe 5, one lane1 every 31 sThunderbolt 5, one lane256PCIe 6, one lane64,000400G Ethernet102 millionFig. 44b0.011102104106108Errors a second, allowed before correctionPCIe 5, one lane1 every 31 sThunderbolt 5, one lane256PCIe 6, one lane64,000400G Ethernet102 millionFig. 44b0.011102104106108Errors a second, allowed before correctionPCIe 5, one lane1 every 31 sThunderbolt 5, one lane256PCIe 6, one lane64,000400G Ethernet102 million
From each spec’s error rate and line rate, named in Sources. Before any correction.
The numbers

Each spec counts its own way. PCIe 6 counts a burst once, by its first wrong bit.

LinkErrors a secondWhat the spec counts
PCIe 5, one lane1 every 31 swrong bits, 10⁻¹² at 32 Gb/s
Thunderbolt 5, one lane256wrong symbols, 10⁻⁸ at 25.6 GBd
PCIe 6, one lane64,000first wrong bits, 10⁻⁶ at 64 Gb/s
400G Ethernet102 millionwrong bits, 2.4 × 10⁻⁴ at 425 Gb/s

Hamming’s code finds the one wrong bit

1947

In 1947 Richard Hamming ran jobs on Bell Labs’ Model V relay computer over nights and weekends. When it found an error it dropped the job, because it could tell something was wrong but not where. He set out to make it find the bit. His paper came out in 1950.

His smallest code adds 3 check bits to 4 data bits. Each check bit makes the number of ones in its group even. Flip any one of the 7 bits and the checks that fail spell out where it is: here checks 2 and 4 fail, and 2 + 4 = 6.

All 7 one-bit errors were tried, and each pointed at its own bit.

Hamming’s (7,4) code
Fig. 44cSent: 4 data bits, 3 check bitsCheck 1Check 2Check 4011001110213140506171One bit flipsCheck 1Check 2Check 4011000110213140506071Checks 2 and 4 failCheck 1passesCheck 2failsCheck 4fails011000110213140506071Flip it back: fixedCheck 1passesCheck 2passesCheck 4passes011001110213140506171Fig. 44cSent: 4 data bits, 3 check bitsCheck 1Check 2Check 4011001110213140506171One bit flipsCheck 1Check 2Check 4011000110213140506071Checks 2 and 4 failCheck 1passesCheck 2failsCheck 4fails011000110213140506071Flip it back: fixedCheck 1passesCheck 2passesCheck 4passes011001110213140506171Fig. 44cSent: 4 data bits, 3 check bitsCheck 1Check 2Check 4011001110213140506171One bit flipsCheck 1Check 2Check 4011000110213140506071Checks 2 and 4 failCheck 1passesCheck 2failsCheck 4fails011000110213140506071Flip it back: fixedCheck 1passesCheck 2passesCheck 4passes011001110213140506171
Each circle is one check bit’s group. Data bits are blue, check bits purple. It rests on the failed checks.

The same idea still guards short, fixed fields. A CSI-2 camera packet’s header carries 6 check bits for its 24, so it fixes any one wrong bit and flags any two. DDR5 memory chips fix one wrong bit in every 128 inside the chip, with 8 check bits.

Two wrong bits are past them. In a stand-in code the size of DDR5’s, 4,878 of the 9,180 two-bit errors were “fixed” into three wrong bits.

Fast links don’t get one bit wrong at a time.

Codes that fix one bit

Fig. 44d

CodeData bitsCheck bitsEvery one-bit errorEvery two-bit error
Hamming (7,4), 1950437 of 7 fixedNot tried
Camera packet header, CSI-2 over D-PHY24630 of 30 fixed435 of 435 flagged, none fixed wrong
DDR5, inside each memory chip1288136 of 136 fixed4,878 of 9,180 made into three wrong bits
Simulated: every one-bit and two-bit error tried. The camera header’s check table and the DDR5 code are stand-ins, named in Conditions.

Wrong bits come in bursts

48% at a tap of 0.75

At these speeds each bit leaves a tail on the next sample. A decision-feedback equalizer in the receiver subtracts it: the bit it just decided, times a tap.

When it decides a bit wrong, it subtracts the wrong amount from the next sample as well. Half the time that pushes the next sample the right way. The other half it pushes toward the wrong side, and with a tap of 0.75 that is usually enough to cross.

In a model where noise alone gets one bit in 10,000 wrong, one wrong bit made the next one wrong 48% of the time. At a tap of 0.5 the push lands right on the line, and the next bit was wrong 25% of the time.

One tap of feedback, and a burst
Fig. 44eInBits out1 bit× 0.75−Bits as sent9 decided wrong in a rowFig. 44eInBits out1 bit× 0.75−Bits as sent9 decided wrong in a rowFig. 44eInBits out1 bit× 0.75−Bits as sent9 decided wrong in a row
Simulated bits, ones dark and zeros pale. Red marks the bits the receiver decided wrong.

Over 800 million bits it made 79,688 bursts. Most were a bit or two long. The longest ran 16 bits.

The chain gets longer as the tap grows. At a tap of 0.2 a wrong bit made the next wrong 0.7% of the time.

So a code for a fast link has to fix bursts. Reed-Solomon codes do it by counting symbols instead of bits.

How long the bursts ran
Fig. 44fBursts110102103104105USB4 is sureto fix up to 941,2161481216Wrong bits in a rowFig. 44fBursts110102103104105USB4 is sure to fix up to 941,2161481216Wrong bits in a rowFig. 44fBursts110102103104105USB4 is sure to fix up to 941,2161481216Wrong bits in a row
Simulated, tap 0.75. Bursts longer than the line are past what USB4’s code is sure to fix.
The numbers

Tap 0.75: 79,688 bursts in 800 million bits.

Wrong bits in a rowBursts
141,216
219,822
39,606
44,678
52,272
61,064
7535
8265
9129
1040
1134
1212
1310
142
152
161
The numbers

Every tap, the same noise and the same 800 million bits each.

TapAfter one wrong bit, the next is wrongLongest burst
0.20.7%3
0.33.5%4
0.411.5%7
0.525.0%9
0.638.7%12
0.7548.3%16
0.949.8%15

Reed-Solomon counts symbols, not bits

1960

In 1960 Irving Reed and Gustave Solomon, at MIT Lincoln Laboratory, published codes that treat a block of data as points on a curve. The sender adds more points from the same curve.

If a few points arrive damaged, the good ones still pin down the curve, and the damaged ones go back where it says. Give a code 2 extra symbols for each bad one it should fix, and it fixes that many, wherever they sit.

Every code on this page was built and given that many bad symbols at random, 300 times each. It fixed every one.

The idea, with ordinary numbers
Fig. 44gDamagedDataExtraFig. 44gDamagedDataExtraFig. 44gDamagedDataExtra
Drawn for this page. Real codes do the same arithmetic on 8-, 10- or 11-bit symbols in a finite field.

A symbol is a group of 8 or 10 bits. It costs one fix whether one of its bits is wrong or all of them.

So a burst costs only the symbols it touches. A code that fixes t symbols of m bits is sure to fix any burst of (t − 1)m + 1 bits, wherever it starts.

Every code here was given bursts of every length at every start position, and each one’s longest sure fix matched that sum. USB4’s code fixes 2 bytes, so 9 bits for sure. Its equalizer’s bursts ran past that.

Bits wrong, symbols spent
Fig. 44h1 wrong bit1 bad symbol8 wrong bits1 bad symbol9 wrong bits2 bad symbolsFig. 44h1 wrong bit1 bad symbol8 wrong bits1 bad symbol9 wrong bits2 bad symbolsFig. 44h1 wrong bit1 bad symbol8 wrong bits1 bad symbol9 wrong bits2 bad symbols
Drawn for this page: three bytes of a block, 8 bits each.

USB4 turns a burst into two wrong bits

4,024 of 4,024 bursts

USB4’s code at 20 Gb/s a lane is RS(198,194): 194 data bytes, 4 check bytes, 2 fixed. With the equalizer above, one burst in about 3,000 lost a block.

So USB4 sends each bit as the data bit XOR the bit sent before it. The far end XORs each bit it receives with the one before. Inside a run of wrong bits both neighbors are wrong and the flips cancel. Only the first wrong bit and the bit just after the run come out wrong.

With the precoder on, every one of 4,024 bursts in 40 million bits left exactly 2 wrong data bits, and no block was lost. The cost: a lone wrong bit also becomes two.

The burst of Fig. 44e, through USB4’s precoder
Fig. 44iOn the wire9 wrongData, once the precoder is undone2 wrongFig. 44iOn the wire9 wrongData, once the precoder is undone2 wrongFig. 44iOn the wire9 wrongData, once the precoder is undone2 wrong
Computed from the simulated burst. The USB4 spec says the precoder turns a burst into two errors, at its start and end.

DisplayPort added correction with compression

2016

DisplayPort 1.4, in 2016, added RS(254,250) with 10-bit symbols, two blocks interleaved, sure to fix 31 bits in a row. It arrived with Display Stream Compression and is required whenever compression is on. HDMI 2.1 did the same with RS(255,251), sure to fix 9.

PCIe 6 splits each flit three ways

under 2 ns

PCIe 6 sends data in 256-byte flits and keeps its correction under 2 ns. The code is small: the bytes take turns in three groups, and each group can fix one bad byte with its 2 check bytes.

A burst of 16 bits touches at most 3 bytes in a row, one in each group, so each group fixes its one. PCI-SIG gives 16 bits. In the model every burst up to 17 bits was fixed.

One flit, three groups
Fig. 44jA 16-bit burstFixedOne byte in each groupTwo bad bytes in one groupNot fixedA wrong fix 33% of the timeFig. 44jA 16-bit burstFixedOne byte in each groupTwo bad bytes in one groupNot fixedA wrong fix 33% of the timeFig. 44jA 16-bit burstOne byte in each groupFixedTwo bad bytes in one groupA wrong fix 33% of the timeNot fixed
Simulated with a stand-in group code. Each color is one group. The full-color cells at the end are the 6 check bytes.

Two bad bytes in one group are one too many. Given two, the group’s code reported a fix and handed back wrong data 33% of the time: 13,081 of 40,000 tries. The rest gave up.

So each flit also carries an 8-byte CRC, checked after the correction, and a flit that fails is asked for again. PCI-SIG puts that at 5 × 10⁻⁶ of flits. Note 28 follows the CRC.

The big codes here never fixed wrong: 400G Ethernet’s gave up all 4,000 times it was given 16 bad symbols. Ethernet can afford a big code, at about 100 to 200 ns of delay.

One bad symbol too many
Fig. 44k0204060%Tries that ended in a wrong fixHDMI 2.13 bad bytes49%PCIe 6, one group2 bad bytes33%USB43 bad bytes29%DisplayPort 1.43 bad symbols3.1%CD, first code3 bad bytes0.6%100G Ethernet, two-level8 bad symbols0 of 8,000Thunderbolt 513 bad symbols0 of 4,000400G Ethernet16 bad symbols0 of 4,000Fig. 44k0204060%Tries that ended in a wrong fixHDMI 2.13 bad bytes49%PCIe 6, one group2 bad bytes33%USB43 bad bytes29%DisplayPort 1.43 bad symbols3.1%CD, first code3 bad bytes0.6%100G Ethernet, two-level8 bad symbols0 of 8,000Thunderbolt 513 bad symbols0 of 4,000400G Ethernet16 bad symbols0 of 4,000Fig. 44k0204060%Tries that ended in a wrong fixHDMI 2.13 bad bytes49%PCIe 6, one group2 bad bytes33%USB43 bad bytes29%DisplayPort 1.43 bad symbols3.1%CD, first code3 bad bytes0.6%100G Ethernet, two-level8 bad symbols0 of 8,000Thunderbolt 513 bad symbols0 of 4,000400G Ethernet16 bad symbols0 of 4,000
Simulated: each code’s decoder, given one more bad symbol than it fixes, at random places.
The numbers

Bad symbols at random places in random blocks, one more than each code fixes.

CodeGivenTriesGave upWrong fixShare
HDMI 2.13 bad bytes40,00020,41319,58749.0%
PCIe 6, one group2 bad bytes40,00026,91913,08132.7%
USB43 bad bytes40,00028,42811,57228.9%
DisplayPort 1.43 bad symbols40,00038,7791,2213.1%
CD, first code3 bad bytes40,00039,7692310.6%
100G Ethernet, two-level8 bad symbols8,0008,00000.0%
Thunderbolt 513 bad symbols4,0004,00000.0%
400G Ethernet16 bad symbols4,0004,00000.0%

400G Ethernet’s margin, and its cliff

1.30 of 15

400G Ethernet’s code is RS(544,514): 514 data symbols and 30 check symbols of 10 bits, fixing any 15.

At the limit a block carries 1.30 bad symbols on average, and 27% arrive with none. A block with 16 or more is lost: one in 1.2 trillion. At 78.1 million blocks a second, that is one every 4.36 hours.

The spec’s limit comes with a condition: the errors must be random enough that 64-byte frames are lost less than 1.7 times in 10¹². The numbers here assume random errors.

Bad symbols in a block, at the limit
Fig. 44lShare of blocks110−410−810−1210−16Fixes up to 1505101520Bad symbols in a blockFig. 44lShare of blocks110−410−810−1210−16Fixes up to 1505101520Bad symbols in a blockFig. 44lShare of blocks110−410−810−1210−16Fixes up to 1505101520Bad symbols in a block
Counted for random wrong bits at 2.4 × 10⁻⁴. A symbol is bad if any of its 10 bits is wrong.
The numbers

Random wrong bits at 2.4 × 10⁻⁴; a 10-bit symbol is bad if any of its bits is. Mean 1.30.

Bad symbolsShare of blocks
027.1%
135.4%
223.1%
310.0%
43.3%
50.8%
60.2%
70.000338
85.45e-05
97.79e-06
101e-06
111.17e-07
121.25e-08
131.23e-09
141.12e-10
159.5e-12
167.55e-13
175.63e-14
183.96e-15
192.64e-16
201.66e-17

The margin is steep on both sides. Half the errors lose 35,900 times fewer blocks. Twice the errors lose 19,700 times more, and four times the errors 119 million times more.

The real decoder, run on random blocks with random wrong bits, landed on the count at every error rate where it lost enough blocks to count.

100G two-level Ethernet’s code fixes 7 symbols in 528. At 400G’s limit it would lose 5.2 × 10−5 of its blocks.

Blocks lost against raw errors
Fig. 44mShare of blocks lost110−510−1010−1510−20400G limit1×4×100G400G10−410−3Raw bit error rateFig. 44mShare of blocks lost110−510−1010−1510−20400G limit1×4×100G400G10−410−32.4 × 10⁻⁴Raw bit error rateFig. 44mShare of blocks lost110−510−1010−1510−20400G limit1×4×100G400G10−410−32.4 × 10⁻⁴Raw bit error rate
The lines are counted for random wrong bits. The hollow dots are runs of each real decoder. The filled dots mark the limit and four times it.
The numbers

400G Ethernet's code, counted for random wrong bits.

ErrorsRaw rateBlocks lostAgainst the limit
½×1.2 × 10−42.3 × 10−171/35,857
1×, the limit2.4 × 10−48.2 × 10−131×
2×4.8 × 10−41.6 × 10−819,701×
3×7.2 × 10−43.2 × 10−63,914,503×
4×9.6 × 10−49.7 × 10−5119,001,242×
5×1.2 × 10−31.1 × 10−31,298,863,738×
8×1.9 × 10−36.0 × 10−274,043,369,243×
The numbers

The real decoder on random blocks with random wrong bits.

RunBlocksLostShare lostThe count says
400G at 2.4 × 10−44,000,000008.15 × 10−13
400G at 8.0 × 10−440,000,0004601.15 × 10−51.16 × 10−5
400G at 1.0 × 10−38,000,0001,2221.53 × 10−41.53 × 10−4
400G at 1.4 × 10−31,000,0004,6614.66 × 10−34.70 × 10−3
400G at 2.0 × 10−3200,00015,5337.77 × 10−27.94 × 10−2
100G at 1.0 × 10−440,000,00041.00 × 10−78.93 × 10−8
100G at 2.4 × 10−44,000,0002135.32 × 10−55.15 × 10−5
100G at 5.0 × 10−4400,0002,2455.61 × 10−35.61 × 10−3

A CD spreads each word over 109 frames

3,856 bits

The biggest bursts belong to a disc. The CD, from 1982, uses two Reed-Solomon codes with a shuffle between them.

In the model, the first code, RS(32,28), fixes a frame with one bad byte and flags any worse. The 28 bytes it passes on are spread along the track, each byte of a word 4 frames after the one before. The second, RS(28,24), fills in up to 4 flagged bytes.

A scratch 16 frames long hits only 4 of a word’s 28 bytes, and the second code fills them in. In the model every burst up to 3,856 bits was fixed. The published figure is about 4,000 bits, 2.5 mm of track.

One word’s 28 bytes along the track
Fig. 44nScratch, 16 frames0108frames later4 of the word’s 28 bytes hitThe second code fills them inFig. 44nScratch, 16 frames0108frames later4 of the word’s 28 bytes hitThe second code fills them inFig. 44nScratch, 16 frames0108frames later4 of the word’s 28 bytes hitThe second code fills them in
Drawn to scale in frames, from the model’s 4-frame delays.

How big an error each link can fix

1 to 3,856 bits

Side by side, the longest burst each code is sure to fix, wherever it lands. At its luckiest start each reaches a little further: USB4 16 bits, 400G Ethernet 150, the CD 4,112. Note 26 covers the line codes these blocks ride on.

The longest burst each code is sure to fix
Fig. 44o1101001,00010,000Longest burst sure to be fixed, bitsCamera packet header1USB4, 20 and 40 Gb/s9PCIe 617DisplayPort 1.431100G Ethernet, two-level61Thunderbolt 5 (USB4 v2)122400G Ethernet141CD3,856Fig. 44o1101001,00010,000Longest burst sure to be fixed, bitsCamera packet header1USB4, 20 and 40 Gb/s9PCIe 617DisplayPort 1.431100G Ethernet, two-level61Thunderbolt 5 (USB4 v2)122400G Ethernet141CD3,856Fig. 44o1101001,00010,000Longest burst sure to be fixed, bitsCamera packet header1USB4, 20 and 40 Gb/s9PCIe 617DisplayPort 1.431100G Ethernet, two-level61Thunderbolt 5 (USB4 v2)122400G Ethernet141CD3,856
Simulated: each link’s code given bursts of every length at every start position. The CD is the simpler model in Conditions.
The numbers

Bits in a row, first and last wrong. Sure: fixed at every start position tried. At best: the longest fixed at its luckiest start.

LinkCodeSymbol bitsFixesSure to fixAt best
Camera packet header6 check bits on 2411 bit11
USB4, 20 and 40 Gb/sRS(198,194)82 bytes916
PCIe 63 groups, 2 check bytes each81 byte a group1724
DisplayPort 1.4RS(254,250), two interleaved102 symbols each3140
100G Ethernet, two-levelRS(528,514)107 symbols6170
Thunderbolt 5 (USB4 v2)RS(504,480)1112 symbols122132
400G EthernetRS(544,514)1015 symbols141150
CDRS(32,28) and RS(28,24), spread84 frames of the 283,8564,112

Conditions

Simulated
Every count of fixed, lost and wrongly fixed blocks on this page comes from codes and decoders written for it. None was measured on hardware.
Codes
Reed-Solomon over 8-, 10- and 11-bit symbols, decoded by Berlekamp-Massey, Chien search and Forney. USB4’s RS(198,194) and RS(504,480) reproduce the spec’s generator polynomials and its worked example blocks. The others are built from their published sizes.
Bursts
A burst of L bits has its first and last bits wrong. At every start position, four patterns: every bit wrong, only the two ends wrong, and two random fills between them. “Sure” means fixed at every start; “at best” is the longest fixed at any start. Every result matched (t − 1)m + 1 and tm, with interleaving multiplying t.
Stand-ins
PCIe 6’s group code is a Reed-Solomon code with 2 check bytes of each group’s size, byte i in group i mod 3. It is not the spec’s matrix, and the spec’s group sizes weren’t read. The camera header’s check-bit table was written from memory and tested for its structure only: every one-bit error fixed, every two-bit error flagged. DDR5’s code is a random single-error-correcting (136,128) code. The maker’s matrix sets how two-bit errors split.
CD
Both codes and the 4-frame delays between them. The first code fixes one bad byte and flags the frame otherwise; the second fills up to 4 flagged bytes. No EFM, no one-frame delays and no interpolation.
400G at its limit
Random, independent wrong bits at 2.4 × 10⁻⁴. A 10-bit symbol is bad if any of its bits is. Counted exactly, and checked with the real decoder in Monte Carlo runs at the rates in Fig. 44m.
Equalizer
Each sample is the bit (±1) plus 0.75 of the bit before plus Gaussian noise of 0.27 rms, enough alone for about one wrong bit in 10⁴. One feedback tap subtracts 0.75 of the last decision. 800 million bits at each tap from 0.2 to 0.9.
Precoder
USB4’s: each bit sent is the data bit XOR the last bit sent, undone at the far end by XORing each received bit with the one before. 40 million bits through the same equalizer at a tap of 0.75.
Published
Every error limit, line rate, delay and date comes from the specs and papers in Sources.

Models of each code. Nothing on this page was measured on a bench.

Limits

  • Random errors only, except for the equalizer’s bursts. Real links mix the two, and their bursts depend on the receiver.
  • A real 400G link interleaves two blocks across its lanes, so a burst on one lane spreads further than in one block. The page quotes one block.
  • The equalizer is a one-tap model with made-up noise, not any real receiver.
  • PCIe 6’s groups, the camera header’s table and DDR5’s matrix are stand-ins of the right size.
  • The CD model leaves out EFM, the one-frame delays and the player’s interpolation, so it lands under the published 4,000 bits.
  • What one wrong bit does to a compressed DisplayPort picture wasn’t run.
  • Soft-decision codes such as 10GBASE-T’s LDPC aren’t covered.

Files

  • sim/rs.pyGalois fields and Reed-Solomon codes: encoder, Berlekamp-Massey decoder, and every link’s code
  • sim/codecs.pyEach link’s framing, bursts at every length and start, Hamming (7,4), the camera header, the DDR5-size code, the CD model, and the checks against USB4’s example blocks
  • sim/waterfall.py400G at its limit, lost blocks against the error rate, the Monte Carlo runs, frames with no correction, and one bad symbol too many
  • sim/dfe.pyThe one-tap equalizer’s bursts at each tap, and the precoder run

Sources

Like this note?

Rev 1 ·
  1. Rev 1First published

Each fix gets a line here, with the reader's name if they want credit.

Did it answer your question?

Want more on this?

Report a problem

What should the next note be? Ask for one