Abstract: A method for multi-level embedded coding may include performing multiple single-level embedded coding operations in order to code multiple types of information. Each single-level embedded coding operation may include coding a second type of information and embedding a first type of information into the coding of the second type of information. Embedding the first type of information into the coding of the second type of information may include determining a desired symbol distribution for a modulated codeword corresponding to the second type of information such that a symbol corresponding to the first type of information is more prevalent within the modulated codeword than other symbols.

Abstract: An improved programmable compute system and method for executing an H.264 binary decode symbol using only a single instruction and two compute units is achieved by providing not just one rLPS value but all four next possible rLPS values of the current context next state so that there is no delay initially while calculating the correct rLPS because all four are present and any one can be chosen; further all the parameters e.g. value, range, context, and rLPS can be served by only two available 32 bit registers by generating, locally, the MSP ninth bit, of range based on the fact that the range is normalized to a known value in the MSB.

Abstract: A system communicates data and includes an encoder for encoding communications data. A modulator maps the communications data based on a specific mapping algorithm to form a communications signal over which the communications data can be transmitted. The communications signal includes a preamble that has set-up or transmission parameters used for acquiring the signal at a modem and at least one extended preamble for conveying additional set-up or transmission parameters. This extended preamble includes N extended preamble bits having at least one of information, transmission parameter and control bits and M map bits that identify a predetermined mapping for the N extended preamble bits.

Abstract: A digital decoding apparatus and method receives a compression-coded digital signal in predetermined units and decodes the received compression-coded digital signal in the predetermined units. The compressed-received digital signal is coded in the predetermined units with updating a table of probability of occurrence which is assigned for each coding symbol. An arithmetic decoding unit initializes a decoding process when decoding of signal in the predetermined units is started, based on information of initializing the table of probability of occurrence which is multiplexed on a header of data for the predetermined units and information of initializing a register value which shows the arithmetic decoding process.

Abstract: An apparatus for processing a signal and method thereof are disclosed. Data coding and entropy coding are performed with interconnection, and grouping is used to enhance coding efficiency. The present invention includes the steps of obtaining a group reference value corresponding to a plurality of data included in one group through grouping including first grouping and second grouping and a first difference value corresponding to the group reference value and obtaining the data using the group reference value and the first difference value.

Abstract: Briefly, within a computer or digital data processing system, embodiments describe a method, article and apparatus for compressing data is described, which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communicating between two or more computers or digital data processing systems via an interconnection medium such as a network.

Abstract: Briefly, within a computer or digital data processing system, embodiments describe a method, article and apparatus for compressing data is described, which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communicating between two or more computers or digital data processing systems via an interconnection medium such as a network.

Abstract: A device for processing a digital input value includes a first memory portion having stored thereon Q delimiter values where the Q delimiter values divide the range of the N-bit digital input value into Q+1 regions and at least a first region and a second region are of unequal sizes, a second memory portion has stored thereon a look-up table storing Q+1 sets of coefficients for performing numerical value conversion of the digital input value to a digital output value in a second, natural unit, and an arithmetic logic performing numerical value conversion using the N-bit digital input value and the selected coefficient pair. The N-bit digital input value is compared with the Q delimiter values to determine a respective one of the Q+1 regions in which the N-bit digital input value lies. The look-up table is indexed according to the respective region to provide the selected coefficient pair.

Abstract: A method and systems are provided for efficiently implementing content adaptive variable length coding on a modern processor. Some embodiments comprise encoding a non-zero coefficient in an array of coefficients in an iteration of an encoding loop. The code value of the encoded non-zero coefficient is determined, at least in part, by the magnitude of another non-zero coefficient in the array of coefficients. A run of zero coefficients preceding a non-zero coefficient in the array of coefficients is also encoded in the iteration of the encoding loop. The encoded non-zero coefficient is appended to an encoded video bitstream when encoded. The encoded run of zero coefficients is stored in a storage device and appended to the encoded video bitstream after all non-zero coefficients in the array of coefficients have been encoded.

