Abstract: The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.

Abstract: A system and method for securely storing and transmitting digital information includes a computing device connected to at least one of a network device or a storage device or both. The system and method also includes a communication network connected to the at least one of a network device or the at least one of a storage device, or both.

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 is generated having a first number of symbols that provide variable length codings of the words. The symbols in the first code alphabet are merged into a second number of groups of the symbols in the first code alphabet, where the second number is less than the first number. A second code alphabet is generated having the second number of symbols, wherein a second average codeword length of the codewords produced using the symbols in the second code alphabet is smaller than the codeword length (b) of the words, and wherein the second code alphabet comprises the code alphabet used by the deployed program.

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: Machines, systems and methods for compression ratio estimation are provided. The method comprises selecting a plurality of sample points in a data stream to compress sample data selected at said sample points according to a first compression method; and computing an average compression ratio contribution over the selected plurality of sample points, wherein compression ratio contribution of a sample point is determined based on the first compression method and data in locality of the sample point, and wherein the locality for the sample point is defined by locations in the data stream, such that said locations potentially affect the sample point's contribution to the compression ratio.

Abstract: A system and method for sending binary data via a short message service (SMS) over a wireless communication system. The method provides the capability to send and receive binary data to a vehicle telematics unit using a text SMS message. The binary data is converted to encoded text according to an encoding scheme supported by a wireless communication system. Then, the encoded text is sent as an SMS message over the wireless communication system. Once, the SMS message containing the encoded text is received at its destination, it is converted back to binary data.

Abstract: A data encoding apparatus for communicating between robot softwares includes a meta structure converter factory configured to allow one or more meta structure converters generated based on an information file, and if a type of user data for encoding is a structure or a structure array, select a meta structure converter, operable to convert a structure of the user data into a meta structure, from among the registered meta structure converters; an encoder factory configured to allow encoders for respective types of data to be registered, and to select an encoder from among the registered encoders in order to encode the user data to be encoded; and an encoder unit configured to encode the user data to be encoded using the meta structure generated by the selected meta structure converter and the encoder.

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: In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output.

Abstract: Discussed are a method and an apparatus of encoding/decoding by using a bit precision. In accordance to an aspect of the present invention, it is possible to encoding and decoding an image or a video by using a bit precision. Accordingly, compression efficiency can be improved and the decoding complexity can be reduced by encoding/decoding video data by use of the bit precision.

Abstract: Provided are a computer program product, system, method, and data structure for using variable length code tables to compress an input data stream to a compressed output data stream. If a number of consecutive data units in the input data stream match the number of consecutive data units in a history buffer of previously received data units in the input data stream, a copy pointer symbol is generated indicating the copy pointer symbol referencing previously received data units in the history buffer and indicating a location of a start of the consecutive data units in the history buffer. A determination is made from a variable length code table of an encoding of the number. Indication is made in the generated copy pointer symbol the determined encoding of the number and the copy pointer symbol is outputted in the compressed output data stream.

Abstract: A rebinning device includes a rebinning engine that transforms signal data from a first format to a second format with vectorized binning. Moreover, a data storage operably coupled to the rebinning engine stores the signal data in the second format. The rebinning device may optionally includes a capturing engine that captures the signal data in the first format and a rendering engine that renders the signal data in the second format.

Abstract: Method, apparatus, and systems employing dictionary-based high-bandwidth lossless compression. A pair of dictionaries having entries that are synchronized and encoded to support compression and decompression operations are implemented via logic at a compressor and decompressor. The compressor/decompressor logic operatives in a cooperative manner, including implementing the same dictionary update schemes, resulting in the data in the respective dictionaries being synchronized. The dictionaries are also configured with replaceable entries, and replacement policies are implemented based on matching bytes of data within sets of data being transferred over the link. Various schemes are disclosed for entry replacement, as well as a delayed dictionary update technique. The techniques support line-speed compression and decompression using parallel operations resulting in substantially no latency overhead.

Abstract: Methods and apparatus for coding and decoding n-state symbols with n?2 and n>2 and n>3 and n>4 are provided wherein at least one implementation of an addition over an alternate finite field GF(n) and an inverter defined by a multiplication over the alternate finite field GF(n) are provided. Encoders and decoders implementing a single n-state truth table that is a truth table of an addition over an alternate finite field GF(n) modified in accordance with at least one inverter defined by a multiplication over the alternate finite field GF(n) are also provided. Encoders include scramblers, Linear Feedback Shift Register (LFSR) based encoders, sequence generator based encoders, block coders, streaming cipher encoders, transposition encoders, hopping rule encoders, Feistel network based encoders, check symbol based encoders, Hamming coder, error correcting encoders, encipherment encoders, Elliptic Curve Coding encoders and all corresponding decoders.

