Difference between revisions of "Run-length limited coding"
From Computer History Wiki
(A start...) |
m (Proper cat, clarify a bit) |
||
| Line 1: | Line 1: | ||
| − | '''Run-length limited coding''' (often abbreviated to '''RLL''') is the name for a group of coding system in which a group of N data | + | '''Run-length limited coding''' (often abbreviated to '''RLL''') is the name for a group of coding system in which a group of N data [[bit]]s is stored as N+M bits, with the encodings from the first to the second chosen to limit the maximum number of sequential bits of one value or the other. |
| − | RLL is used with encoding systems such as [[Non return to zero inverted|NRZI]], in which long runs of a particular value would otherwise not exhibit level transitions, making it hard to keep the clock [[synchronized]]. | + | RLL is used with encoding systems such as [[Non return to zero inverted|NRZI]], in which long runs of a particular value would otherwise not exhibit level transitions, making it hard to keep the [[clock]] [[synchronized]]. |
| − | {{stub}} | + | {{semi-stub}} |
Revision as of 22:14, 20 October 2018
Run-length limited coding (often abbreviated to RLL) is the name for a group of coding system in which a group of N data bits is stored as N+M bits, with the encodings from the first to the second chosen to limit the maximum number of sequential bits of one value or the other.
RLL is used with encoding systems such as NRZI, in which long runs of a particular value would otherwise not exhibit level transitions, making it hard to keep the clock synchronized.