Abstract: A technique for incorporating binary formatting into a tag-based description language, such as XML, is provided. The binary formatting is achieved by tokenizing the tag and attribute names into variable sized numeric tokens, thereby obviating the need for repetitive or redundant storage of lengthy unicode words, etc. The binary formatting minimizes parsing time and the generation of overhead incident to the formatting and parsing of data. Parsing time is thereby substantially decreased and generally, the size of the resulting file decreases too.

Abstract: A compute system for executing an h.264 binary decode symbol instruction including a first compute unit having a range normalization circuit and an rLPS update circuit, and operating in a first mode responsive to current rLPS, range, value and current context to generate the next normalized range and next rLPS for the current context; a second compute unit including a value update circuit, a context update circuit, and value normalization circuit responsive to current rLPS, range value and current context to obtain the output bit, normalized value and the updated current context; and a third compute unit or said first compute unit operating in a second mode including a range circuit and a next context rLPS circuit responsive to rLPS range, value and next context to obtain a next context rLPS value.

Abstract: A method and system are provided for encoding a plurality of integers with variable-length code tables constructed by combining a plurality of structured code tables. Each code table has an associated set of integer values; the sets are disjoint and exhaustive, so that every integer appears in exactly one set. An integer is encoded using the codebook associated with the set in which the integer appears.

Abstract: A demodulation table for converting variable length code (d, k; m, n; r) is provided. The variable length code has a maximum constraint length r>1, has a minimum run of d (d>0), has a maximum run of k, and a basic codeword length of n bits into data having a basic data length of m bits. The demodulation table includes: a basic table for converting code patterns composed of basic codes having a basic codeword length of n bits into data patterns composed of basic data having a basic data length of m bits; and a substitution table for converting code patterns of a plurality of different minimum run successive occurrence limiting patterns determined so as to limit successive occurrences of the minimum run to a maximum of N (N>1) times into a corresponding identical data pattern.

Abstract: A method of designing a look-up table of a finite-state encoder, applied to a finite-state encoder, comprises steps of: determining a bit length of a legal output codeword derived from the finite-state encoder and a restrict condition; collecting a plurality of legal output codeword satisfied the restrict condition; determining a bit length of an input codeword derived to the finite-state encoder according to the amount of the plurality of the legal output codeword; determining the amount of states in the finite-state encoder according to the bit length of the input codeword and the bit length of the legal output codeword; dividing the plurality of legal output codeword to a plurality of subset according to the amount of the states in the finite-state encoder and a specific mathematic equation; determining the amount of the legal output codewords in the plurality of subset; and, completing the look-up table through determining a relationship among a present state, a previous state, and a corresponding subset,

Abstract: A string matching system includes a text string, a plurality of patterns, an m-byte search window and a plurality of Bloom filters, wherein the m-byte search window stands for an m-byte sub-string in the text string under inspection. Every Bloom filter comprises sub-strings of a plurality of patterns. These Bloom filters are queried for membership of the rightmost block in the search window to determine the shift length. The acceleration efficiency of matching many bytes can be achieved simultaneously by shifting the search window for many bytes. Meanwhile, the patterns are stored into an embedded memory through a memory-efficient mechanism —the Bloom filter.

Abstract: A method for data transmission, comprises the steps of modulating data to be transmitted via a transmitter into a plurality of modulated symbols, generating a codebook comprising a plurality of codewords, selecting a codeword from the codebook as a precoding matrix by a predetermined cycling selection, precoding the modulated symbols with the preceding matrix selected, and transmitting the precoded modulated symbols.

Abstract: The present invention relates to an arithmetic decoding system and apparatus based on the adaptive content. The system includes a control unit, a decoding unit and an interface unit. The control unit fills the code stream data into the decoding unit and configures and controls the decoding unit through the interface unit. The decoding unit performs a decoding for all the syntax elements from the code stream data in the macro block, assembles the syntax elements and transmits them to the control unit. The interface unit transfers the interaction information between the decoding unit and the control unit. The present invention obtains syntax elements by the CABAC decoding through hardware so that the decoding efficiency is highly improved and the requirements for the video processing speed and the data processing capacity of the real-time and high definition applications are satisfied.