Abstract: A method of operating a data compression device includes analyzing data using an analyzer and generating a result of the analysis, while the data is buffered by an input buffer, and selectively compressing the buffered data according to the result of the analysis. A data compression device includes a data pattern analyzer configured to analyze data transmitted to an input buffer, and generate an analysis code based on the analysis of the data; and a data compression manager configured to selectively compress the data in the input buffer based on the analysis code.

Abstract: In response to receiving an input string to be compressed, a plurality of diverse lossless compression techniques are applied to the input string to obtain a plurality of compressed strings. The plurality of diverse lossless compression techniques include a template-based compression technique and a non-template-based compression technique. A most compressed string among the plurality of compressed strings is selected. A determination is made regarding whether or not the most compressed string was obtained by application of the template-based compression technique. In response to determining that the most compressed string was obtained by application of the template-based compression technique, the most compressed string is compressed utilizing the non-template-based compression technique to obtain an output string and outputting the output string.

Abstract: Systems and methods for optimizing the compression of data using a dictionary coding compression system are described. A system performs an initial compression operation, such as by using a dictionary or other coder. The system then refines the compression by performing an iterative backward reference search for an optimized compressed file.

Abstract: An object of the present invention is to achieve high coding efficiency for a companded signal sequence and reduce the amount of codes. A coding method according to the present invention includes an analysis step and a signal sequence transformation step. The analysis step is to check whether or not there is a number that is included in a particular range but does not occur in a second signal sequence (a number sequence that indicates the magnitude (magnitude relationship) of original signals) and output information that indicates the number that does not occur.

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: An audio decoder has an arithmetic decoder for providing decoded spectral values on the basis of an arithmetically-encoded representation and a frequency-domain-to-time-domain converter for providing a time-domain audio representation. The arithmetic decoder selects a mapping rule describing a mapping of a code value onto a symbol code in dependence on a numeric current context value describing a current context state. The arithmetic decoder determines the numeric current context value in dependence on a plurality of previously decoded spectral values. The arithmetic decoder evaluates at least one table using an iterative interval size reduction to determine whether the numeric current context value is identical to a table context value described by an entry of the table or lies within an interval described by entries of the table, and derives a mapping rule index value describing a selected mapping table. An audio encoder also uses an iterative interval table size reduction.

Abstract: An audio decoder includes an arithmetic decoder for providing a plurality of decoded spectral values on the basis of an arithmetically encoded representation of the spectral values, and a frequency-domain-to-time-domain converter for providing a time-domain audio representation using the decoded spectral values. The arithmetic decoder selects a mapping rule describing a mapping of a code value onto a symbol code in dependence on a context state described by a numeric current context value. The arithmetic decoder determines the numeric current context value in dependence on a plurality of previously decoded spectral values. The arithmetic decoder evaluates a hash table, entries of which define both significant state values and boundaries of intervals of numeric context values, in order to select the mapping rule. A mapping rule index value is individually associated to a numeric context value being a significant state value.

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: An encoding module comprises an inverse interleaving module arranged to: determine an initial location index within an interleaving matrix for a data bit; and perform bit reverse ordering (BRO) on a column index value for the initial location index for the data bit to obtain a BRO column index value for the data bit. The inverse interleaving module is further arranged to calculate a number of valid interleaving matrix addresses preceding a location index for the data bit following bit reverse ordering; and determine a position of the data bit within the interleaved data stream based on the calculated number of valid addresses.

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: Embodiments of the present invention enable compression and decompression of data. Applications of the present invention are its use in embodiments of systems for compression and decompression of GPS long-term Ephemeris (LTE) data, although the present invention is not limited to such applications. In embodiments, the LTE data may be grouped into a set of data values associated with a parameter. In embodiments, a data set may be compressed by using a multi-order differencing scheme. In such a scheme, a set of the differences between values may be compressed because the differences have smaller magnitudes than the values. In embodiments, a multi-order differencing scheme determines how many levels (orders) of differencing may be applied to an original data set before it is compressed. In embodiments, the original data may be recovered from a compressed data set based on the type of multi-order differencing scheme used to generate the compressed data.

Abstract: A mixed lossless audio compression has application to a unified lossy and lossless audio compression scheme that combines lossy and lossless audio compression within a same audio signal. The mixed lossless compression codes a transition frame between lossy and lossless coding frames to produce seamless transitions. The mixed lossless coding performs a lapped transform and inverse lapped transform to produce an appropriately windowed and folded pseudo-time domain frame, which can then be losslessly coded. The mixed lossless coding also can be applied for frames that exhibit poor lossy compression performance.

