Abstract: The present invention is directed to an image information encoding apparatus adapted for performing intra-image encoding based on resolution of color components and color space of an input image signal. An intra prediction unit serves to adaptively change block size in generating a prediction image based on a chroma format signal indicating whether resolution of color components is one of 4:2:0 format, 4:2:2 format, and 4:4:4 format, and a color space signal indicating whether color space is one of YCbCr, RGB, and XYZ. An inverse orthogonal transform unit and an inverse quantization unit serve to also change orthogonal transform technique and quantization technique in accordance with the chroma format signal and the color space signal. An encoding unit encodes the chroma format signal and the color space signal to generate a prediction image corresponding to the chroma format signal and the color space signal.

Abstract: A recording medium stores an information processing program that causes a computer to execute storing a compression symbol map group having a bit string indicating for each character code, presence or absence of the character code in a file group, and a Huffman tree whose leaf corresponding to the character code has a pointer to a compression symbol map of the character code, the Huffman tree converting the character code into a compression symbol of the character code; compressing sequentially and according to the Huffman tree, a character code to be compressed and described in a file of the file group; detecting access to the leaf at the compressing; identifying by a pointer in the accessed leaf, a compression symbol map of the character code to be compressed; and updating a bit that indicates presence or absence of the character code to be compressed, in the identified compression symbol map.

Abstract: Method and system for partially cloning a data container with compression is provided. A storage operating system determines if a portion of a source data container that is to be cloned includes a plurality of compressed blocks that are compressed using a non-variable compression group size. The operating system clones the plurality compressed blocks with the non-variable compression group size and de-compresses a plurality of blocks of the data container that are not within the non-variable compression group size. The plurality of compressed blocks and the plurality of blocks that are not within the non-variable compression group size are then stored as a partially cloned copy of the source data container.

Abstract: A system and method for low-power digital signal processing, for example, comprising adjusting a digital representation of an input signal.

Abstract: 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.

Abstract: Disclosed is a method to convert a Unicode character. The method includes intercepting a service call for a character conversion, determining if a character associated with the service call is a candidate for a first conversion service, if the character is a candidate for the first conversion service, converting the character using the first conversion service, if the character is not a candidate for the first conversion service, converting the character using a second conversion service, and returning the converted character.

Abstract: Aspects of the invention are provided for decoding a selected span of data within a compressed code stream. A selection of data within the compressed code stream from an arbitrary position is presented for decompression. The arbitrary position is the starting point in the compressed code stream for decompression, and a phrase within the compressed code stream containing the starting point is identified. From the arbitrary starting point, a back pointer may provide direction to the literal. The literal is extracted as a decoding of the compressed data associated with the starting point.

Abstract: Mechanisms are provided for decoding a variable length encoded data stream. A decoder of a data processing system receives an input line of data. The input line of data is a portion of the variable length encoded data stream. The decoder determines an amount of bit spill over of the input line of data onto a next input line of data. The decoder aligns the input line of data to begin at a symbol boundary based on the determined amount of bit spill over. The decoder tokenizes the aligned input line of data to generate a set of tokens. Each token corresponds to an encoded symbol in the aligned next input line of data. The decoder generates an output word of data based on the set of tokens. The output word of data corresponds to a word of data in the original set of data.

Abstract: A de-mapping circuit for de-mapping input words of a first length into output words of a second length different from the first length. In one embodiment, the circuit includes a word register of the first length and temporary registers of the second length. The word register successively stores each of the inputs words in response to cycles of a clock. The temporary registers temporarily store the output words. Multiplexers configured by address signals select bits from stored input words and store the selected bits into the temporary registers to form temporarily stored output words.

Abstract: A finite sequence of code values is formed, and can be used for example in communications or remote sensing. A code value in said finite sequence of code values has a validity period specific to that code value. There are code values of different validity periods in said finite sequence of code values. Each of said validity periods is longer than or equal to a predetermined minimum baud length.

Abstract: Mechanisms are provided for decoding a variable length encoded data stream. A decoder of a data processing system receives an input line of data. The input line of data is a portion of the variable length encoded data stream. The decoder determines an amount of bit spill over of the input line of data onto a next input line of data. The decoder aligns the input line of data to begin at a symbol boundary based on the determined amount of bit spill over. The decoder tokenizes the aligned input line of data to generate a set of tokens. Each token corresponds to an encoded symbol in the aligned next input line of data. The decoder generates an output word of data based on the set of tokens. The output word of data corresponds to a word of data in the original set of data.