Abstract: A compressed pattern matching based on LZW compressed sequences with a simple bitmap-based realization of the Amir-Benson-Farach algorithm is provided. A suffix trie for a searched pattern is determined and a LZW trie is constructed for a compressed data. For each data chunk in the compressed data a variety of information is determined and a node is added to the LZW trie. The queries used to determine the information are implemented through bitmaps, and allowing identification of all occurrence of the searched pattern.

Abstract: A system, method and computer-readable medium for encoding and decoding digital information over a channel is provided. Type Mapping is employed and is based on the partitioning of vectors over an alphabet into “types” and using enumeration for the encoding and decoding process. Type mapping allows for signal alphabets of arbitrary size and date rate flexible coding. Tradeoffs between optimal rate versus Signal to Noise Ratio are provided and works as a compliment to the Forward Error Control that may be employed in communications products.

Abstract: A method of constructing, from a first array of entries, a second array of entries having a reduced number of entries compared with the first array is disclosed. According to one embodiment, the method comprises partitioning the first array into one or more groups of entries and then categorizing each group with a category categorizing relationships between entries of a respective group, or entries of a respective group and entries of another group. A compression code is then formed that contains a sequence of coded identifiers, each identifier identifying the category of a respective group. Finally, the second array is constructed to include selected entries from the first array. The selected entries depend on the category of each group and are arranged so as to be indexable by processing a first index into the first array and the compression code to derive a second index for retrieving an equivalent entry from the second array without decompressing the second array.

Abstract: The present invention, in particular embodiments, is directed to methods, apparatuses and systems that provide an efficient compression technique for data streams transmitted to storage devices or over networks to remote hosts. Local storage as well as network transmission of streams is made more efficient by awareness and utilization of repeated sequences of data blocks. Such data blocks can be placed in a dictionary on persistent storage and shared across all streams. The dictionary is hierarchically indexed (two or more levels of indexing) to combine high efficiency search with efficient access to the stored data blocks. Additionally, data blocks, in particular implementations, are stored sequentially in order to improve overall performance.

Abstract: An improved programmable compute system and method for executing an H.264 binary decode symbol using only a single instruction and two compute units is achieved by providing not just one rLPS value but all four next possible rLPS values of the current context next state so that there is no delay initially while calculating the correct rLPS because all four are present and any one can be chosen; further all the parameters e.g. value, range, context, and rLPS can be served by only two available 32 bit registers by generating, locally, the MSP ninth bit, of range based on the fact that the range is normalized to a known value in the MSB.

Abstract: A compute system for executing an h.264 binary decode symbol instruction including a first compute unit having a range normalization circuit and an rLPS update circuit, and operating in a first mode responsive to current rLPS, range, value and current context to generate the next normalized range and next rLPS for the current context; a second compute unit including a value update circuit, a context update circuit, and value normalization circuit responsive to current rLPS, range value and current context to obtain the output bit, normalized value and the updated current context; and a third compute unit or said first compute unit operating in a second mode including a range circuit and a next context rLPS circuit responsive to rLPS range, value and next context to obtain a next context rLPS value.

Abstract: A fixed-size codeword table is generated for decompressing GIF encoded data. The fixed-size codeword table is defined to store a codeword string and a codeword length for each of a number of codewords. The codeword string is defined by a codeword previously represented in the codeword table and a character. The codeword length represents a total number of characters in the codeword string. A current codeword in the GIF encoded data is translated according to the codeword table to generate a series of characters represented by the current codeword. The generated series of characters is stored in a computer memory space.

Abstract: A variable length code multiplexer multiplexes a plurality of input codes (102) including a variable length code into a multiplexed code (121) and outputs the multiplexed code (121). The multiplexer includes a forward direction multiplexing unit (22) for multiplexing the plurality of input codes (102) one by one so that they are running in a forward direction from a head of the multiplexed code (121) to a tail of the multiplexed code (121), a backward direction multiplexing unit (23) for multiplexing the plurality of input codes (102) one by one so that they are running in a backward direction from the tail of the multiplexed code (121) to the head of the multiplexed code (121), and a selection unit (25) for selecting either the forward direction multiplexing unit (22) or the backward direction multiplexing unit (23) for each of the plurality of input codes (102).

