125 results about "Run-length limited" patented technology

A first run length encoder implements run length modulation of a first information signal to generate a second information signal of a run-length-limited code while subjecting the second information signal to DSV control and adding a sync signal to the second information signal to get a third information signal. A converter changes the third information signal into an NRZI signal including information code words. A parity generator produces original parity signals in response to the information code words in the NRZI signal, and combines the information code words and the original parity signals to form a first parity-added signal. A second run length encoder implements run length modulation of only the original parity signals in the first parity-added signal to convert the first parity-added signal into a second parity-added signal while subjecting the second parity-added signal to DSV control. The second parity-added signal is recorded on a recording medium.

Output data of a multiplexer 11 is EFM-modulated by an EFM modulator 12. In the EFM modulation, merging bits that satisfy run length limit conditions Tmin=3 and Tmax=11 are selected. Among them, merging bits that converge DSV are selected. A run length controlling portion 13 detects a particular data pattern that causes DSV to increase as large as a data read error takes place and controls the EFM modulator 12 so that the run length limit conditions of the EFM are loosened. As a result, an increase of DSV is suppressed. Data is reproduced from a data recording medium on which the data has been recorded in such a manner and the reproduced data is decoded. The decoded data is re-encoded so as to record it to another recoding medium. When the data pattern is re-encoded, DSV increases. As a result, data cannot be correctly reproduced from the other recording medium. Consequently, a copying operation can be prevented.

The process contains the following steps:

• • entering a teaching mode,
  • defining and recording zero, one or two limit of travel positions,
  • exiting the teaching mode,
  • determining the number and the type of the limits of travel produced by end stops,
  • if there exists at least one limit of travel produced by virtue of an end stop, detecting and recording the position of the end stops.

Compression of local data uses various methods to encode location data (e.g. line numbers and, optionally, column numbers) representing references to a source code information symbol in a source code file. Run length encoding and other run encoding methods are used. A preferred run encoding method encodes a run-encoded bitmap comprising a set of runs, in which each run has a first run field that provides a starting line for the run, and a second run field that encodes as a bitmap the remaining lines in the run in which the reference appears. A run length field may be used to indicate the length of the second run field. Another run field may be used to encode the length of the first run field, to permit further compression.

A signal of a run-length-limited code is reproduced from a recording medium. The reproduced signal is sampled to generate a sampling-resultant signal. An odd-sample signal and an even-sample signal are generated in response to the sampling-resultant signal. A first transversal filter subjects the odd-sample signal to first partial-response waveform equalization to generate an equalization-resultant odd-sample signal. The first partial-response waveform equalization depends on first tap coefficients. The first tap coefficients are controlled on a feedback basis to minimize an error of the equalization-resultant odd-sample signal. A second transversal filter subjects the even-sample signal to second partial-response waveform equalization to generate an equalization-resultant even-sample signal. The second partial-response waveform equalization depends on second tap coefficients. The second tap coefficients are controlled on a feedback basis to minimize an error of the equalization-resultant even-sample signal. The equalization-resultant odd-sample signal is decoded. The equalization-resultant even-sample signal is decoded.

Embodiments of the present invention generally relate to binary block transmission codes for high-speed network transmissions. More specifically, embodiments of the present invention relate to bounded-disparity run-length-limited forward error correction codes and methods of constructing and utilizing same. In one embodiment, a method for generating binary block bounded-disparity run-length-limited forward error correction transmission codes comprises selecting an existing base code, deriving a sub-code from the existing base code, having properties indicated by disparity bound, run-length limit and minimum distance, ascertaining a plurality of codewords and control characters from within the sub-code, encoding Messages to be transmitted with at least one codeword from the plurality of codewords, transmitting codewords from a transmitter to a receiver, and decoding the codewords into Messages.

The invention provides a codec with a protection word and a limited and restrained two dimension run length and an application method thereof. The codec comprises: an encoder and a decoder. The encoder comprises: a data buffer and packet module, a two dimension code word generation module, a two dimension word unit page structure module, a two-dimension code-word write-in array module and a protection word filling module. The above five modules are successively connected and are output to a two dimension data recording apparatus through the protection word filling module. The decoder comprises: a two dimension data buffer module, the two dimension word unit page structure module, a one-dimensional data word decoding module and a one-dimensional data flow assembly module. The above five modules are successively connected and are output through the one-dimensional data flow assembly module. By using the encoding and decoding method and the apparatus of the invention, two dimension (1, 3) RLL technology problem that the two dimension data array formed by 0 and 1 satisfies a (1, 3) RLL constraint in two directions can be solved.

When a code word sequence is generated by converting input data words of p bits into code words of q bits and concatenating adjacent ones of the code words with a merge bit sequence of r bits in order to obtain the best DSV value, according to one aspect, the adjacent code words are concatenated with the merge bit sequence of r bits which is selected, free from the restriction of the minimum run-length of (d+1)T and the maximum run-length of (k+1)T based on the run-length limiting rule RLL(d, k) but permitting the minimum run-length of (d+1)T and the maximum run-length of (k+2)T. According to another aspect, a merge bit sequence to be inserted after a current code word is selected by prefetching the current code word, a next code word, and a further next code word, temporarily concatenating these code words with merge bit sequences of r bits respectively to prepare code word sequence candidates free from the predetermined run-length limiting rule, calculating the DSV values of the code word sequence candidates, selecting one of the code word sequence candidates having a DSV value whose absolute value is closest to zero, and selecting the merge bit sequence between the current code word and the next code word of the selected merge bit sequence candidate. According to a further aspect, the input data words are encoded by a p-q modulation scheme after introducing for a predetermined period, as an input data word, specific data comprising alternating current signals or direct current signals which would cause a modulation device that prefetches only the next code word to output a code word sequence which includes particular frequency components.

A method of storing/retrieving information to/from an optical disc by means of an optical system with a cut-off frequency ν_cut-off, above which frequencies cannot be detected, is disclosed. The invention relates to Run Length Limited encoded information. According to the invention, some frequencies of the encoded information can be higher than cut-off frequency of the optical system, such that the equation 4*(d+1)*L_cd*NA/λ_laser<1 is satisfied, where d+1 is the minimum run length of the coding, L_cd is the length of a channel bit, NA is the numerical aperture and λ_laser is the wavelength of the optical system. Hereby, the capacity of the optical disc is increased, while the prevailing coding technique is used. Moreover, the invention relates to a disc for storing of data, a drive capable of storing data and an apparatus for manufacturing optical discs.

The invention relates to Run length Limited-codes storage systems. In modern storage systems, the inter-track spacing is chosen to be relatively small to allow for high storage densities. As a result, when reading a target track, data written on side tracks may appear in the recovered signal. This inter-track interference is called cross-talk. The invention proposes a cross-talk cancellation scheme based on the minimization of the mismatch between the actual (dm+1m) and the expected (exp) run length between two transitions (xm, xm+1) of the (dm+1,m) signal. The proposed solution significantly improves the ramp-up properties of the receiver and allows more efficient hardware implementation.

Various embodiments of the present invention provide systems, devices and methods for data processing. As an example, a data processing device is discussed that include a data encoding system and a data decoding system. The data encoding system is operable to receive a data input, and to: apply a maximum transition run length encoding to the data input to yield a run length limited output; apply a low density parity check encoding algorithm to the run length limited output to yield a number of original parity bits; apply a precode algorithm to the original parity bits to yield precoded parity bits; and combine the precoded parity bits and a derivative of the run length limited output to yield an output data set.