Abstract: A hybrid mechanism whereby hardware acceleration is combined with software such that the compression rate achieved is significantly increased while maintaining the original compression ratio (e.g., using full DHT and not SHT or an approximation). The compression acceleration mechanism is applicable to a hardware accelerator tightly coupled with the general purpose processor. The compression task is divided and parallelized between hardware and software wherein each compression task is split into two acceleration requests: a first request that performs SHT encoding using hardware acceleration and provides post-LZ frequency statistics; and a second request that performs SHT decoding and DHT encoding using the DHT generated in software.

Abstract: An apparatus to provide a fall-back procedure for a PRC imaging device is described. The apparatus includes a PRC controller, a system resource monitor, and a PRC setting calculator. The PRC controller outputs a stream of images at an adjustable temporal rate. The adjustable temporal rate is constrained within a range defined by a first predetermined rate and a second predetermined rate. The system resource monitor obtains a measurement of system resource utilization. The PRC setting calculator determines a setting for the PRC controller in response to the measurement of system resource utilization. Additionally, the PRC controller determines a value for the adjustable temporal rate in response to the setting.

Abstract: Data compression using a combination, of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises: determining whether or not a parameter or attribute of data within a data block is identified for the data block wherein the determining is not based solely on a descriptor that is indicative of the parameter or attribute of the data within the data block; and compressing the data block with at least one encoder associated with the parameter or attribute of the data within the data block to provide a compressed data block.

Abstract: A parallel test payload includes a bit sequence configured to be segmented into a plurality of sub-sequences having variable bit length carriers. Respective carriers are represented uniformly in each one of the plurality of sub-sequences.

Abstract: An encoder for encoding a sequence of symbols is described which has an assigner configured to assign a number of parameters to each symbol of the sequence of symbols based on information contained within previous symbols of the sequence of symbols; a plurality of entropy encoders each of which is configured to convert the symbols forwarded to the respective entropy encoder into a respective bitstream; and a selector configured to forward each symbol to a selected one of the plurality of entropy encoders, the selection depending on the number of parameters assigned to the respective symbol.

Abstract: Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories and compression history indexes across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Abstract: A method for data transmission from a programming device to a control unit, the data being compressed by Huffman coding and transmitted with a Huffman coding tree for decoding from the programming device to the control unit, are decompressed and stored in the control unit, by performing, for a predetermined number of data words of N-bits, a first Huffman coding with a first coding tree; performing, for the remaining data words consisting of M-bits, a second Huffman coding with a second coding tree, N greater than M, the predetermined number of data words of N-bits and the remaining data words of M-bits consisting of more than two data words, generating coding trees for the N-bit and the M-bit data words, and transmitting them to the control unit, and providing all coded N-bit data words and N/M of successive M-bit data words with a preceding code bit.

Abstract: An information handling system includes a multi-core processor that processes variable-length code (VLC) bitstream data. The bitstream data includes multiple codewords that the processor organizes into functionally common subsets. The processor includes a general purpose processor (GPU) and one or more special purpose processor (SPUs). An SPU of the processor may includes two SPU buffers. The processor first transfers bitstream data into GPU buffer memory and then populates the SPU buffers one after another with bitstream data. The SPU buffers may each include an overlap region that the SPU populates with the same bitstream data. The SPU parses the bitstream data in the SPU buffers in alternating fashion. The SPU may shift parsing from the one SPU buffer to the other SPU buffer when parsing reaches a subset boundary within an overlap region.

Abstract: A system and method combine an entropy coding algorithm like Huffman or arithmetic coding with a fixed length coding scheme and can improve the compression performance in a fixed rate compression scheme. The fixed length code assigns codes with a fixed length to symbols that have the highest probability of occurrence. Therefore, fixed length coding is used if all symbols in the sequence are from the set of symbols that have the highest probability values. Otherwise an entropy coding algorithm (e.g. Huffman coding) is used to encode quantized symbols.

