| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 341059000 | To or from run length limited codes | 32 |
| 20080272940 | Method and apparatus for channel coding and decoding - In a channel encoder comprising a dk-encoder stage and a precoding stage, obeyance of a repeated minimum transition runlength constraint is achieved because, between the dk-encoder and the precoder, data are passed through an RMTR encoder which replaces occurrences of a forbidden pattern by a current replacement pattern having the same length as the forbidden pattern. By appropriately selecting current replacement patterns from a predefined set of two different replacement patterns, DC-control can be achieved for the encoder output. The corresponding decoder is described, which also employs pattern replacement. | 11-06-2008 |
| 20080278356 | Method and apparatus for channel coding - For controlling the DC-content of a Run Length Limited RLL modulated channel bit stream organized in data blocks, control bits are periodically inserted into control blocks which are dynamically placed and sized near the data block boundaries in such a way as to enable independent dk-encoding of the data blocks body and the control blocks. Running digital sum differences are calculated. Control bit insertion is done in such a way that the d,k constraints of the RLL code are not violated, that the encoded dk sequence of the data block body is not altered, and that the running digital sum is minimized by eventually inverting the contribution of the data block body thereto. Compared to the number of data bits per data block, few control bits are sufficient to keep the digital sum variation DSV of the Running Digital Sum RDS small. | 11-13-2008 |
| 20080284624 | HIGH-RATE RLL ENCODING - An unencoded m-bit data input sequence is divided into a block of n bits and a block of m−n bits. The block of n bits is divided into a first set of n+1 encoded bits, wherein at least one of P1 subblocks of the first set satisfies a G, M and I constraints. The first set of n+1 encoded bits is mapped into a second set of n+1 encoded bits wherein at least one of P2 subblocks of the second set gives rise to at least Q1 transitions after 1/(1+D | 11-20-2008 |
| 20080316071 | Modulation Coding with Rll (1,K) and Mtr (2) Constraints - This invention relates to a method of converting a user bitstream into a coded bitstream by means of a runlengh limited (d, k) channel code where the channel code has a constraint of d=1. In order to ensure an improvement in bit detection performance an additional RMTR constraint of r=2 is imposed limiting to two the maximum number of minimum runs allowed by the d=1 constraint. An additional advantage of such a code is a limitation of the back-tracking depth of a Viterbi bit-detector Based on two different k constraints the construction of such d=1 and r=2 codes is disclosed. | 12-25-2008 |
| 20080316072 | Method for Constructing RLL Codes of Arbitrary Rate - The claimed embodiments provide methods, apparatuses and systems directed to run-length limited (RLL) coding of data. In one implementation, concatenatable RLL codes with run lengths of zeroes not exceeding k are constructed for any rate N/(N+1) where N≦2 | 12-25-2008 |
| 20090015446 | Coder and a Method of Coding For Codes With a Parity-Complementary Word Assignment Having a Constraint of D1=,R=2 - Presently known d=1 codes have long trains consisting of consecutive 2T runs and an overall high frequency of occurrence of the shortest 2T runs that reduce the performance of the bit detector By using a code with an MTR constraint of 2 an improvement in the bit detection is achieved. A code constructed in a systematic way that provides an MTR constraint of 2 is presented. A variation of such a code is disclosed where one sub-code is used, where coding states are divided into coding classes and where code words are divided into code word types. Then, for a given sub-code, an code word of type t can be concatenated with an code word of the next sub-code if said subsequent code word of said next sub-code belongs to one of coding states of the coding class with index T | 01-15-2009 |
| 20090128378 | MODULATION CODING - Methods and apparatus are provided for modulation coding of input data. In a first scheme, a modulation encoder applies a modulation code to input data to produce an (L,K)-constrained encoded bit-sequence, where K is maximum run-length of 0's, and L is the maximum run-length of 0's in each of the odd and even interleaves of the encoded bit-sequence. Then, a precoder effects 1/(1⊕D | 05-21-2009 |
| 20090195421 | METHOD AND APPARATUS FOR CONTROLLING DIGITAL SUM VALUE AND RECORDING MEDIUM FOR EXECUTING THE METHOD - A method of controlling a Digital Sum Value (DSV), including generating a plurality of DSV control bit patterns indicating predetermined information represented by at least one bit; and inserting any one of the generated DSV control bit patterns at a predetermined location of a modulated codeword. The plurality of the DSV control bit patterns indicate predetermined information represented by at least one bit so that the DSV control bit patterns control the DSV and can be used as predetermined information, instead of being discarded after the demodulation is completed. | 08-06-2009 |
| 20090267811 | CODE DESIGN WITH DECREASED TRANSITION DENSITY AND REDUCED RUNNING DIGITAL SUM - In accordance with one or more embodiments data may be encoded into a code word that meets run length constraints and has a reduced running digital sum by encoding (N-y)−1 data bits and y flag bits into m first n-bit patterns that form a first N-bit code word, producing a second N-bit code word by encoding the (N-y)−1 data bits and the y flag bits into m second n-bit patterns in which corresponding first and second n-bit patterns combine to meet a first predetermined running digital sum threshold, and selecting the code word that satisfies selection criteria. The selection criteria may, for example, be the word with the fewest transitions, the word with the smallest running digital sum, and so forth. | 10-29-2009 |
| 20100019941 | ENCODING APPARATUS, METHOD, AND PROCESSOR - Disclosed is an apparatus in which there are provided a first storage unit for storing signals to which indexes are given in order to distinguish each of a plurality of signals that are to be coded; a first index computing unit for computing first indexes of non-zero signals among the signals stored in the first storage unit; a second index computing unit for computing second indexes from a base index and the first indexes; a second index storage position search unit for searching for a storage position in a second storage unit in which the second indexes are to be stored based on values of the indexes stored in the second storage unit; a second index preserving unit for preserving the second index in the second storage unit based on a storage position searched for by the second index storage position search unit; and a control unit for giving the base index to the second index computing unit and for controlling operation of the first index computing unit, the second index computing unit the second index storage position search unit, and the second index preserving unit. | 01-28-2010 |
| 20100052953 | PROVIDING RUNNING DIGITAL SUM CONTROL IN A PRECODED BIT STREAM USING PRECODER AWARE ENCODING - A system includes a precoder-aware running digital sum (RDS) encoder that encodes user data as w-bit sub-blocks, to produce an encoded data block that meets block RDS constraints and consists of encoded data sub-blocks that meet sub-block RDS constraints. The sub-block constraints include the data sub-blocks having the same magnitude RDS before and after precoding. The encoder data block is further encoded using an error correction code to produce parity bits, and the parity bits are dispersed, as i-bit parity sub-blocks, between selected data sub-blocks to form a code word. The code word is then precoded to produce a precoded bit sequence for transmission over a channel. Sub-block run length limit (“RLL”) constraints may also be included, such that the encoded data block meets both RLL and RDS, with the encoded data sub-blocks meeting respective RLL and RDS sub-block constraints. | 03-04-2010 |
| 20100102999 | CODING SYSTEM FOR MEMORY SYSTEMS EMPLOYING HIGH-SPEED SERIAL LINKS - A method, apparatus and system employing a coder is disclosed. The coder to receive an incoming stream including a first code block and a second code block, and partition the first code block into first small code blocks, and partition the second code block into second small code blocks. The coder is further to code a memory that uses one or more serial lines for communication is performed, wherein coding includes coding the first small code blocks of the first code block and the second small code blocks of the second code block, wherein the coding of the first and second blocks is performed such that a maximum run length is maintained. | 04-29-2010 |
| 20100117875 | SYSTEM AND METHOD FOR COMPRESSING A STREAM OF INTEGER-VALUED DATA - A method and system are provided to minimize the size and complexity of bitstreams associated with encoded data by using a new compression scheme. An entropy encoder receives a list of run/data value pairs and entropy encodes separately the runs and data values, selecting their codewords according to length and magnitude, respectively, and catenates the resulting codeword pairs—run codeword first—in an encoded bitstream. | 05-13-2010 |
| 20100149003 | RUN LENGTH LIMITER AND RUN LENGTH LIMITING METHOD - According to one embodiment, a run length limiter includes a searcher configured to search a received digital data for a specific symbol, an operator configured to operate an exclusive OR operation of the specific symbol and the digital data, and an output module configured to output the exclusive OR operated digital data with the specific symbol. | 06-17-2010 |
| 20100164760 | CODING SCHEME FOR SERIAL DATA COMMUNICATIONS - An encoding scheme generates an encoded nine bit code word from each input eight bit data word. The coding scheme is such that the encoded data words have advantageous properties, such as a minimum of two polarity transitions in each encoded data word, and a maximum of five bits without a polarity transition. Five of the bits from the input eight bit data word appear unchanged in the encoded data word, while the other four bits of the encoded data word are obtained by applying appropriate logical operators to the remaining three bits of the input data word in combination with two of the five bits that appear unchanged in the encoded data word. Exception codes can also be defined, that is, nine bit code words that cannot be obtained from any eight bit data word by means of the coding scheme, and can be used to embed control information into the data stream. For example, the exception codes may advantageously have six or seven bits without a polarity transition. | 07-01-2010 |
| 20100194610 | Method and device for encoding a bit sequence - The invention is related to a method and a device for encoding of a bit sequence. | 08-05-2010 |
| 20100295711 | 17B/20B CODING SYSTEM - A method, apparatus and system employing a 17 B/20 B coder is disclosed. The 17 B/20 B coder to receive an incoming stream including a 17 B block and a 20 B block, and partition the 17 B block into first blocks, and partitioning the 20 B into second blocks. The coder is further to code 17 B to 20 B of memory using one or more serial lines for communication is performed, wherein coding includes coding the first blocks of the 17 B block and the second blocks of the 20 B block, wherein the coding of the first and second blocks is performed such that a maximum run length is maintained. | 11-25-2010 |
| 20110095921 | DATA DEMODULATOR, DATA DEMODULATION METHOD AND PROGRAM THEREOF - A data demodulator includes: a conversion means for converting an RLL code obtained by converting data in which information bits including specific bits are inserted at fixed intervals which is included in an input signal in accordance with a modulation table having variable-length conversion rules into data in accordance with a demodulation table corresponding to the modulation table; a determination means for determining control segments for performing calculation intended by the information bits from the converted data; a calculation means for executing calculation intended by the specific bit inserted in the control segment different from a calculation target with respect to the data of the control segment as the calculation target; and a correction output means for selecting one of first data converted by the conversion means and second data obtained by converting the RLL code of the input signal corrected based on the calculation result in accordance with the demodulation table and outputting the data. | 04-28-2011 |
| 20110115655 | CODING METHOD, CODING APPARATUS, DECODING METHOD, AND DECODING APPARATUS - Disclosed herein is a coding method including the step of: coding an information sequence in such a manner that upon performing error correction coding after carrying out RLL coding of the information sequence, the maximum number of consecutive 1-bits or 0-bits is α−β or less in an RLL code word over a range from bit p−α to bit p+α−1 of the RLL code word and that a β-bit error correcting code parity sequence is inserted between bit p−1 and bit p of the RLL code word, where α is a number larger than 1 representing the maximum number of consecutive 0-bits or 1-bits in an n-bit RLL code word and where p is a natural number. | 05-19-2011 |
| 20110234432 | SYSTEMS AND METHODS FOR OPTIMIZING BIT UTILIZATION IN DATA ENCODING - In one of many possible embodiments, a system for optimizing bit utilization in data encoding is provided. The exemplary system includes a data processing subsystem configured to identify a total number of unique characters within a set of data, which number represents an original base of representation of the set of data. The data processing subsystem is further configured to convert the set of data to a base of representation that is higher than the original base of representation and then encode the base-converted data with a fixed-length encoding scheme. | 09-29-2011 |
| 20110267207 | CONTENT-BASED SEGMENTATION SCHEME FOR DATA COMPRESSION IN STORAGE AND TRANSMISSION INCLUDING HIERARCHICAL SEGMENT REPRESENTATION - In a coding system, input data within a system is encoded. The input data might include sequences of symbols that repeat in the input data or occur in other input data encoded in the system. The encoding includes determining a target segment size, determining a window size, identifying a fingerprint within a window of symbols at an offset in the input data, determining whether the offset is to be designated as a cut point and segmenting the input data as indicated by the set of cut points. For each segment so identified, the encoder determines whether the segment is to be a referenced segment or an unreferenced segment, replacing the segment data of each referenced segment with a reference label and storing a reference binding in a persistent segment store for each referenced segment, if needed. Hierarchically, the process can be repeated by grouping references into groups, replacing the grouped references with a group label, storing a binding between the grouped references and group label, if one is not already present, and repeating the process. The number of levels of hierarchy can be fixed in advanced or it can be determined from the content encoded. | 11-03-2011 |
| 20120133531 | Digital Requantization Process and Devices - The invention relates to the digital signal requantization, at a given quantization step size, of a first word received in a first period of time and encoded in a first number of bits, into a second word, with a quantization error equal to a third number. A sequence of third words is outputted, equal to the second word, with the sequence subdivided into a first group comprising a number of third words that is equal to the third number and a second group of third words. Before outputting them, the correction means adds a least significant bit to the third words of the first group and adds or subtracts least significant bits to or from the third words of the second group, such that the sum of the least significant bits added to and subtracted from the second group is zero. | 05-31-2012 |
| 20120280838 | DATA COMPRESSION DEVICE, DATA COMPRESSION METHOD, AND PROGRAM - A prediction error calculation part calculates a prediction error for each input data. A prediction error encoding part generates a prediction error code by encoding the value of the prediction error. A run-length counting part counts the run-length of the prediction error. When the value of the prediction error changes, a run-length encoding part generates a run-length code by encoding the run-length counted. A code connecting part generates a connected code by connecting the run-length code to the prediction error code of a corresponding prediction error. When the value of the prediction error is a particular value, a prediction error checking part selects a connected code for the prediction error, as an output code. When the value of the prediction error is a different value, the prediction error checking part selects a prediction error code for the prediction error, as an output code. A code output part outputs the output code selected. | 11-08-2012 |
| 20130099947 | Data Compression Utilizing Variable and Limited Length Codes - According to one embodiment, method for decoding encoded data comprises a hardware module including circuitry to process a data stream. The data stream includes one or more encoded symbols each including a code assigned to a corresponding symbol. A set of least frequently occurring symbols are assigned a common code to encode those symbols within the data stream. Data blocks are generated each containing a data stream portion. One or more encoded symbols within each data block are identified by comparing data block portions to maximum code values for corresponding code lengths to determine a code length for each data block portion. A starting location for the identified encoded symbols within each data block is determined based on the determined code lengths. | 04-25-2013 |
| 20130154858 | METHODS AND SYSTEMS FOR DECODING DATA - A method of decoding is presented. The method includes the steps of receiving a coded bit stream that is generated by encoding source information using a Non Return to Zero Inverted (NRZI) code, selecting an NRZI decoding method based on one or more parameters associated with noise in the received coded bit stream, and generating a plurality of decisions by processing the received coded bit stream using the selected NRZI decoding method, wherein the received coded bit stream comprises a plurality of coded bits, and the plurality of decisions are estimates of a plurality of source bits in the source information. | 06-20-2013 |
| 20140085114 | MODULATION ENCODING AND DECODING - A method for producing N-bit output words of RLL-encoded data having both a global constraint G | 03-27-2014 |
| 20140104083 | TWO-DIMENSIONAL RUN-LENGTH LIMITED CODEC WITH PROTECTION WORDS AND METHOD FOR USING SAME - The invention provides a two-dimensional run-length limited (RLL) (1,3) code method and apparatus. The codec comprises an encoder and a decoder comprising a data buffer and grouping module, a two-dimensional code word generating module, a two-dimensional word unit page constructing module, a two-dimensional code word write array module, and a protection word stuffing module. The five modules are sequentially connected, and send output through the protection word stuffing module to a two-dimensional data recording device. The decoder comprises a two-dimensional data buffer module, a two-dimensional word unit page constructing module, a one-dimensional data word decoding module, and a one-dimensional data stream assembly module. The five modules are sequentially connected, and send output through the one-dimensional data stream assembly module. The encoding/decoding method and apparatus can solve problems that any binary two-dimensional data array composed of 0's and 1's satisfies two-dimensional (1, 3) RLL constraints in both horizontal and vertical directions. | 04-17-2014 |
| 20140167987 | SYSTEMS AND METHODS FOR DATA COMPRESSION AND PARALLEL, PIPELINED DECOMPRESSION - A method of data compression includes obtaining a data set comprising a sequence of data blocks comprising a predetermined number of data items, partitioning said data set into one or more groups each comprising a predetermined number of data blocks, and performing data compression on one or more groups of data blocks. Data compression is performed by associating a control data item with each of said blocks, generating a control vector comprising the control data items assigned to each of said blocks within a group, removing data blocks comprising entirely data items having said specified value, compressing data blocks comprising at least one data item having a value different from said specified value using a fixed-rate compression scheme, providing a compressed data stream comprising said compressed data blocks, and providing an associated control vector stream to enable control of said compressed data stream. | 06-19-2014 |
| 20140191887 | MTR AND RLL CODE DESIGN AND ENCODER AND DECODER - An array f(n) is received for n=1, . . . , N where N is a length of a codeword. An array g(n) is received for n=1, . . . , N where N is a length of a codeword. Input data is encoded to satisfy an MTR constraint and a RLL constraint using the array f(n) and the array g(n). | 07-10-2014 |
| 20150102948 | MULTI-LAYER SYSTEM FOR SYMBOL-SPACE BASED COMPRESSION OF PATTERNS - A method and apparatus for symbol-space based compression of patterns are provided. The method comprises generating an output sequence responsive of an input sequence, the input sequence being of a first length and includes a plurality of symbols, by extraction of all common patterns, wherein a common pattern includes at least two symbols and the output sequence is of a second length that is shorter than the first length; and storing in a memory the output sequence as a data layer. | 04-16-2015 |
| 20150333766 | RUN TIME COMPRESSION METHOD FOR A VEHICLE COMMUNICATION BUS - A method for run time zero byte compression of data on a communication bus of a vehicle includes determining a number of zero bytes provided in a data frame. When there are enough zero bytes, an encoding byte is generated that maps the locations of the zero bytes in the data frame. A data length code related to the number of non-zero data bytes and the encoding byte is provided in a device header. The data length code has a value less than an uncompressed data frame. The compressed data frame is transmitted with the encoding byte and the uncompressed non-zero data bytes. To decompress the compressed data frame, the encoding byte maps the locations of the zero bytes for a data frame. The non-zero data bytes are then provided at the proper locations to recreate the data frame. | 11-19-2015 |
| 20160079997 | SYSTEM AND METHOD FOR SYMBOL-SPACE BASED COMPRESSION OF PATTERNS - A method and system for symbol-space based pattern compression is provided. The method includes identifying a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length; generating an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length; and storing the output sequence as a data layer. | 03-17-2016 |