Abstract: A method for efficiently computing a hash value for a string is disclosed. In one embodiment, such a method includes receiving an original string comprising multiple characters. The method computes an original hash value for the original string. The method produces an updated string by performing at least one of the following updates on the original string: adding leading/trailing characters to the original string; removing leading/trailing characters from the original string, and modifying characters of the original string while preserving the length of the original string. The method then computes an updated hash value for the updated string by performing at least one operation on the original hash value, wherein the at least one operation takes into account the updates that were made to the original string. A corresponding apparatus and computer program product are also disclosed.

Abstract: An embodiment of a bit converter includes a substitution module and an output module. The substitution module substitutes a decision result representing one of “0” and “1” for input bit information based on a substitution rule for bit information for converting a bit string of a predetermined pattern into a predetermined code word. The output module outputs the decision result of the bit information substituted by the substitution module, to a decoder configured to decode the decision result into the predetermined code word.

Abstract: In response to receiving an input string to be compressed, a plurality of diverse lossless compression techniques are applied to the input string to obtain a plurality of compressed strings. The plurality of diverse lossless compression techniques include a template-based compression technique and a non-template-based compression technique. A most compressed string among the plurality of compressed strings is selected. A determination is made regarding whether or not the most compressed string was obtained by application of the template-based compression technique. In response to determining that the most compressed string was obtained by application of the template-based compression technique, the most compressed string is compressed utilizing the non-template-based compression technique to obtain an output string and outputting the output string.

Abstract: According to one general aspect, a distributed threshold adjuster (DTA) may be interspersed between stages of a multistage amplifier to adjust the DC voltage of an input signal. The DTA may include an input signal terminal configured to receive the input signal. The DTA may also include a plurality of current sources configured to produce an adjustment current signal whose amperage is configured to be increased or decreased by fixed steps in order to adjust the DC voltage of the input signal. The DTA may include a control unit configured to selectively turn on or off the individual current sources of the plurality of current sources to select the amperage of the adjustment current signal. The DTA may further include an output terminal configured to produce an output signal, comprising a combination of the input signal and the adjustment current signal, to a stage of a multistage amplifier.

Abstract: A data compression architecture comprises a shift register structure comprising first and second parallel paths, each comprising several shift register elements for storing previously received data characters. Each shift register element in the first path is paired with a respective shift register element in the second path. An input shift register stores input data characters in pairs during successive clock cycles. Logic circuitry compares the input data characters with each of the previously received data characters stored in the pairs of shift register elements to detect a match during one or more clock cycles. The logic circuitry determines a length of a sequence of received input data characters by determining a number of clock cycles during which a match is detected in a particular pair of shift register elements, and applies a correction factor based on a type of match detected at a beginning and end of the sequence.

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 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 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: An encoding apparatus and method in a communication/broadcasting system are provided. When an encoding symbol is generated using at least one source symbol from among total source symbols to be encoded, encoding symbols are generated by using each of the total source symbols with a uniform probability before repeatedly using any of the total source symbols.

Abstract: A digital signal coding apparatus and method for outputting a bitstream containing coded data of a digital signal of a predetermined transmission unit is disclosed. The coding apparatus includes an arithmetic coding unit for compressing, by arithmetic coding, the digital signal of the transmission unit, multiplexing information with the bitstream as an element of header information associated with the transmission unit, the information indicating whether a data indicating a context model status to be used for arithmetic decoding of the transmission unit is multiplexed or not.

Abstract: A decoder reads an instruction for information specifying a bit sequence storage area, information indicating a first bit range, and information indicating a second bit range that is contiguous with the first bit range, then outputs a decoded signal in response to the information so read, and a bit manipulation circuit generates and outputs an output sequence based on a bit sequence stored in the bit sequence storage area by inserting uniform predetermined values between a first bit range and a second bit range in accordance with the decoded signal output from the decoder.

Abstract: Disclosed are systems and methods used in motion estimation and particularly for data compression. Embodiments of the invention may store and operate on an n-bit value in less than n bits. In one embodiment, if the multi-bit value is less than a threshold, then the multi-bit value is stored in the reduced-bit storage directly, with no loss of precision. If the multi-bit value is greater than the threshold, then the Most Significant Bits (MSBs) of the multi-bit value are shifted onto the reduced-bit storage, and a compression flag set. To decompress, if the compression flag was not set, the bits stored in the reduced-bit storage are merely copied back into the multi-bit value directly. If the compression flag was set, then the bits stored in the reduced-bit storage are shifted (left) by the same amount they were shifted (right) during compression, and an error-minimizing value is added.