Abstract: According to an embodiment, a decoding apparatus includes a clipping unit and a decoding unit. The clipping unit is configured to clip pieces of encoded data each having a predetermined first code length from input data encoded with variable-length encoding. The predetermined first code length is greater than or equal to a maximum code length among a plurality of pieces of encoded data included in the input data. The decoding unit is configured to decode the clipped piece of encoded data by using variable-length decoding.

Abstract: An entropy decoding apparatus may include a data structure stored in memory. The data structure may include a decoding engine vector or context engine vector. The decoding engine vector many have a first set of bits representing a value corresponding to a state of a coding engine, a second set of bits representing an offset value, and a third set of bits representing the contents of an input stream buffer. The context vector may have a first set of bits representing an addresses of a context most probable state, a second set of bits representing a plurality of possible values corresponding to a least probable symbol state of a coding engine, a third set of bits representing an addresses of a context least probable state, a fourth set of bits representing a binary most probable symbol value, and a fifth set of bits representing a binary least probable symbol value.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: A signal processing method for a single wire, includes receiving an input signal via the single wire, wherein the input signal includes a plurality of pulse signals; generating a plurality of bits corresponding to the plurality of pulse signals according to a plurality of widths of the plurality of pulse signals and forming a source code; and decoding the source code to generate a control code; wherein when a width of a first pulse signal of the plurality of pulse signals is smaller than a first duration, a first bit corresponding to the first pulse signal is a first bit value and when a width of a second pulse signal of the plurality of pulse signals is greater than a second duration, a second bit corresponding to the second pulse signal is a second bit value.

Abstract: A method for determining a parity check matrix utilized in a flash memory system is disclosed. The parity check matrix comprises M×N blocks. The method includes generating a first set of candidate blocks as candidates of a first set of blocks of the M×N blocks; calculating a plurality of first estimated results corresponding to the first set of candidate blocks; determining content of a first block of the M×N blocks according to a best result of the first estimated results; generating a second set of candidate blocks as candidates of a second set of blocks of the M×N blocks; calculating a plurality of second estimated results corresponding to the second set of candidate blocks by considering the content of the first block; determining content a second block of the M×N blocks according to the second estimated results.

Abstract: A method for motion estimation with respect to a sequence of images. Respective updates are generated based on predictor vectors. The updates are distributed over a plurality of tables, which are organized in a plurality of table sets. Only a single table of updates, of a respective selected table set, is applied to a given predictor vector to generate a limited set of candidate vectors only. For a subsequent predictor vector, a further single table of the plurality of tables out of the plurality of table sets is applied.

Abstract: Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: A mechanism is provided in a data processing system for pipelined compression of multi-byte frames. The mechanism combines a current cycle of data in an input data stream with at least a portion of a next cycle of data in the input data stream to form a frame of data. The mechanism identifies a plurality of matches in a plurality of dictionary memories. Each match matches a portion of a given substring in the frame of data. The mechanism identifies a subset of matches from the plurality of matches that provides a best coverage of the current cycle of data. The mechanism encodes the frame of data into an encoded output data stream.

Abstract: A video transmission method is provided, which includes receiving state information from at least one mobile terminal that intends to perform a video stream service through a wireless network, determining a size of an image by selecting a specified spatial layer bit stream on the basis of the state information of the mobile terminal from a plurality of spatial layer bit streams generated at different bit rates during encoding of the bit stream, selecting a specified time and an SNR layer bit stream by increasing or decreasing time of the image and a layer position of the SNR layer bit stream on the basis of network parameters included in the state information of the mobile terminal, and transmitting the bit stream generated by extracting the specified layer bit stream of the selected layer to the mobile terminal.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: A method and a device for arithmetic code package outputting. The method comprises: acquiring the 7-bit output string of the upper bits according to the CodLow value, i.e., the starting position of the probability space to be updated, and using the 7-bit ID string to identify the output characters with undetermined state in the 7-bit output string; acquiring the number of valid bits according to the CodRange value, i.e., the length of the probability space to be updated, wherein the number of valid bits indicates the number of valid bits of output characters in the 7-bit output string according to the CodLow value to be updated; extracting the valid output characters in the 7-bit output string according to the number of valid bits, identifying the output characters with undetermined state among the extracted valid output characters according to the 7-bit ID string; and processing the extracted valid output characters, acquiring and outputting the coding output bytes.