Abstract: Methods and devices for processing GPS signals are provided. The device includes: means for storing one or more lookup tables, each lookup table comprising a plurality of entries, each entry comprising an input segment and an output segment, wherein the output segment is a system response to the corresponding input segment; and processing means for receiving an input data sequence comprising one or more input segments, and for each of the input segments, retrieve from one of the lookup tables the output segments corresponding to the input segment, wherein the processing means is further configured to perform a time-shifted sum of one or more output segments to produce an output sequence that is a downsampled representation of the input data sequence.

Abstract: A method and device for decoding bin values using a pipeline architecture in a CABAC decoder are provided. The method includes reading a first context model required to decode a first bin value, from a memory; determining whether a second context model required to decode a second bin value is the same as the first context model, while decoding the first bin value using the first context model; determining whether a third context model required to decode a third bin value is the same as the second context model, while decoding the second bin value using the second context model, if it is determined that the second context model is the same as the first context model; and reading the second context model from the memory, if it is determined that the second context model is not the same as the first context model.

Abstract: Emulation methods are provided for two PACK instructions, one for Unicode data and the other for ASCII coded data in which processing is carried out in a block-by-block fashion as opposed to a byte-by-byte fashion as a way to provide superior performance in the face of the usual challenges facing the execution of emulated data processing machine instructions as opposed to native instructions.

Abstract: A block data compression system comprising a Compression unit and a Decompression unit, and an Algorithm for fast block data compression using multi-byte search. Objective of the invention is to develop a block data compression system and algorithm for fast block data compression with multi-byte search for optimal encoding during the learning phase of substitutional methods, allowing length-limited and relative small blocks of input data symbols to be compressed independently, as required by random-access storage or telecommunication devices; and reaching high-performance characteristics by employed accelerating architectures and highly pipelines data-flow principles.

Abstract: A network optimization device may receive a stream of data and generate a signature for a plurality of fixed length overlapping windows of the stream of data. The device may select a predetermined number of the generated signatures for each Ln-byte segment of the data stream, wherein Ln is greater than a length of each of the windows. The network device may store the selected signatures in a bucketed hash table that includes a linked-list of entries for each bucket.

Abstract: The present invention relates to a method, computer program product and system for the compression of a probability table and the reconstruction of one or more probability elements using the compressed data and method. After determining a probability table that is to be compressed, the probability table is compressed using a first probability table compression method, wherein the probability table compression method creates a first compressed probability table. The first compressed probability table contains a plurality of probability elements. Further, the probability table is compressed using a second probability table compression method, wherein the probability table compression method creates a second compressed probability table. The second compressed probability table containing a plurality of probability elements.

Abstract: Automatic test equipment (ATE) includes circuitry configured to pass a signal in a channel of the ATE, and memory configured to store a first look-up table (LUT) and a second LUT. The first LUT is configured to provide a first correction value based on a first version of the signal, where the first correction value are for use in correcting static non-linearity associated with the channel. The second LUT is configured to provide a second correction value based on a second version of the signal, where the second correction value are for use in correcting dynamic non-linearity associated with the channel. Digital signal processing logic is configured to use the first correction value, the second correction value, and the signal in order to compensate for harmonic distortion from the channel.

Abstract: An extended bitstream, and generation thereof, for dynamically configuring a decoder. Content data is obtained to be encoded. Build settings are obtained for configuring the decoder. The content data is encoded with an encoder to provide encoded data. A configuration bitstream is generated for configuring programmable logic responsive to the build settings. The configuration bitstream is combined with the encoded data to provide the extended bitstream. The extended bitstream is self-contained to allow for configuring of the programmable logic to dynamically instantiate the decoder to decode the encoded data.