Abstract: A compression system configured to compress logical data objects into one or more accommodation blocks with a predefined size, and a method of operating thereof are provided. The compression system includes a compression engine capable of compressing input data with the help of sequential encoding one or more input strings and a counter operatively coupled to the compression engine. The counter is configured to keep its ongoing value indicative of a number of input bytes in one or more strings successfully encoded into a given accommodation block; and, responsive to unsuccessful compression of a string into the given accommodation block, to provide the compression engine with information indicative of starting point in the input stream for encoding into the next accommodation block, thus giving rise to a “start indication.

Abstract: An apparatus for compressing and decompressing data is disclosed. The apparatus for compressing data includes a block setting unit that divides data of at least one original file into two or more blocks, a compression unit that generates block compression data by applying a compression algorithm to data corresponding to at least one block among blocks divided by the block setting unit, and a compression file generation unit that generates a block header and the block body of the block for each block divided by the block setting unit, in which the block body includes the block compression data if the block is compressed by the compression unit or includes the original data of the block if the block is not compressed the by compression unit.

Abstract: A method, system, and computer program product for decoding a variable length code. A decoding module is configured to receive the variable length code. The variable length code is a plurality of bits. The decoding module is also configured to identify a number of times the lead bit is repeated consecutively at the beginning of the plurality of bits. The lead bit is predetermined to be one of a 1 or 0. The decoding module is also configured to identify a code word in a table of code words by using the number of times the lead bit is repeated.

Abstract: Methods and systems are provided for encoding vehicle data comprising a first voltage pertaining to a first battery cell and a second voltage pertaining to a second battery cell is provided. A determination is made as to whether the first voltage is valid. In addition, a determination is made as to whether the second voltage is valid. One of a plurality of values is assigned to a validity measure based at least in part on whether the first voltage or the second voltage, or both, are valid. The plurality of values, in binary form, are at least two bit errors removed from one another.

Abstract: A compression system configured to compress logical data objects into one or more accommodation blocks with a predefined size, and a method of operating thereof are provided. The compression system includes a compression engine capable of compressing input data with the help of sequential encoding one or more input strings and a counter operatively coupled to the compression engine. The counter is configured to keep its ongoing value indicative of a number of input bytes in one or more strings successfully encoded into a given accommodation block; and, responsive to unsuccessful compression of a string into the given accommodation block, to provide the compression engine with information indicative of starting point in the input stream for encoding into the next accommodation block, thus giving rise to a “start indication.

Abstract: A system utilizing a lossless coding technique for CABAC in HEVC is described. The system includes a first and second electronic device. The first electronic device encodes according to a lossless coding technique for CABAC in HEVC. The second electronic device decodes according to a lossless coding technique for CABAC in HEVC.

Abstract: A device for compressing a feature descriptor includes a non-uniform quantizer and a run-length encoder. The non-uniform quantizer accesses a source feature descriptor from a storage device, and non-uniformly quantizes the source feature descriptor having source vectors into an intermediate feature descriptor having intermediate vectors according to a vector default value. The run-length encoder executes run-length coding for the intermediate feature descriptor to generate a compressed feature descriptor.

Abstract: During operation of an encoder, a signal vector (x) is received. A first multi-precision operand (??k) will be generated based on the signal vector to be encoded. A mantissa operand and an exponent operand are generated. Both the mantissa operand and the exponent operand are representative of a second multi-precision operand that is based on the signal vector to be encoded. A portion of ??k is selected to be modified based on the exponent operand. A part of ??k is modified based on the mantissa operand to produce a modified multi-precision operand (??k+1). Finally, a multi-precision codeword is generated for use in a corresponding decoder.

Abstract: A method comprising receiving a syntax element to be encoded as a code word of a set of code words, determining a mapping between the syntax element and the code word on the basis of a hierarchy level in a tree structure, using the mapping to obtain the code word, and updating the mapping is disclosed.

Abstract: Example systems and methods concern a sub-block parser that is configured with a variable sized window whose size varies as a function of the actual or expected entropy of data to be parsed by the sub-block parser. Example systems and methods also concern a sub-block parser configured to compress a data sequence to be parsed before parsing the data sequence. One example method facilitates either actually changing the window size or effectively changing the window size by manipulating the data before it is parsed. The example method includes selectively reconfiguring a data set to be parsed by a data-dependent parser based, at least in part, on the entropy level of the data set, selectively reconfiguring the data-dependent parser, based, at least in part, on the entropy level of the data set, and parsing the data set.