Abstract: The present invention is directed to an image information decoding apparatus adapted for performing intra-image decoding based on resolution of color components and color space of an input image signal. An intra prediction unit serves to adaptively change block size in generating a prediction image based on a chroma format signal indicating whether resolution of color components is one of 4:2:0 format, 4:2:2 format, and 4:4:4 format, and a color space signal indicating whether color space is one of YCbCr, RGB, and XYZ. An inverse orthogonal transform unit and an inverse quantization unit serve to also change orthogonal transform technique and quantization technique in accordance with the chroma format signal and the color space signal. A decoding unit decodes the chroma format signal and the color space signal to generate a prediction image corresponding to the chroma format signal and the color space signal.

Abstract: The present invention is directed to an image information encoding apparatus adapted for performing intra-image encoding based on resolution of color components and color space of an input image signal. An intra prediction unit serves to adaptively change block size in generating a prediction image based on a chroma format signal indicating whether resolution of color components is one of 4:2:0 format, 4:2:2 format, and 4:4:4 format, and a color space signal indicating whether color space is one of YCbCr, RGB, and XYZ. An inverse orthogonal transform unit and an inverse quantization unit serve to also change orthogonal transform technique and quantization technique in accordance with the chroma format signal and the color space signal. An encoding unit encodes the chroma format signal and the color space signal to generate a prediction image corresponding to the chroma format signal and the color space signal.

Abstract: A decoding apparatus and method store at least one table including at least one code, receive at least one instruction signal, and extract a symbol value and a symbol length from the at least one table based on the at least one instruction signal. The decoding apparatus calculates a target suffix length that minimizes the size of a generated table and minimizes the size of a non-prefix length of the at least one code.

Abstract: A method for arithmetic coding of symbols in a stream is described. The method comprises the following steps: coding a current symbol with a current probability model, and updating the current probability model according to the coding of the current symbol. selecting the current probability model in a set of at least two probability models according to a coding cost criterion, and coding an identifier of the selected probability model.

Abstract: A method for generating occurrence data of data values for enabling encoding of a data set includes determining occurrences of data values in a first data batch and determining occurrence count information for a first number of most frequent data values in the first data batch, the occurrence count information identifying the most frequent data values and their occurrence counts. The method also includes generating for rest of the data values in the first data batch at least a first histogram having a second number of buckets and merging the occurrence count information of the first data batch with occurrence count information of a second data batch. The method further includes merging the first histogram of the first data batch to a merged histogram corresponding to the second data batch and processing a next data batch as a first data batch until the data set to be encoded is processed.

Abstract: Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.

Abstract: A method for encoding an input sequence of symbols as a plurality of codewords including primary codewords and secondary codewords, and a method of decoding the plurality of codewords. The codewords are output as a bitstream including an associated codeword type indicator, which specifies whether its associated plurality of consecutive codewords includes at least one secondary codeword and, if so, the location of the first of the at least one secondary codewords. The decoder selects between a primary codeword decoding tree and a secondary codeword decoding tree, and decodes one of the plurality of codewords using the selected decoding tree.

Abstract: 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.

Abstract: A method for encoding an input sequence of symbols to produce a bitstream and a method of decoding the bitstream to generate a reconstructed binary sequence. Encoding employs an encoding tree having primary codewords associated with leaf nodes and secondary codewords associated with internal nodes. A flush event may cause output of secondary codewords. A context model is used to select an encoding tree corresponding to an estimated probability at the encoder. The same context model is used by the decoder to select a decoding tree. The decoder interleaves bits from decoded bit sequences associated with different estimated probabilities based on the context model.

Abstract: Methods and apparatus for compressing data for network transport in support of continuous availability of applications are described. One computer-implemented method of compressing data includes receiving a current instance of data in an input buffer. A candidate chunk of data is selected from the input buffer. A signature hash is computed from a signature length range of data within the candidate chunk. A matching dictionary entry having a matching signature hash from a multi-tiered dictionary is identified. The matching dictionary entry prospectively identifies a location of a prior occurrence of a selected range of consecutive symbols including the signature length range of data within at least one of the current instance of data and a prior instance of data in the input buffer. A dedupe processed representation of the instance of data is formed wherein a dedupe item is substituted for the selected range of consecutive symbols if the selected range is verified as recurring.