Abstract: A system to be used to add non-listed characters (i.e., characters not listed in character key-in methods) to the vocabulary banks of character-key-in methods used in hand-held mobile communication devices is disclosed. Users of a mobile communication device can select a character or characters which are built in the system but not indexed by a certain character-key-in method (that is, the characters cannot be keyed in with that character-key-in method), index the aforesaid characters, using the indexing system/method of the character-key-in method, and then add them to the key-in method's character-indexing system so that subsequent users of the mobile communication device can use said character-key-in method to key in said (originally non-indexed/listed) characters.

Abstract: Devices and methods, record carrier and signal for embedding, extracting, carrying and representing secondary signal such as a copy protection signal embedded in a primary signal such as a blu ray disc signal modulated by a 17PP RMTR runlength limited modulation code. Each frame comprises a frame sync patterns followed by DC control blocks each including a DC control bit. Two modulation tables are used. Each bit of the secondary signal is represented by a relationship between the polarity of the frame sync signal and the values of the DC control bits in a fashion which complies with the constraints of the modulation code and the DC control algorithm.

Abstract: A data simplifying and merging method for a voice decoding memory system is disclosed. The method includes the steps of: reading a voice data from a non-volatile memory in a memory system; performing logic operation on the voice data in order to obtain an index; fetching corresponding decoded voice data in a table of the memory system in accordance with the index; and adding the decoded voice data to the voice data in order to obtain an original voice data.

Abstract: A method of decompressing data words of an instruction set includes: A. filling a primary dictionary with at least one primary data word of the instruction set, each of the at least one primary data word being stored in the primary dictionary in a location associated with a distinct primary dictionary index; B. filling at least one secondary dictionary with at least one difference bit stream, each of the at least one difference bit stream being stored in one of the at least one secondary dictionary in a location associated with a distinct secondary dictionary index; C. receiving a code word, the code word comprising: a. a header which identifies the primary dictionary and a specific one of the at least one secondary dictionary; b. a first bit stream; and c. a second bit stream; wherein the first bit stream comprises the distinct primary dictionary index and the second bit stream comprises the distinct secondary dictionary index; D.

Abstract: A data identification method including: a first step; a second step; a third step; and a fourth step, and the third and fourth steps being repeated until an identification result included in the table of recording modulation codes is obtained at the third step.

Abstract: A method of context adaptive binary arithmetic coding (CABAC) of a sequence of data slices permits for quick initialization of context models. The data slices include a plurality of binarized symbols with context individual values having one or more bins of the binarized symbol. The method includes resetting an addressable status register for each new data slice where the status register includes status flag for one of a plurality of available context variable values. Context models are selected for each of a plurality of context individual values and are coded according to a selected context model. A selected context model is updated for an actual context index value based on the previous context index value.

Abstract: A method for encoding an input file into an output file that is compressed so that the number of bits required to represent the output file is less than the number of bits of the input file. The encoding method includes the parsing of the input file into a series of data items, the data items having an order and collectively corresponding to the input file. The encoding method compares the series of data items against a static dictionary having at least mappings between terminal sequence pointers and representations of data items.

Abstract: Methods and devices for processing GPS signals are provided. The device includes: means for storing one or more lookup tables, each lookup table comprising a plurality of entries, each entry comprising an input segment and an output segment, wherein the output segment is a system response to the corresponding input segment; and processing means for receiving an input data sequence comprising one or more input segments, and for each of the input segments, retrieve from one of the lookup tables the output segments corresponding to the input segment, wherein the processing means is further configured to perform a time-shifted sum of one or more output segments to produce an output sequence that is a downsampled representation of the input data sequence.

Abstract: A method and apparatus for enhancing the performance of entropy coding in a multilayer-based codec system are provided. In a variable length coding method for lossless-coding first coefficients among coefficients of a discrete layer and one or more fine granular scalability (FGS) layers, the variable length coding method includes determining a proportion of zeros included in a predetermined unit region to which the first coefficients belong, selecting one of a plurality of grouping units depending on whether or not the proportion exceeds a predetermined threshold, grouping absolute values of the first coefficients using the selected grouping unit, and transforming the grouped absolute values into a code word mapped thereto by referring to a VLC table corresponding to the selected group unit.

