Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
A family of conservative codes with block delimiters for decoding without a phase-locked loop
CSC '87 Proceedings of the 15th annual conference on Computer Science
| Hi-index | 0.00 |
We consider NRZI waveform codes thats atisfy a given set of run-length constraints and the upper bound on the accumulated dc charge of the waveform. These constraints enable the codeword to be self-clocking, ac-coupled, and suitable for data processing tape and communication applications. Various aspects of synthesis and analysis of such codes, called (d, k, C) codes, are illustrated by means of several examples. The choice of the initial state of the encoder is shown to influence the length of the data sequence over which the encoder must look-ahead.