هنر
زیبایی و سلامت
صنایع دستی
فرهنگ و تاریخ
سرگرمی
محیط زیست
غذا و نوشیدنی
مهندسی معکوس
علوم
ورزش
فناوری
پوشیدنی‌ها
EFM and CIRC
Mark

ایجاد شده توسط

Mark

30. اوت 2026FI
۲۵
۰
۰
۰
۰

EFM and CIRC

A compact disc is designed to be handled by people who eat while they do it. That single requirement is why roughly half its physical capacity is spent on not being wrong. The problem is not that errors happen; it is their SHAPE. A fingerprint two millimetres across destroys about seven thousand consecutive channel bits. A single-error-correcting code does nothing at all against that, and making the block bigger makes it worse, because a bigger block catches more of the burst. The answer, and it is one of the most elegant ideas in engineering, is to stop the errors being consecutive BY THE TIME THE DECODER SEES THEM. Write the data through a set of delay lines of staggered length so that symbols which were neighbours in the message end up scattered across the disc. A burst on the disc then arrives at the decoder as one damaged symbol in each of many codewords, and one damaged symbol is exactly what a modest code can fix. Cross-Interleaved Reed-Solomon Code — two codes over GF(256), (28,24) and (32,28), with the delay lines between them — corrects a burst of about four thousand channel bits, which is two and a half millimetres of track, completely and bit-exactly. Alongside it, Kees Immink's eight-to-fourteen modulation does the channel coding that blueprint 7 covered — with one extra job. An optical pickup detects a THRESHOLD on a reflected intensity, so a drifting DC level moves the threshold and corrupts every decision at once. EFM spends three merging bits per symbol, carrying no data whatsoever, keeping the running digital sum near zero. That is why it looks wasteful next to RLL(2,7) and is not.
پیشرفته
4 hours

دستورالعمل‌ها

1

Start from single-bit correction

Work the Hamming code first if you have not. It corrects one bit in a block by using several parity bits over overlapping subsets, so the pattern of failed checks points directly at the guilty bit. Then hold that beside the number from the notebook: a fingerprint on a CD destroys about seven thousand consecutive channel bits. Hamming corrects one. The gap is four orders of magnitude and it cannot be closed by making the code stronger — a code that corrects seven thousand errors in a block would spend more on parity than on data. That mismatch is the whole reason the next two steps exist. The fix is not a bigger code. It is changing the SHAPE of the error before the code ever sees it.
2

Interleave a burst by hand

Rule a grid on paper, 8 columns by 8 rows. Write the message into it by ROWS: sixty-four symbols, numbered 1 to 64. Now read it out by COLUMNS and write that sequence in a line. That line is what goes on the disc. Strike out eight CONSECUTIVE symbols anywhere in that line — a burst. Then write the survivors back into the grid by columns and read the rows. Every row has lost exactly one symbol. A code that corrects one error per row now recovers the entire message, and it never needed to be stronger than that. Repeat with a burst of sixteen and watch each row lose two, which is where a (32,28) Reed-Solomon code sits — it corrects two. You have just built the core of CIRC with a pencil.

ابزارهای مورد نیاز:

Steel RuleSteel Rule
3

Scratch a disc and count what it costs

Take a CD you do not want and copy a large file from it, noting the time and that it works. Now damage it deliberately and radially — a single straight scratch from centre to edge with fine abrasive paper. Radial is the important word: a radial scratch crosses each track once, so every track loses a short burst, which is exactly what CIRC is built for. Re-read the file. It will almost certainly still verify. Then make a CIRCUMFERENTIAL scratch, following one track around. Re-read. This one is far more likely to fail, because it destroys a long run along a single track and interleaving cannot help if the damage follows the same path the interleave does. That asymmetry is the most useful practical thing in this blueprint, and it is why the advice to wipe a disc from the centre outwards is real engineering rather than folklore.

مواد مورد نیاز این مرحله:

Compact DiscCompact Disc3 قطعه
Sandpaper AssortmentSandpaper Assortment1 قطعه

ابزارهای مورد نیاز:

Desktop ComputerDesktop Computer
StopwatchStopwatch
4

Burst length, interleave depth, and the DC problem

در حال بارگذاری دفترچهٔ Jupyter…

ابزارهای مورد نیاز:

Desktop ComputerDesktop Computer
5

Compendium: why interleaving beats a stronger code

THE TWO CODES, AND WHY THERE ARE TWO. C2 is (28,24) Reed-Solomon over GF(256); C1 is (32,28). Between them sit delay lines of 0 to 27 frames — the cross-interleave. C1 sees the disc directly, corrects one or two symbol errors, and crucially FLAGS anything worse as an erasure rather than guessing. C2 then receives symbols already labelled reliable or not, and a code that knows WHERE the errors are corrects twice as many. Passing erasure flags forward is what makes the pair stronger than the sum of its parts. WHY NOT JUST A STRONGER CODE. Correction power costs parity, and parity costs capacity, linearly. Interleaving costs only DELAY — some decoder memory and a fraction of a second of latency, neither of which anyone notices. The design spends cheap latency instead of expensive parity, which is why interleaving turns up in every burst channel from CDs to deep-space telemetry to mobile radio. CD-ROM ADDS A THIRD LAYER. All of the above is the audio disc, where an uncorrectable burst is concealed by interpolation — inaudible in music, catastrophic in a program. So CD-ROM Mode 1 spends a further 280 bytes of every 2352-byte sector on more Reed-Solomon plus a 32-bit checksum. That is why a 74-minute disc holds 74 minutes of audio but only 650 MiB of data.

مواد

2
  • 3 قطعه
    جایگزین
  • جایگزین

ابزارهای لازم

3
  • جایگزین
  • جایگزین
  • جایگزین

CC0 مالکیت عمومی

این نقشه تحت مجوز CC0 منتشر شده است. شما آزاد هستید آن را کپی، ویرایش، توزیع و برای هر هدفی بدون نیاز به اجازه استفاده کنید.

با خرید محصولات از طریق نقشه از سازنده حمایت کنید و او کمیسیون سازنده تعیین شده توسط فروشندگان، دریافت می‌کند یا یک نسخه جدید از این نقشه ایجاد کنید و آن را به عنوان اتصال در نقشه خود قرار دهید تا درآمد به اشتراک گذاشته شود.

بحث و گفتگو

(0)

ورود برای شرکت در بحث

در حال بارگذاری نظرات...