Abstract: A telecommunications network comprises a sending entity (22) and a receiving entity (24) which communicate over a radio interface (26). The sending entity (22) comprises a compressor (40) and a message formatter (34). The compressor (40) in turn comprises a sending entity compression dictionary (60) and dictionary update decision logic (62). The compressor (40) compresses a message to obtain a compressed message to be sent over the radio interface (26) to the receiving entity (24) and also determines a compression factor for the message. The compression factor is based on similarity of the message to contents of the sending entity compression dictionary. The dictionary update decision logic (62) makes a decision whether the compression factor justifies updating of a receiving entity decompression dictionary (70). The message formatter (34) includes, in the compressed message, an update indication regarding the decision.

Abstract: A novel algorithm is shown that allows efficient generation of Variable Length Codes using a Very Large Instruction Word processor with multiple execution units. The code generation is parallelized to take advantage of the multiple execution units, significantly reducing the cycle count and the execution time.

Abstract: Methods and apparatuses for variable length encoding using a vector processing unit. In one aspect of the invention, a method for execution by a microprocessor to perform variable length encoding includes: receiving a plurality of parameters, each of the plurality of parameters corresponding to one of a plurality of symbols to be variable length encoded; generating concurrently a plurality of first codewords from the plurality of parameters to represent respectively the plurality of symbols; generating a plurality of lengths representing respectively bit lengths of the plurality of first codewords; and outputting the plurality of first codewords and the plurality of lengths; where the above operations are performed in response to the microprocessor receiving a single instruction.

Abstract: Embodiments herein provide a method and apparatus for recognition and tagging of multiple layered entropy coding system. The method comprises receiving a signal and performing entropy average coding to produce an entropy coded bit stream. Next, the method adds a tag to a beginning portion of the entropy coded bit stream. The tag comprises a plurality of headers, wherein each of the headers differs from one another, and wherein the headers comprise an elongated bit stream. Following this, the method reads the tag when processing the entropy coded bit stream and avoids subsequent entropy averaging on the entropy coded bit stream when the tag is present. The avoiding of the subsequent entropy averaging avoids unnecessary coding and entropy averaging of the entropy coded bit stream.

Abstract: A modulation table configured to convert data having a basic data length of m bits into variable length code (d, k; m, n; r) is provided. The modulation table includes a maximum constraint length r>1, a minimum run of d (d>0), a maximum run of k, and a basic codeword length of n bits. The modulation table includes: a basic table configured to convert patterns composed of data having a data length of m bits into patterns composed of codes of variable length code having a codeword length of n bits; and a substitution table configured to replace patterns composed of substitution data with patterns composed of substitution codes. The substitution table includes patterns composed of minimum run successive occurrence limiting data limiting the minimum run to a maximum of N (N>1) times and code patterns composed of substitution codes corresponding to the minimum run successive occurrence limiting data.

Abstract: Methods and systems for improved lookup table mechanism for Huffman decoding are provided and may include selecting, based on a plurality of entropy encoded bits from a received bitstream, one of a plurality of codewords that is indexed according to a specific length and that points to all entries which include the specific length. The plurality of entropy encoded bits from the received bitstream may be matched with at least one of the entries that include the specific length. The entries that include the specific length may be stored in a table in memory. A value of the plurality of entropy encoded bits may be compared with the selected one of the plurality of codewords that is indexed according to specific length. The plurality of entropy encoded bits from the received bitstream may be decoded based on the matched at least one of the entries comprising the specific length.

Abstract: A data encoding apparatus extracts valid data to be encoded from received data and encodes the data, and realigns the encoded data in units of a predetermined data width and outputs the data having each unit of the predetermined data width. A data decoding apparatus extracts valid data to be decoded from received data and realigns the decoded data in units of a predetermined data width and outputs the data having each unit of the predetermined data width.

Abstract: A compression and decompression method and apparatus comprising at least one data source providing a stream of data to at least one data destination, employing at least one pattern classifier processing the stream of data of the at least one data source into a single stream of messages and generating at least one pattern event, a message encoder and a message decoder changing an internal state in response to the at least one pattern event.