Abstract: A size comparison unit reports, to an access control unit, the size of a piece of compressed data having the smallest size from among pieces of compressed data generated via compression processing units compressing blocks, an algorithm name representing a compression processing unit that has generated the piece of compressed data having the smallest size; the access control unit selects a piece of compressed data to be written in a tape medium and reports, to a statistical information processing unit, an algorithm name representing a compression processing unit that has generated this selected piece of compressed data; the statistical information processing unit extracts, from the reported algorithm name, a regularity present in a result of the selection of compressed data and, in accordance with this extracted regularity, specifies and stops a compression processing unit to be stopped.

Abstract: A system and method that process encoded data, wherein the encoded data is an encoded video stream. The encoded data may be buffered and the characteristics of the buffered encoded data may be determined and used to select a decoding table from a plurality of decoding tables. An encoded word may then be decoded using the selected decoding table. The output of the decoding table may be the corresponding decoded word and the size of the encoded word. The size of the encoded word may be utilized to shift the buffered encoded data. The decoded word may be sent to the appropriate portion of the system.

Abstract: Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet has a first number of symbols that provide variable length codings of the words. A second code alphabet is generated having a second number of symbols formed by merging the symbols in the first code alphabet, wherein the second code alphabet comprises the code alphabet used by the deployed program.

Abstract: A method for delivering media content over a network includes transcoding the media content to generate multiple copies of the media content, each of the multiple copies having a different destination type or a different source type or both, storing the multiple copies in a cache, receiving requests for the media content, and selecting and delivering a copy of one of the multiple copies in response to each of the requests. A further method for providing media content transcoding services includes fetching media content, selecting one of multiple transcoders for transcoding from multiple source types to multiple destination types, wherein the one transcoder is selected based at least on the destination type, sending the media content to the selected transcoder, transcoding the media content to the destination type, thereby generating transcoded media content, and transmitting the transcoded media content.

Abstract: A system and method of selecting a predefined Huffman dictionary from a bank of dictionaries. The dictionary selection mechanism of the present invention effectively breaks the built-in tradeoff between compression ratio and compression rate for both hardware and software compression implementations. A mechanism is provided for automatically creating a predefined Huffman dictionary for a set of input files. The dictionary selection mechanism achieves high compression rate and ratio leveraging predefined Huffman dictionaries and provides a mechanism for dynamically speculating which predefined dictionary to select per input data block, thereby achieving close to a dynamic Huffman ratio at a static Huffman rate. In addition, a feedback loop is used to monitor the ongoing performance of the preset currently selected for use by the hardware accelerator. If the current preset is not optimal it is replaced with an optimal preset.

Abstract: A method for assigning codes to Huffman trees and repairing invalid Huffman trees is disclosed using a calculated delta and moving nodes within the Huffman tree by adjusting their encode register entries.

Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients which are obtained by quantizing frequency components of an image signal to a variable length coding process by using a run value Run that indicates the number of successive zero coefficients and a level value Lev that indicates a value of a non-zero coefficient following the zero coefficients. The run-length encoding unit RLE1 includes a reordering unit Lreodr for reordering level values Lev; a variable length coder LVLC for coding reordered level values ROLev by using a code table that is selected according to the value of a quantization parameter QP; a reordering unit Rreodr for reordering run values Run from high frequency component of the quantized coefficients to low frequency component; and a variable length coder RVLC for coding reordered run values RORun by using a code table that is selected according to the number of already-processed run values.

Abstract: This disclosure describes techniques for coding an enhancement layer in a scalable video coding (SVC) scheme. The techniques involve run-length coding of significant coefficients and refinement coefficients of the enhancement layer. Rather than performing two different run-length passes to separately code the significant coefficients and refinement coefficients, the techniques of this disclosure perform run-length coding of the significant coefficients and refinement coefficients together. Therefore, run values of the run-length coding codes the significant coefficients with the refinement coefficients. Additional techniques are also described, which can eliminate the need to send sign information for some of the refinement coefficients. Instead, this sign information for some of the refinement coefficients may be derived at the decoder based on the sign values of corresponding coefficients of previously encoded layers of the SVC scheme, which can further improve compression efficiency.