| Entries |
| Document | Title | Date |
|---|
| 20080224902 | SYSTEMS AND METHODS OF USING APPLICATION AND PROTOCOL SPECIFIC PARSING FOR COMPRESSION - 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, compression history indexes and caches 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. | 09-18-2008 |
| 20080224903 | SYSTEMS AND METHODS FOR SHARING COMPRESSION HISTORIES BETWEEN MULTIPLE DEVICES - 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. | 09-18-2008 |
| 20080231480 | Distributed on-demand media transcoding system and method - 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. | 09-25-2008 |
| 20080246636 | OPTIMIZED DECOMPRESSION USING ANNOTATED BACK BUFFER - A system and method for decompression optimization employing a data input and a dedicated back buffer and data parser. The system and method also relate to accelerating the parsing process during decompression of a block of data by taking advantage of those naturally occurring redundancies within the block of data identified at compression time. The system of the invention includes a parser and an annotated back buffer which operate collectively to optimize the parsing process during decompression. | 10-09-2008 |
| 20080246637 | Cabac Decoding Method - A decoding method of CABAC is proposed. A CABAC decoder comprises an arithmetic engine performing two arithmetic decodings for a coefficient or reading contexts at the same time in a clock cycle. The arithmetic decoding for a coefficient comprises the steps of: (1) providing a residual block comprising Significant_flags, Last_significant_flags, coefficients and the corresponding contexts; (2) sequentially resolving the Significant_flag and the Last_significant_flag of a non-zero coefficient; and (3) decoding the non-zero coefficient to obtain regular bins and bypass bins, wherein the arithmetic decoding is conducted twice in a clock cycle. | 10-09-2008 |
| 20080266146 | METHOD AND SYSTEM FOR GENERATING HIGH DEFINITION MULTIMEDIA INTERFACE (HDMI) CODEWORDS USING A TMDS ENCODER/DECODER - Systems and methods for processing information are disclosed. The method may include creating a first symbol from a codeword. One or more of a TERC4 symbol, a TMDS symbol and/or a guard band symbol may be generated from at least a portion of the first symbol, if the one or more of the TERC4 symbol, the TMDS symbol and/or the guard band symbol is at least a portion of a signal to be transmitted. At least a portion of the codeword may be TMDS encoded to generate a TMDS symbol for the at least a portion of the signal to be transmitted. At least a portion of the first symbol may be TMDS encoded to generate a TERC4 symbol for the at least a portion of the signal to be transmitted and/or to generate a guard band symbol for the at least a portion of the signal to be transmitted. | 10-30-2008 |
| 20080284623 | LOSSLESS AUDIO CODING/DECODING APPARATUS AND METHOD - Provided are a lossless audio coding/decoding apparatus and method. The lossless audio coding apparatus includes a first coder to directly code first symbols; a second coder module comprising a plurality of second coders to convert the first symbols into second symbols and to code the second symbols; a first selector to compare the performance of the first coder to the performance of the second coders and to output a coding mode in accordance with a comparison result; and a second selector to output a final bitstream by coding the first symbols in correspondence with the coding mode. According to the present invention, the performance of audio coding may be improved. | 11-20-2008 |
| 20080291062 | IMAGE CODING APPARATUS AND METHOD THEREOF - An image coding apparatus includes a variable length coding section, an arithmetic coding section and a common buffer memory. The variable length coding section inputs image data and outputs a binarized code sequence applied with variable length coding. The arithmetic coding section applies arithmetic coding to the binarized code sequence outputted from the variable length coding section. The common buffer memory transmits and receives data between the variable length coding section and the arithmetic coding section. | 11-27-2008 |
| 20080297381 | METHODS OF USING PREDICTIVE ANALOG TO DIGITAL CONVERTERS - Methods and devices are disclosed for performing analog to digital signal conversion in shorter time and/or with less power consumption than that of a comparable analog to digital conversion that uses a conventional sequential approximation method based on a binary search. In one embodiment, a predictive guess is supplied as a digital first signal. The digital first signal is converted (D/A) to a counterpart, analog guess signal. A comparison is made between the analog guess signal and a received, analog input sample signal. The result of the comparison is used to improve on the initially supplied guess in a next cycle. Fewer cycles and less power is consumed if the initial guess is within a certain range of the actual magnitude of the analog input sample signal. In one embodiment, a digital modeler is used to model a process underlying the analog input sample signal and to thereby provide fairly good guesses. | 12-04-2008 |
| 20080316069 | Maximum Likelihood Decoding via Mixed-Integer Adaptive Linear Programming - A method and system decodes a sequence of symbols received via a channel to a codeword of an error-correcting code. Log-likelihood ratios are determined from a sequence of symbols received via a channel. A set of constraints is initialized according to the log-likelihood ratios. An adaptive linear programming decoder is applied to the set of constraints and the log-likelihood ratios according to an error-correcting code to produce an estimate of the codeword and an updated set of constraints. If the estimate of the codeword is a non-integer pseudo codeword, further update the set of updated constraints with a set of integer constraints if the estimate of the codeword is the non-integer pseudo codeword, and proceeding with the applying step, and otherwise producing the estimate of the codeword as the final codeword. | 12-25-2008 |
| 20090002207 | Information Compression/Encoding Device, Its Decoding Device, Method Thereof, Program Thereof, and Recording Medium Containing the Program - The present invention aims to improve the compression ratio of an encoding method using a dictionary for such as LZ77, LZ78 or LZW for a sample string of an audio signal or an image signal. According to the present invention, the samples are aligned from the MSB side ( | 01-01-2009 |
| 20090015441 | DATA COMPRESSION FOR COMMUNICATION BETWEEN TWO OR MORE COMPONENTS IN A SYSTEM - 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. | 01-15-2009 |
| 20090015442 | DATA CODING BUFFER FOR ELECTRICAL COMPUTERS AND DIGITAL DATA PROCESSING SYSTEMS - Embodiments described herein may include example embodiments of a method, article and/or apparatus for buffering coded data 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 communication between computing platforms via a network or other interconnection medium. | 01-15-2009 |
| 20090033524 | Adaptive transport format uplink signaling for data-non-associated feedback control signals - One or more dynamically selected signaling bits are added in a downlink from a base station to user equipment (UE) so that the UE can use an adaptive “symbol space” for uplink feedback (CQI/HARQ) signaling and know from the extra added downlink signaling bits and the MCS currently signaled in parallel how big a symbol space to use at the moment for the uplink feedback. | 02-05-2009 |
| 20090040080 | System and method for encoding a data set - An encoding system for a data set, particularly for a video data set is disclosed in the present invention. The encoding system includes a coding strategies represented as a tree-based structure, a cost projection system for each tree node, and a parameter searching algorithm for coding strategies to encode a data set. When the encoder parameters are obtained, the coding strategies and rate-allocation have better performance comparing to the related art. | 02-12-2009 |
| 20090058691 | CODING APPARATUS, CODING METHOD, PROGRAM FOR EXECUTING THE METHOD, AND RECORDING MEDIUM STORING THE PROGRAM - A coding apparatus that codes video data using an arithmetic coding scheme such as the AVC standard includes an orthogonal transformation unit, a quantizer, an arithmetic coder, and a controller. The arithmetic coder includes a binarization unit, a binary arithmetic coder, and a code length predictor. The code length predictor outputs a predicted number of bits by evaluating a predictive function using, as the argument of the function, the bin size of the binary symbols generated from input data during coding. The controller controls the coding bit rate by changing the quantization scale of the quantizer on the basis of the predicted number of bits. The predictive function is defined such that the predicted number of bits increases as the bin size increases, and furthermore such that the polynomial degree of the function changes when the bin size exceeds a predefined threshold value. | 03-05-2009 |
| 20090066544 | INFORMATION PROCESSING APPARATUS AND INFORMATION PROCESSING SYSTEM - For providing a user a plural number of trans-coding services with using a plural number of trans-coding services, at high speed, within a home network environment, an information processing apparatus is provided with a function of providing a list of formats, on which format conversion can be made, to a home server, and a function of managing the format conversion processes with using process identifiers, which are shared in common with the server and the information processing apparatus, each of the process identifiers being tied with information of a format conversion method, wherein the format conversion is executed upon a part of contents divided within the home server, following the process identifier designated by the home server, to grasp performances of the information processing apparatuses by measuring throughput per a unit time in the format conversion, and an adjustment is made on an amount of data to be transferred from the home server to the information processing apparatus in the next time, thereby enabling high speed processing of the format conversions. | 03-12-2009 |
| 20090066545 | APPARATUS AND METHOD FOR GENERATING A LINEAR CODE - An apparatus for generating a linear code according to the present invention includes a coding unit for coding input bits with a second coding scheme which is different from a first coding scheme for generating the linear code; and a rearrangement unit for generating the linear code by rearranging the bits coded with the second coding scheme. The present invention can provide a coding apparatus and method capable of reducing complexity by adaptively applying it to various coding scheme. | 03-12-2009 |
| 20090073005 | COMPLEXITY-AWARE ENCODING - Techniques for encoding data based at least in part upon an awareness of the decoding complexity of the encoded data and the ability of a target decoder to decode the encoded data are disclosed. In some embodiments, a set of data is encoded based at least in part upon a state of a target decoder to which the encoded set of data is to be provided. In some embodiments, a set of data is encoded based at least in part upon the states of multiple decoders to which the encoded set of data is to be provided. | 03-19-2009 |
| 20090079597 | CONTENT-BASED SEGMENTATION SCHEME FOR DATA COMPRESSION IN STORAGE AND TRANSMISSION INCLUDING HIERARCHICAL SEGMENT REPRESENTATION - In a coding system, input data within a system is encoded. The input data might include sequences of symbols that repeat in the input data or occur in other input data encoded in the system. The encoding includes determining a target segment size, determining a window size, identifying a fingerprint within a window of symbols at an offset in the input data, determining whether the offset is to be designated as a cut point and segmenting the input data as indicated by the set of cut points. For each segment so identified, the encoder determines whether the segment is to be a referenced segment or an unreferenced segment, replacing the segment data of each referenced segment with a reference label and storing a reference binding in a persistent segment store for each referenced segment, if needed. Hierarchically, the process can be repeated by grouping references into groups, replacing the grouped references with a group label, storing a binding between the grouped references and group label, if one is not already present, and repeating the process. The number of levels of hierarchy can be fixed in advanced or it can be determined from the content encoded. | 03-26-2009 |
| 20090096642 | Entropy Codec with Variable Divisor - Data values are encoded for transmission to a recipient on a communication channel. Performance information associated with the encoding or the communication channel is obtained and used at least in part to determine quantization factors used in the encoding. The data values can be scaled based on the quantization factors and ordered based on a probability factor. A portion of the data values can be selected based on content. A code table can be selected based on a variation of the data values, where the code table specifies codewords including at least one of bits representative of a divisor, bits representative of a remainder, and a bit representative of a sign. Codewords can be generated for the data values using the code table. The encoded data values can be transmitted to a recipient where the data values are decoded using a decoder. | 04-16-2009 |
| 20090096643 | System and Method for Context-Based Adaptive Binary Arithematic Encoding and Decoding - A system is disclosed for context-based adaptive binary arithmetic encoding and decoding. The system comprises a calculating device configured to calculate an index value for one of a first bin to be encoded and a second bin to be decoded, a memory device to store context models in cluster, wherein the index value for one of the first bin and the second bin is related to one of the context models, and a binary arithmetic unit configured to serve as one of an encoder for encoding the first bin based on the one context model and a decoder for decoding the second bin based on the one context model. | 04-16-2009 |
| 20090121906 | ALTERNATIVE ENCODING FOR LZSS OUTPUT - A data processing method where a source bit stream is manipulated to produce four intermediate streams: flag bits, literals, offsets and lengths. Flag bits are grouped into multi-bit units, and an output stream containing flag units, literals, offsets and lengths is emitted. The output stream occupies fewer bits than the source bit stream, but encodes all the data of the source bit stream. | 05-14-2009 |
| 20090140892 | String Reconstruction Using Multiple Strings - Disclosed are systems and methods for reconstructing a string comprising characters given multiple strings that may contain one or more errors. In embodiments, pairwise comparisons of strings within a set of candidate strings that may contain errors is performed so that measures related to similarity between the strings in each pair may be calculated. In embodiments, an alignment and voting method using at least some of the similarity measures may be employed to generate a reconstructed string. In embodiments, the reconstructed string may be validated, and in embodiments, its characters may be converted to another encoding, if necessary. | 06-04-2009 |
| 20090140893 | COMPRESSION RATIO OF ADAPTIVE COMPRESSION ALGORITHMS - The performance (compression ratio) of an entropy coding compressor can be improved by separating its output into two streams: encoded output symbols compressed according to a probability model, and literal symbols that were not present in the probability model when the corresponding input symbol was to be encoded. The literal symbols are collected into a group and compressed separately. The compressed literals are stored at a discernable place relative to the encoded output symbols (e.g., at the beginning or end of the sequence of encoded output symbols). | 06-04-2009 |
| 20090140894 | ADAPTIVE ENTROPY CODING COMPRESSION OUTPUT FORMATS - The performance (compression ratio) of an entropy coding compressor can be improved by separating its output into two streams: encoded output symbols compressed according to a probability model, and literal symbols that were not present in the probability model when the corresponding input symbol was to be encoded. The literal symbols are collected into a group and compressed separately. The compressed literals are stored at a discernable place relative to the encoded output symbols (e.g., at the beginning or end of the sequence of encoded output symbols). | 06-04-2009 |
| 20090153376 | Data compression for communication between two or more components in a system - A method includes generating a first symbol string code indicative of one or more positions of a first symbol string within data to be compressed. A second symbol string code indicative of one or more positions of a second symbol string within the data is also generated. The first symbol string code and the second symbol string code are combined into a compressed data code. | 06-18-2009 |
| 20090160684 | METHOD FOR ENCODING AND DECODING DATA - Methods for the compression and decompression of data using a super cooling process are described wherein an input stream is manipulated, encoded and summarized to form entities containing precedential relationships representing the input stream in a different form. The super cooled sets may be used in the transmission and/or storage of information within the input stream. Additionally, methods for decompressing the data using a super heating process are described. Generally, the super heating process expands and re-orders information contained in super cooled sets to produce at least one reconstructed ordered source stream and/or reverse stream from which the original input stream can be reconstructed. | 06-25-2009 |
| 20090189792 | SYSTEMATIC ENCODING AND DECODING OF CHAIN REACTION CODES - A method of encoding data into a chain reaction code includes generating a set of input symbols from input data. Subsequently, one or more non-systematic output symbols is generated from the set of input symbols, each of the one or more non-systematic output symbols being selected from an alphabet of non-systematic output symbols, and each non-systematic output symbol generated as a function of one or more of the input symbols. As a result of this encoding process, any subset of the set of input symbols is recoverable from (i) a predetermined number of non-systematic output symbols, or (ii) a combination of (a) input symbols which are not included in the subset of input symbols that are to be recovered, and (b) one or more of the non-systematic output symbols. | 07-30-2009 |
| 20090201180 | Compression for deflate algorithm - A method and apparatus for compressing data is described. In one embodiment, a processor receives one or more strings of data to be compressed. Duplicate strings are replaced with pointers using a first compression algorithm. An output of the first compression algorithm is processed with a second compression algorithm using a variable context dynamic encoder to generate a tree of non-overlapping bit-sequences where the length of each sequence is being inversely proportional of the likelihood of that symbol needing to be encoded. Unused symbols are not generated on the tree. | 08-13-2009 |
| 20090212981 | Bidirectional context model for adaptive compression - Techniques for improving encoding and decoding data are described herein. According to one embodiment, in response to a symbol retrieved from an input stream having a sequence of symbols, it is determined whether a current context can encode the retrieved symbol. A code representing an escape down token in the current context is emitted to a code stream if the current context cannot encode the retrieved symbol. A code representing the retrieved symbol in the current context is emitted to the code stream if the current context can encode the retrieved symbol. Optionally, the current context is escaped to a context having a higher order by emitting a code representing an escape up token in the code stream, where a higher order context is a child context to a lower order context as a parent context. | 08-27-2009 |
| 20090212982 | Difference coding adaptive context model - Techniques for improving encoding and decoding data are described herein. According to one embodiment, in response to a symbol retrieved from an input stream having a sequence of symbols, it is determined whether a current context can encode the retrieved symbol. A code representing an escape token is emitted to a code stream if the current context cannot encode the retrieved symbol. The process is escaped from the current context to a parent context of the current context if the current context is not a root context. The retrieved symbol is emitted to a literal stream if the current context is a root context, where the code stream and the literal stream are to be compressed and decoded by a decoder. | 08-27-2009 |
| 20090219177 | Arithmetic Decoding Method and Device - The invention relates to a method for decoding elements coded according to an arithmetic coding method such as CABAC. The method decodes at least a part of the binary stream into a set of elements on the basis of first and second decoding parameters CodIOffset | 09-03-2009 |
| 20090219178 | Method of encoding data - A data encoder-decoder which generates an encoded data element which can be stored in and retrieved from a reduced space memory element. | 09-03-2009 |
| 20090231169 | Method and Apparatus for Low Complexity Combinatorial Coding of Signals - To reduce the complexity of the encoding/decoding of pulse positions and/or pulse magnitudes associated with complex combinatorial computations, a method and structure for encoding and decoding of pulse position and/or pulse magnitudes requires fewer computations of these combinatorial functions. Adaptive switching between coding or encoding is performed in accordance with the estimated density of the plurality of occupied positions. | 09-17-2009 |
| 20090256729 | DIFFERENCE CODING ADAPTIVE CONTEXT MODEL USING COUNTING - Techniques for improving encoding and decoding data are described herein. According to one embodiment, it is determined whether a current context can encode a retrieved symbol. The current context includes a plurality entries, each representing an encoded symbol, including a count value representing a frequency of the entry being used. A code is generated to a code stream, where the code represents a difference between an index of an entry in the current context associated with the retrieved symbol and a previous index used for encoding a previous symbol, if the current context can encode the retrieved symbol. A count value corresponding to the entry associated with the retrieved symbol is incremented in the current context. The current context is sorted based on count values of all entries in the current context, where the code stream and the literal stream are to be compressed and encoded by a compressor. | 10-15-2009 |
| 20090256730 | Advanced Lossless Bit Coding - A bit coding method modifies the bit-steam information in such a way as to provide a very high compression during lossless symbol coding and may be used as a preprocessor for Huffman and arithmetic encodings or on its own. A bit rearrangement scheme (BRS) improves the run length within a data symbol set and achieves a more efficient data-to-symbol mapping. The BRS is implemented on the data symbol set in a column-by-column fashion. The BRS can be combined with any available lossless coding scheme, providing for a more efficient lossless bit coding scheme (ALBCS). | 10-15-2009 |
| 20090256731 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND COMPUTER PROGRAM - An information processing apparatus includes: a data acquisition section inputting data; a data conversion section performing data conversion processing on the data input through the data acquisition section; and a control section performing data processing using the data converted by the conversion processing by the data conversion section, wherein when non-standard compliant data other than standard compliant data capable of being subjected to data processing by the control section is input from the data acquisition section, the data conversion section performs conversion processing of the non-standard compliant data into standard compliant data. | 10-15-2009 |
| 20090273491 | ARITHMETIC DECODING DEVICE - Disclosed herein is an arithmetic decoding device including: an arithmetic decoding unit configured to decode coded data resulting from arithmetic coding on a basis of a context variable indicating a probability state and a most probable symbol; a plurality of arithmetic registers configured to supply the context variable to the arithmetic decoding unit and retain a result of operation by the arithmetic decoding unit; and a plurality of save registers configured to save contents retained in the arithmetic registers. | 11-05-2009 |
| 20090278715 | Decoding Data - Incoming decoded data ( | 11-12-2009 |
| 20090284399 | MECHANISM FOR MODELING ESCAPE COUNTS IN ADAPTIVE COMPRESSION MODELS - In one embodiment, a mechanism for modeling escape counts in adaptive compression models is disclosed. In one embodiment, a method includes initializing an escape count for an escape symbol used in an adaptive compression context model that encodes an input stream, the initial escape count being initialized at a high value in an upper portion of a range of possible count values, invoking the adaptive compression context model with the initial escape count for the escape symbol, incrementing the escape count each time it is utilized in the adaptive compression context model, and scaling the escape count when it exceeds a maximum count value. | 11-19-2009 |
| 20090289819 | EFFICIENT DATA COMPRESSION & DECOMPRESSION OF NUMERIC SEQUENCES - Embodiments described herein relate to compression and decompression of data consisting of a one dimensional time series of floating point numbers. A compressor may comprise a lossless stage and in some embodiments a lossy stage in addition to the lossless stage. The lossy stage quantizes the data by discarding some of the least significant bits as specified by the user. The lossless stage uses a context mixing algorithm with two bit-wise predictive models whose predictions are combined and fed to an arithmetic coder. One model is a direct context model using the most significant bits of prior numeric samples as context. The other model is the output of an adaptive filter, in which the approximate predicted numeric value is used as context to model the actual value. A corresponding decompressor uses the same lossless model with the arithmetic coder replaced by an arithmetic decoder. | 11-26-2009 |
| 20090309769 | System and method for encoding data based on a compression technique with security features - Described herein is an efficient encryption method and system having improved security features based on randomness. The method and system utilize a random dictionary insertion and a random dictionary permutation, and a key stream generated by a stream cipher. Security analysis results show that the method and system provides a higher level of security without incurring any coding efficiency loss, compared with a existing encoding methods. | 12-17-2009 |
| 20090322570 | Adaptive Entropy Coding Compression Output Formats - A system stores compressed literal symbols in a first data block and encoded literal symbols in a second data block. The compressed literal symbols correspond to a first group of literal symbols and the encoded literal symbols correspond to a second group of literal symbols. Each of the second group of literal symbols occurs subsequently in a symbol stream to a literal symbol with the same value in the first group of literal symbols. | 12-31-2009 |
| 20100001886 | Methods and Devices for Coding and Decoding of SML Type Documents by Similarities - The invention relates to methods and devices for binary coding and decoding by similarities for structured documents After having decomposed the data to code into a series of symbols, each item of data being at least partially represented by a symbol, and having selected at least one item of data to code, a search is carried out for a first sequence of symbols coded beforehand, identical to a second sequence of symbols to code, comprising a symbol representing a part of said data. Similarly, a search is carried out for a third sequence of symbols coded beforehand of which one symbol is distinct from the symbol corresponding to a fourth sequence of symbols to code comprising said symbol representing said part of said data. In response to the comparison of their coding efficiency, the second or the fourth sequence is coded. | 01-07-2010 |
| 20100013677 | METHOD AND SYSTEM FOR REDUCING CONTEXTS FOR CONTEXT BASED COMPRESSION SYSTEMS - For context based compression techniques, for example Context Based YK compression, a method and system for grouping contexts from a given context model together to create a new context model that has fewer contexts, but retains acceptable compression gains compared to the context model with more contexts is provided. According to an exemplary embodiment a set of files that are correlated to the file to be compressed (hereafter called training files) are read to determine, for an initial context model, the empirical statistics of contexts and symbols. In some embodiments, this includes determining the estimated joint and conditional probabilities of the various contexts and symbols (or blocks of symbols). The initial context model is then reduced to a desired number of contexts, for example, by applying a grouping function g to the original set of contexts to obtain a new and smaller set of contexts. In some embodiments the step of applying a grouping function comprises iteratively grouping a pair of contexts together to form a grouped context, wherein each grouped context represents a local minimum based on the empirical statistics. | 01-21-2010 |
| 20100039300 | LZW DATA COMPRESSION ALGORITHM - An improved LZW algorithm creates images at the time of compression, and obtains codes from those images at the time of decompression. At the time of compression, string (x) is obtained from the input stream and code (x) is retrieved from the LZW table for string (x). Assuming that a valid image (x) exists for the code, the system and method of the present disclosure may either: 1) write code (x) to the output stream, or 2) write image (x) to the output stream. The enhanced decompression algorithm of the present disclosure in one embodiment retrieves the code or image and restores the original stream. In addition, 1 bit is removed from code (x+1), and its information is indirectly stored in code (x)/image (x). Thereafter, when the decompression program encounters image (x) in the compressed stream, the decompression algorithm adds binary bit ‘1’ (or ‘0’) to the code (x+1), and adds binary bit ‘0’ (or ‘1’) to code (x+1) when it encounters code (x). | 02-18-2010 |
| 20100066573 | SYSTEMS AND METHODS FOR PROVIDING UNEQUAL ERROR PROTECTION USING EMBEDDED CODING - A method for embedded encoding of at least two types of information is described. A first message and a second message are received. The types of a first encoder and a second encoder are determined. The rates of the first encoder and the second encoder are determined. A first codeword and a second codeword are generated. A mapping rule for the second codeword and a coding rule for the first codeword are determined. The second codeword is mapped into a plurality of symbols using the mapping rule. A third codeword is determined using the first codeword, the plurality of symbols, and the coding rule. The third codeword is then transmitted. The third codeword includes at least two types of information. | 03-18-2010 |
| 20100079311 | SYSTEM AND METHOD FOR LOSSLESS DATA COMPRESSION - An embodiment of a method for compressing data includes variable length coding one or more values of control codes generated from dictionary coding the data, wherein the control codes comprise literals and indices, wherein each index comprises a length value and a pointer to previously read in data. An embodiment of a system for losslessly compressing input data includes a modeler operable to determine whether a set of input data matches prior input data, an encoder operable to generate control codes including one or more literal control codes and one or more index control codes, wherein each index control code includes a pointer to a location in the input data and a length value indicating a number of bytes to copy from the location, and wherein the length value is variable length coded. | 04-01-2010 |
| 20100079312 | APPARATUS AND METHOD OF LOSSLESS CODING AND DECODING - An apparatus and a method of lossless coding and decoding are provided. The apparatus to perform lossless coding may selectively perform an arithmetic coding scheme or a Huffman coding scheme with respect to a symbol. The apparatus to perform lossless coding may generate a bitstream including a first coding bit, generated according to the Huffman coding scheme. Such bitstream may include a reserved bit for the arithmetic coding scheme. | 04-01-2010 |
| 20100085218 | COMBINATORIAL CODING/DECODING WITH SPECIFIED OCCURRENCES FOR ELECTRICAL COMPUTERS AND DIGITAL DATA PROCESSING SYSTEMS - Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding with specified occurrences 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 communication between computing platforms via a network or other interconnection medium. | 04-08-2010 |
| 20100097248 | METHOD AND APPARATUS FOR VIDEO PROCESSING IN CONTEXT-ADAPTIVE BINARY ARITHMETIC CODING - A method and apparatus for coding of a significant map in accordance with the present invention. The method include carrying out a scan of at least a portion of a block of transform coefficients, calculating runs of zeros of the scanned data; and coding runs of zeros with variable length coding. | 04-22-2010 |
| 20100117873 | INTEGRATING HASHING AND DECOMPRESSION OF COMPRESSED DATA FOR SAFE COMPUTING ENVIRONMENTS AND SYSTEMS - Techniques for hashing and decompression of data are disclosed. Hashing and decompression of compressed data can be integrated in order to effectively hash and decompress the compressed data at the same time. The integrated hashing and decompression techniques of the invention are useful for any computing environment and/or system where compressed data is hashed and decompressed. The invention is especially useful for safe computing environment and/or system (e.g., a Trusted Computing (TC) computing environment) where hashing decompression of compressed data can be routinely performed. The Integrity of a computing environment and/or system can be protected by integrating the decompressing and hashing of the compressed data or effectively hashing and decompressing the compressed data at the same time. A combined hashing and decompression function can be provided based on conventional hashing and compression functions by integrating their similar components and in an efficient manner. | 05-13-2010 |
| 20100117874 | BACKWARD COMPRESSION SYSTEM AND METHOD - A backward compression system and a backward compression method are provided. By using the system and the method, under limited memory space, a relationship between input data and previous data is identified in real time, the input data or previous data is encoded according to the relationship, and the order of data output is such that the encoded data is output first and the complete data is output second. When the output data is stored in circular memory and the memory gets full, the oldest encoded data is overwritten first, and the complete data is not overwritten until all the related encoded data is overwritten. Therefore, more original data can be preserved after decompression. Thus, system signals can be compressed and utilization of limited memory space can be improved. | 05-13-2010 |
| 20100123607 | METHOD AND SYSTEM FOR EFFICIENT DATA TRANSMISSION WITH SERVER SIDE DE-DUPLICATION - The invention provides a method and system for reducing redundant data blocks. The method includes encoding a first data block having a first length into a bitstream having a second length, transmitting the bitstream to a server device, and reducing redundant data blocks by decoding the first data block from a first plurality of data blocks and the bitstream where each block in the first plurality of data blocks has a length equal to the first length. | 05-20-2010 |
| 20100123608 | METHOD AND APPARATUS FOR CODING AND DECODING USING BIT-PRECISION - 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. | 05-20-2010 |
| 20100127900 | TABLE MANAGEMENT FOR LZW WITH FIXED-SIZE TABLES - Managing a string translation table, where a compressor includes information in the table entries to distinguish strings as more or less important. More particularly, the compressor can identify a string in an input stream, determine an age indicator for the string, and record the age indicator in the table. When the string is encountered or identified, a use indicator or counter may be adjusted to indicate use of the entry and timing information related to encountering the entry. Instead of discarding all entries in the string translation table, a portion of the table can be discarded that has less important entries. The determination of whether to discard an entry as being less important can be based on the age indicator and the use indicator. | 05-27-2010 |
| 20100127901 | DATA STRUCTURE MANAGEMENT FOR LOSSLESS DATA COMPRESSION - An input stream of characters is received. A new string entry is added to a data structure based on a current portion of the input stream if the current portion fails to match any of a plurality of existing string entries in the data structure. An additional string entry is added to the data structure based on a combination of the current portion and a previous portion of the input stream, wherein the additional string entry corresponds to a subset of the combination that fails to match any of the plurality of existing string entries in the data structure. An output stream is generated that includes literal values of the characters and index values corresponding to string entries in the data structure that match portions of the input stream. | 05-27-2010 |
| 20100127902 | LOSSLESS DATA COMPRESSION WITH SEPARATED INDEX VALUES AND LITERAL VALUES IN OUTPUT STREAM - An input stream of characters is received. The input stream is parsed into a plurality of strings each of which include one or more of the characters, wherein each parsed string is a longest match to a string entry in a data structure. An output stream is generated that includes a first portion having literal values of the characters and a separate and distinct second portion having index values corresponding to string entries in the data structure that match parsed strings from the input stream. | 05-27-2010 |
| 20100127903 | METHOD AND APPARATUS FOR CODING AND DECODING USING BIT-PRECISION - 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. | 05-27-2010 |
| 20100134330 | ARITHMETIC DECODING APPARATUS - Disclosed herein is an arithmetic decoding apparatus including an instruction decoder configured to decode an arithmetically encoded data decoding instruction to be executed for carrying out an arithmetic-decoding process of arithmetically decoding arithmetically encoded data into a binary signal; an execution condition code holding section configured to hold the binary signal obtained as a result of an immediately preceding arithmetic-decoding process as an execution condition code; and an arithmetic decoding execution section configured to determine whether a context number specified by the arithmetically encoded data decoding instruction is to be used as a context index as it is or the specified context number incremented by 1 is to be used as the context index in accordance with the execution condition code, and carry out the arithmetic decoding process by making use of the determined context index. | 06-03-2010 |
| 20100141485 | VARIABLE LENGTH CODING METHOD AND VARIABLE LENGTH DECODING METHOD - An image coding apparatus provides a run-length encoding unit RLE | 06-10-2010 |
| 20100188271 | Network re-encoding method and device for re-encoding encoded symbols to be transmitted to communication equipments - A network re-encoding device is intended for re-encoding encoded symbols to be transmitted to at least one communication equipment connected to a network. This network re-encoding device comprises a re-encoding means arranged for re-encoding output nodes, defined by LT code symbols representative of encoded symbols and representative respectively of the results of XOR Boolean operation between input nodes defining decoded symbols whose values have to be discovered and to which they are linked into a Tanner graph, by combining chosen input node and/or output node having known values, in order to produce new LT code symbols defining generated output nodes ready to be transmitted. | 07-29-2010 |
| 20100194607 | DATA COMPRESSION METHOD AND APPARATUS - Embodiments of the invention include a dictionary based data compression method, apparatus and system that is not based on either the LZ77 compression algorithm or the LZ78 compression algorithm, but includes many features of the LZW compression algorithm. The data compression method includes creating a mapping table of the messages in the alphabet of messages to a corresponding plurality of codewords, maintaining a dictionary including a mapping table of a first codeword and a second codeword to a new codeword, reading an input ensemble including a plurality of messages, converting the messages to an input codeword using the mapping table, and outputting the converted codewords as an output ensemble of compressed data. Unlike conventional data compression methods, the dictionary is generated from the output ensemble only, and is not based on any input messages. Therefore, the dictionary more quickly builds to define longer sequences of messages compared to conventional data compression methods. | 08-05-2010 |
| 20100194608 | GENERATING A BOUNDARY HASH-BASED HIERARCHICAL DATA STRUCTURE ASSOCIATED WITH A PLURALITY OF KNOWN ARBITRARY-LENGTH BIT STRINGS AND USING THE GENERATED HIERARCHICAL DATA STRUCTURE FOR DETECTING WHETHER AN ARBITRARY-LENGTH BIT STRING INPUT MATCHES ONE OF A PLURALITY OF KNOWN ARBITRARY-LENGTH BIT STRINGS - A high-speed, space-efficient, scalable and easily updateable data boundary hash-based structure is generated and used. The proposed boundary hash-based data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query. | 08-05-2010 |
| 20100214136 | DICTIONARY-BASED COMPRESSION - A method and apparatus for compressing data is described. A compressor builds a dictionary associated with the characters in the input string. A table in the dictionary is generated by looking backward from a current character being encoded in the input string to determine the last time the most recent one or more characters have occurred. The compressor determines whether the following characters at a point of encoding matches the next character being encoded. | 08-26-2010 |
| 20100214137 | LZSS WITH MULTIPLE DICTIONARIES AND WINDOWS - A method and apparatus for compressing data is described. An input string to be compressed is received. The input string is encoded with compressor using a compression algorithm using several sizes of dictionaries and windows. The compressor processes the input string with a selected size of the dictionary and window yielding the most compression of the input string among the different sizes of dictionaries and windows. | 08-26-2010 |
| 20100219990 | COMPACT ENCODING OF SMALL INTEGERS - A method and apparatus for encoding a set of integers is described. The largest power of two integer is determined based on a size of the set of integers with an integer encoder. A code table is constructed using the largest power of two integer. A uniform coding is constructed with values from the code table. A string “1” is prepended to each code from the code table. The string “1” is appended to a string “0” from the code table. | 09-02-2010 |
| 20100225506 | Multi-Mode Encoding for Data Compression - The present disclosure includes apparatus, systems and techniques relating to lossless data compression. In some implementations, an apparatus includes a memory module to store data. The memory module includes a first buffer portion to store encoded symbols of the data, and a second buffer portion to store symbols of the data to be encoded. The apparatus includes an encoder to compare the symbols stored in the second buffer portion with the encoded symbols stored in the first buffer portion and to compress the data. The encoder can operate in a first encoding mode to encode the symbols in the second buffer portion with corresponding codewords until detecting a repeated pattern of symbols in the second buffer portion that matches the encoded symbols in the first buffer portion. The encoder can operate in a second encoding mode responsive to detecting the repeated pattern. | 09-09-2010 |
| 20100231424 | DECODING DEVICE AND DECODING METHOD - A decoding method includes: inputting control information including first and second codec identifiers identifying first and second codecs corresponding to first and second material data, respectively, and first and second time information representing start times of decoding of the first and second material data, respectively; loading corresponding to the first codec identifier the first codec into the first decode processing unit; starting in the first decode processing unit corresponding to the first time information decoding of the first material data; and loading corresponding to the second codec identifier the second codec into the second decode processing unit. | 09-16-2010 |
| 20100253555 | ENCODING METHOD AND SYSTEM, DECODING METHOD AND SYSTEM - A decoder, an encoder, a decoding method and an encoding method are provided. The encoding method includes receiving data; generating a set of first codewords by applying a first encoding process on the received data; and performing a second encoding process on a folded version of each first codeword to provide a set of second codewords, wherein a folded version of a first codeword is representative of a storage of the first codeword in a two dimensional memory space, wherein the second codeword comprises redundancy bits. | 10-07-2010 |
| 20100302077 | WEAR REDUCTION METHODS BY USING COMPRESSION/DECOMPRESSION TECHNIQUES WITH FAST RANDOM ACCESS - The present invention reduces the number of writes to a main memory to increase useful life of the main memory. To reduce the number of writes to the main memory, data to be written is written to a cache line in a lowest-level cache memory and in a higher-level cache memory(s). If the cache line in the lowest-level cache memory is full, the number of used cache lines in the lowest-level cache reaches a threshold, or there is a need for an empty entry in the lowest-level cache, a processor or a hardware unit compresses content of the cache line and stores the compressed content in the main memory. The present invention also provides LZB algorithm allowing decompression of data from an arbitrary location in compressed data stream with a bound on the number of characters which needs to be processed before a character or string of interest is processed. | 12-02-2010 |
| 20100328115 | DICTIONARY-BASED ORDER-PRESERVING STRING COMPRESSION FOR MAIN MEMORY COLUMN STORES - Methods and systems are described that involve usage of dictionaries for compressing a large set of variable-length string values with fixed-length integer keys in column stores. The dictionary supports updates (e.g., inserts of new string values) without changing codes for existing values. Furthermore, a shared-leaves approach is described for indexing such a dictionary that compresses the dictionary itself while offering access paths for encoding and decoding. | 12-30-2010 |
| 20110037625 | DATA ENCODING METHOD - The present encoding method encodes binary data as sequences of code points occupying the Private Use Area of the Unicode Basic Multilingual Plane. The encoded data can be contained within a stream of UTF-8, UTF-16 or UTF-32 code units and subsequently decoded to yield the original binary data. This method requires minimal processing for both encoding and decoding operations, and yields a 75% storage efficiency limit. Each datum encoding sequence includes type and encoding length information, enhancing parse and search operation performance. The type system includes elements for creating complex structured data-text sequences, and a mechanism for application defined extensions. | 02-17-2011 |
| 20110043387 | DATA COMPRESSION USING A NESTED HIERACHY OF FIXED PHRASE LENGTH STATIC AND DYNAMIC DICTIONARIES - The present invention describes lossless data compression/decompression methods and systems. A random access memory (RAM) operates as a static dictionary and includes commonly used strings/symbols/phrases/words. An input buffer operates as a dynamic dictionary and includes input strings/phrases/symbols/words. A set-associative cache memory operates as a hash table, and includes pointers pointing to the commonly used strings/symbols/phrases/words in the static dictionary and/or pointing to one or more of the input strings/phrases/symbols/words in the dynamic dictionary. Alternatively, the set-associative cache memory combines the dynamic dictionary, the static dictionary and the hash table. When encountering a symbol/phrase/string/word in the static or dynamic dictionary in an input stream, a compressor logic or module places a pointer pointing to the symbol/phrase/string/word at a current location on the output stream. The hash table may include phrases/symbols/strings/words and/or pointers pointing to phrases/symbols/strings/words. | 02-24-2011 |
| 20110068957 | DATA COMPRESSION SYSTEM AND ASSOCIATED METHODS - A system to compress an inter-system channel data stream may include a data compression application executing via a computer processor. The system may additionally include a transmit dictionary used by said data compression application to compress an inter-system channel data stream. The system may also include a data decompression application executing via a second computer processor to decompress the inter-system channel data stream. The system may further include a receive dictionary used by said data decompression application to decompress the inter-system channel data stream. | 03-24-2011 |
| 20110068958 | Adaptive Code Generator for Satellite Navigation Receivers - An adjustable code generator is configurable to generate any of a plurality of spread-spectrum code signals. The adjustable code generator includes a feedback polynomial mask table to contain a set of feedback polynomial masks. Respective feedback polynomial masks of the set correspond to respective spread-spectrum code signals of the plurality of spread-spectrum code signals. The adjustable code generator also includes control logic to select any of the feedback polynomial masks of the set contained in the feedback polynomial mask table, and further includes a shift register to provide, at an output, a respective spread-spectrum code signal that corresponds to a feedback polynomial mask selected by the control logic and to receive feedback generated using the feedback polynomial mask selected by the control logic. | 03-24-2011 |
| 20110102207 | Evaluating Alternative Encoding Solutions During Data Compression - Method and apparatus for compressing data. In accordance with various embodiments, an input string of data bits is received and arranged into fixed-sized chunks. Multiple successive chunks of the input string are compared to previously received chunks of the input string during a single clock cycle. At least two alternative encoding solutions are identified based on matches obtained during said comparison. The input string is compressed to form a compressed output string using a selected one of the at least two alternative encoding solutions that achieves a fewer number of bits in said output string. | 05-05-2011 |
| 20110128167 | UNICODE-COMPATIBLE DICTIONARY COMPRESSION - A character data set is compressed with a compression algorithm module of a computer system to generate one or more streams of encoded values. A code point mapper assigns the encoded values to code points reserved for private use in a Unicode format. An encoder encodes the streams of assigned encoded values using a Unicode Transformation Format (UTF). A dictionary of the compression algorithm initially includes code points assigned by the Unicode format. New entries are successively assigned to private use code points. | 06-02-2011 |
| 20110140937 | DISTRIBUTED ON-DEMAND MEDIA TRANSCODING SYSTEM AND METHOD - 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. | 06-16-2011 |
| 20110156932 | HYBRID ARITHMETIC-COMBINATORIAL ENCODER - Hybrid range coding/combinatorial coding (FPC) encoders and decoders are provided. Encoding and decoding can be dynamically switched between range coding and combinatorial according to the ratio of ones to the ratio of bits in a partial remaining sequence in order to reduce the computational complexity of encoding and decoding. | 06-30-2011 |
| 20110181448 | LOSSLESS COMPRESSION - Embodiments of the invention include a method and system for data compression which includes receiving as input a data stream, the data stream comprising a sequence of symbols, identifying the first symbol in the data stream, identifying positions in the data stream where the first symbol is repeated, encoding all position in the data stream representing the first symbol and repeating the process until all symbols in the data stream are encoded. The encoding is performed using a binomial encoding technique, where the binomial values are computed and summed thereby achieve better lossless compression. | 07-28-2011 |
| 20110187564 | Encoding and Decoding Method and Device - The present invention relates to information processing technologies and discloses an encoding and decoding method and device to solve the poor decoding quality problem. The technical solution of the present invention includes: encoding each sample of an input signal to generate an encoded signal of a core layer; comparing residuals of all or a part of the samples of the input signal with encoding thresholds, where the residuals are generated by core layer encoding, and performing encoding according to comparison results to generate an encoded signal of an enhancement layer; and writing the encoded signal of the core layer and the encoded signal of the enhancement layer into a bitstream to generate an encoded signal of the input signal. | 08-04-2011 |
| 20110193728 | VARIABLE LENGTH CODING METHOD AND VARIABLE LENGTH DECODING METHOD - An image coding apparatus provides a run-length encoding unit RLE | 08-11-2011 |
| 20110199241 | DATA COMPRESSION/DECOMPRESSION METHOD - A compression engine starts compressing data by a preset first compression rule, compresses the following data by a second compression rule when the characteristics of the data satisfy a predetermined switching condition, and returns to the first compression rule when the characteristics of the data do not satisfy the switching condition to compress the data and the following data. A decompression engine starts decompressing compressed data by a first decompression rule corresponding to the first compression rule, decompresses the following compressed data by a second decompression rule corresponding to the second compression rule when the characteristics of the data after decompression satisfy the switching condition, and returns to the first decompression rule when the characteristics of the data after decompression do not satisfy the switching condition to decompress the data and the following compressed data. | 08-18-2011 |
| 20110205091 | INFORMATION PROCESSING APPARATUS AND CONTROL METHOD THEREOF, AND STORAGE MEDIUM - An apparatus which efficiently decompresses encoded data based on dictionary method, by suppressing the number of times of processing of registration in a character string table used as a dictionary. A buffer controller stores a codeword in a buffer until a clear code or an end code is input. When a clear code or an end code is input, the buffer controller specifies a codeword referring a table among codes in the buffer and generates identification information to specify a codeword as a subject of registration in the table. During decoding processing, a table controller determines whether or not a codeword from the buffer is the subject of registration in the table. When the codeword is the subject of registration, the table controller registers a new character string, obtained by adding a head character of a currently decoded character string to a previously decoded character string, in the table. | 08-25-2011 |
| 20110210873 | ENCODING AND DECODING METHODS AND DEVICES USING A SECONDARY CODEWORD INDICATOR - 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 codewards 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. | 09-01-2011 |
| 20110227764 | SYSTEMS AND METHODS FOR COMPRESSION OF LOGICAL DATA OBJECTS FOR STORAGE - 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.” | 09-22-2011 |
| 20110234431 | Multiple Technique Entropy Coding System and Method - A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder constructed according to the present invention uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations. | 09-29-2011 |
| 20110248871 | DECODING DEVICE FOR CONTEXT-BASED ADAPTIVE BINARY ARITHMETIC CODING (CABAC) TECHNIQUE - A decoding device is suitable for a context-based adaptive binary arithmetic coding (CABAC) technique and allows a real-time decoding of high-definition video. The CABAC decoding device allows a simultaneous performing since determination according to multiple conditions is based on logic circuits when the device is formed in hardware. Additionally, when one macro block starts to be decoded, the device reads and stores information about neighboring macro blocks at a time from a memory. Therefore, the device does not need to access the memory at every operation and this improves the overall decoding speed. | 10-13-2011 |
| 20110260893 | ADAPTIVE DIFFERENTIAL PULSE CODE MODULATION ENCODING APPARATUS AND DECODING APPARATUS - A signal corresponding to a short-period change and a signal corresponding to a long-period change of a sound signal are detected, and optimal quantization is performed based on the combination of the two signals. In an ADPCM encoding apparatus ( | 10-27-2011 |
| 20110285556 | Parallel Compression for Dictionary-Based Sequential Coders - Dictionary-based sequential compression is performed in parallel on input data using multiple cores of a computer system. The compression can be performed by first determining a dictionary size for data compression, followed by determining a block size for partitioning the input data. The block size is greater than the dictionary size. The multiple cores of the computer system then execute multiple threads in parallel, with each thread compressing one block of the input data according to a dictionary-based sequential compression scheme. | 11-24-2011 |
| 20110304487 | FLOATING POINT TIMER TECHNIQUES - Aspects of the present disclosure relate to floating point timers and counters that are used in a variety of contexts. In some implementations, a floating point counter can be used to generate a wave form made up of a series of pulses with different pulse lengths. An array of these floating point counters can be used to implement a pool of delays. In other implementations, an array of floating point counters can be used to analyze waveforms on a number of different communication channels. Analysis of such waveforms may be useful in automotive applications, such as in wheel speed measurement for example, as well as other applications. | 12-15-2011 |
| 20120019403 | METHOD AND DEVICE FOR ENCODING AND DECODING OF SYMBOL SEQUENCES WHEREIN EACH SYMBOL MAY HAVE ONE OUT OF THREE OR MORE POSSIBLE SYMBOL VALUES - A method for compressing a symbol sequence, wherein each symbol may have one out of three or more possible symbol values, said method comprises the steps of modifying the symbol sequence by replacing each run pair, which contains a first run of symbols of a most frequent symbol value and a second run of symbols of a second most frequent symbol value, by a further symbol value not comprised in the three or more possible symbol values, generating a binary sequence comprising all replaced run pairs and compression encoding the binary sequence and the modified symbol sequence. | 01-26-2012 |
| 20120026020 | METHOD AND DEVICE FOR COMPRESSION OF BINARY SEQUENCES BY GROUPING MULTIPLE SYMBOLS - 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 2 | 02-02-2012 |
| 20120032823 | METHOD AND APPARATUS FOR ADAPTIVE LOSSLESS DATA COMPRESSION - A method for performing adaptive lossless data compression using a buffer memory comprises the steps of receiving a plurality of first match signals (m( | 02-09-2012 |
| 20120062399 | Determination of Long Binary Sequences Having Low Autocorrelation Functions - Systems, methods, and computer-readable media for determining long binary sequences having low autocorrelation functions using evolutionary processes are disclosed. Biphase sequences are found with low peak sidelobe values meeting a predetermined criterion, e.g., threshold low auto-correlation function, including application of semidefinite programming in connection with determining an initial population, and evolving the population with an evolutionary algorithm to bits of the biphase sequences including bit flipping. The found biphase sequences can be communicated to a variety of applications, including wireless communications technologies. | 03-15-2012 |
| 20120169518 | DYNAMIC DECODING LOOKUP TABLE GENERATION METHOD AND ELECTRONIC DEVICE APPLYING THE SAME - A dynamic decoding lookup table generation method is provided. The generation method includes: receiving a variable length coding (VLC) table; and dynamically establishing an adaptive decoding lookup table from the VLC table according to a target decoding rate and a free system memory resource. | 07-05-2012 |
| 20120176256 | Primary base exponential line coding - Line coding, or data coding at the physical layer of transmission, storage and retrieval has typically been previously by a digital representation of the actual binary coded value of a positional data bit in a byte. Bits are constructed into bytes of eight bits, words are constructed of two bytes, and so forth. Each more significant bit positional location in a typical eight bit byte is of greater value by a factor of two. This method of data coding is pervasive throughout modern information technology related devices, equipment and processing systems. In one embodiment of the invention—at bit location following that of 2 | 07-12-2012 |
| 20120182162 | Rollover operative digital to analog converter (DAC) - Rollover operative digital to analog converter (DAC). With respect to a codeword that is provided to a DAC, a processing module (e.g., a rollover processor) operates to compare the codeword to threshold(s) in accordance with adaptively partitioning the codeword into one or more sub-codewords when the codeword has a magnitude greater than at least one of the thresholds. In instances that the codeword is less than a threshold, the codeword may be provided directly to a DAC for use in generating a first analog signal. However, if the codeword is a larger than a threshold, then that portion of the codeword which is greater than the threshold may be provided to an alternative component such as one or more auxiliary or additional DACs, one or more other circuitry components, etc. in accordance with generating at least one additional analog signal to be combined with the first analog signal. | 07-19-2012 |
| 20120206279 | DETECTING WHETHER AN ARBITRARY-LENGTH BIT STRING INPUT MATCHES ONE OF A PLURALITY OF KNOWN ARBITRARY-LENGTH BIT STRINGS USING A HIERARCHICAL DATA STRUCTURE - Generating and using a high-speed, scalable, and easily updateable data structure are described. The proposed data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query. | 08-16-2012 |
| 20120206280 | Multiple Word Data Bus Inversion - A data encoding scheme for transmission of data from one circuit to another circuit considers the Hamming Weight of combined multiple words to determine whether to invert or not invert an individual word to be transmitted. The multi-word data encoding scheme performs DBI encoding with data inversion conducted based on the total HW in the combined multiple words. The decision to invert or not invert each of the multiple words is made based on the sum of the individual Hamming Weights of each of the words. Such encoding has the advantage that SSO noise is dramatically reduced when the encoded data has a large number of words transmitted from one circuit to another circuit over a wide parallel bus. | 08-16-2012 |
| 20120235840 | Encoder that Optimizes Bit Allocation for Information Sub-Parts - A digital information encoder including a divider configured to divide a block of information into a plurality of sub-parts, an initial bit allocator configured to perform an initial allocation of bits to a K | 09-20-2012 |
| 20120286979 | Compression With Adjustable Quality/Bandwidth Capability - The disclosure provides a system and method to vary bandwidth/speed of a compression engine to tradeoff with compression quality. The system comprises an input port receiving a data stream having a current byte and a stream of preceding and subsequent bytes thereof; a history memory storing the stream of preceding bytes in blocks of history data an index engine having a table of keys associated to memory addresses of the blocks, the index engine accessing the table to output a plurality of potential string matches upon entry of the current byte; a search engine processing the potential string matches by fetching the blocks of history data associated with each of the plurality of potential string matches and comparing a portion of each of the blocks to the current byte to output a string upon matching consecutive bytes in the block to the current byte and subsequent bytes thereof; and a control input limiting the number of potential string matches processed by the search engine. | 11-15-2012 |
| 20120293343 | METHOD FOR HIGH THROUGHPUT PARALLEL AVC/H.264 CONTEXT-BASED ADAPTIVE BINARY ARITHMETIC CODING DECODER - Methods for decoding are provided. The proposed method includes steps of: receiving a most probable symbol (MPS) value and a probability value for generating a probability model update; and receiving the probability model update for generating the MPS value and the probability value, wherein when the probability value shows that an MPS is occurred, a path corresponds to the MPS is estimated and a first bin included in the path is decoded beforehand. | 11-22-2012 |
| 20130099946 | Data Compression Utilizing Variable and Limited Length Codes - According to one embodiment, an apparatus for decoding encoded data comprises a hardware module including circuitry to process a data stream. The data stream includes one or more encoded symbols each including a code assigned to a corresponding symbol. A set of least frequently occurring symbols are assigned a common code to encode those symbols within the data stream. Data blocks are generated each containing a data stream portion. One or more encoded symbols within each data block are identified by comparing data block portions to maximum code values for corresponding code lengths to determine a code length for each data block portion. A starting location for the identified encoded symbols within each data block is determined based on the determined code lengths. Embodiments of the present invention further include related methods and computer program products for decoding encoded data. | 04-25-2013 |
| 20130187796 | LOSSLESS CODING TECHNIQUE FOR CABAC IN HEVC - 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. | 07-25-2013 |
| 20130187797 | LOSSLESS CODING WITH DIFFERENT PARAMETER SELECTION TECHNIQUE FOR CABAC IN HEVC - A system utilizing a high throughput lossless coding mode for CABAC in HEVC is described. The system may include an electronic device configured to obtain a block of data to be encoded using an arithmetic based encoder; determine whether the block of data is to be encoded using lossless encoding; in response to determining that the block of data is not to be encoded using lossless encoding, use a first Absolute−3 coding technique to encode the block of data; in response to determining that the block of data is to be encoded using lossless encoding, use a second Absolute−3 coding technique to encode the block of data; wherein the second Absolute−3 coding technique is different than the first Absolute−3 coding technique. | 07-25-2013 |
| 20130222159 | ENTROPY METHOD OF BINARY-TERNARY LOSSLESS DATA CODING - Subject of this invention is a new lossless data compression method. It is characterized by the simplicity of implementation, high speed and good compression efficiency. The method is based on a unique scheme of binary-ternary prefix-free encoding of characters or bit-series of the original data. This scheme does not require the transmission of the code tables and frequencies of character appearances from encoder to decoder; allows for the linear presentation of the code lists; permits the usage of computable index of the prefix codes in a linear list for decoding; makes it possible to estimate the compression ratio prior to encoding; makes the usage of multiplication and division operations, as well as operations with the floating point unnecessary; proves to be effective for static as well as adaptive coding; applicable to character sets of any size; allows for repeated compression to improve the ratio. | 08-29-2013 |
| 20130241750 | SIGNAL PROCESSOR, WINDOW PROVIDER, ENCODED MEDIA SIGNAL, METHOD FOR PROCESSING A SIGNAL AND METHOD FOR PROVIDING A WINDOW - A signal processor for providing a processed version of an input signal in dependence on the input signal includes a windower configured to window a portion of the input signal, or of a pre-processed version thereof, in dependence on a signal processing window described by signal processing window values for a plurality of window value index values, in order to obtain the processed version of the input signal. The signal processor also includes a window provider for providing the signal processing window values for a plurality of window value index values in dependence on one or more window shape parameters. | 09-19-2013 |
| 20130249716 | System And Method Of Compression And Decompression - The disclosure relates to a system and a method for hardware encoding and decoding according to the Limpel Ziv STAC (LZS) and Deflate protocols based upon a configuration bit. | 09-26-2013 |
| 20140009314 | EFFICIENT STRING HASH COMPUTATION - 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. | 01-09-2014 |
| 20140049410 | SELECTIVE RECOMPRESSION OF A STRING COMPRESSED BY A PLURALITY OF DIVERSE LOSSLESS COMPRESSION TECHNIQUES - 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. In response to determining that the most compressed string was not obtained by application of the template-based compression technique, the most compressed string is output as the output string. | 02-20-2014 |
| 20140055290 | Methods and Apparatus in Alternate Finite Field Based Coders and Decoders - 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. Systems applying encoders and decoders also are provided. | 02-27-2014 |
| 20140062732 | VECTORIZED REBINNING FOR FAST DATA DOWN-SAMPLING - 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. | 03-06-2014 |
| 20140247166 | HIERARCHICAL CODING - A binary allocation in a hierarchical coding/decoding comprising a coding/decoding of a digital signal enhancement layer. The signal comprises a succession of L samples, each sample being represented by a mantissa and an exponent. The method comprises the allocation of a predetermined number N | 09-04-2014 |
| 20140266815 | LEMPEL-ZIV DATA COMPRESSION WITH SHORTENED HASH CHAINS BASED ON REPETITIVE PATTERNS - Methods and apparatus are provided for Lempel-Ziv data compression with shortened hash chains based on repetitive multi-byte runs. Data is compressed by processing a sequence of data to identify a repetitive pattern, such as a multi-byte run; and providing indicators associated with the sequence of data of a start position and an end position of the repetitive pattern. The indicators of the start and end positions of the repetitive pattern may comprise, for example, flags associated with the positions. The indicators of the start and end positions of the repetitive pattern are processed to determine a sequence length of the repetitive pattern. In addition, a match can be identified in the sequence of data having a length that is greater than or equal to an offset of s bytes to identify a run comprised of an s-byte sequence. | 09-18-2014 |
| 20140266816 | METHOD AND APPARATUS FOR COMPRESSING DATA-CARRYING SIGNALS - A compression method applies a selection rule to input symbols and generates a reduced partial set of symbols. The partial set is checked against a dictionary-index for a match. A match identifies a range of matching symbols in a dictionary. The length of the matching range is iteratively increased by checking previous and next symbols in the input data and the dictionary until a matching range length meets a threshold limit or the length of the matching range cannot be increased further. Compressed data corresponding to the input symbols is provided where input symbols are copied over and symbols in a matched range of data are replaced with a representation of their corresponding start location and length in the dictionary. | 09-18-2014 |
| 20140266817 | METHODS AND APPARATUS FOR CONTEXT BASED LINE CODING - Methods and apparatus intelligently switching between line coding schemes based on context. In one exemplary embodiment, an High Definition Multimedia Interface (HDMI) system is configured to transmit control and video data according to an 8B/10B line coding protocol, and data island data according to TERC4 (TMDS (Transition Minimized Differential Signaling) Error Reduction Coding 4-bit). Various elements of the disclosed HDMI devices are configured to determine when a context switch occurs, and thereafter seamlessly transition between the appropriate line code protocol. | 09-18-2014 |
| 20140292546 | DECOMPRESSION CIRCUIT AND ASSOCIATED DECOMPRESSION METHOD - A decompression circuit includes a first decompression unit and a second decompression unit. The first decompression unit performs a first decompression operation on data to generate first decompressed data. The first decompressed data includes a plurality of literals and a distance-length pair. The second decompression unit receives the first decompressed data, and sequentially performs a second decompression operation on the literals and the distance-length pair to generate second decompressed data. After the second decompression unit receives the distance-length pair from the first decompression unit and before the second decompression unit completes decompressing the distance-length pair, the second decompression unit transmits data required for the subsequent first decompression operation performed by the first decompression unit to the first decompression unit according to the distance-length pair. | 10-02-2014 |
| 20140292547 | DECOMPRESSION CIRCUIT AND ASSOCIATED COMPRESSION METHOD AND DECOMPRESSION METHOD - A decompression circuit for decompressing data includes a first decompression unit and a second decompression unit. The data sequentially includes a compressed first string, a compressed distance-length pair and a compressed second string. The first decompression unit performs a first decompression on the data to obtain a first string, a distance-length pair and a second string. The second decompression unit receives and decompresses the first string, the distance-length pair and the second string. The first decompression unit does not involve data associated with the distance-length pair when decompression the second string. | 10-02-2014 |
| 20140333457 | Random Extraction From Compressed Data - 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. | 11-13-2014 |
| 20140333458 | BINARY ARITHMETIC CODING SCHEME - A binary arithmetic coding scheme is extended by a functionality to encode and decode non-negative integer values with particular low computational complexity. | 11-13-2014 |
| 20150109152 | Encoder That Optimizes Bit Allocation For Information Sub-Parts - A digital information encoder including a divider configured to divide a block of information into a plurality of sub-parts, an initial bit allocator configured to perform an initial allocation of bits to a K | 04-23-2015 |
| 20150138003 | Generating an ICONV Module in Real Time - Provided are techniques for detecting a mapping, by a universal convertor, of a first character set to a second character set and of the second character set to a third character set; monitoring, logging, and analyzing code set conversion (CSC) operations; generating a updated character set conversion module from the first character set to the third character set in response to the detecting and a determination that the CSC operation exceed the predefined threshold; and storing the updated character set conversion module for utilization of subsequent processing of the first character set to the third character set. | 05-21-2015 |
| 20150303940 | Variable Frequency Data Transmission - A system comprising an encoder for receiving a binary string of a data, the encoder adapted to partition the binary string into one or more binary substrings and assign a color to each one or more substring corresponding to a color model, a frequency controller for converting the color into electrical pulses corresponding to a predetermined frequency, and at least one antenna for emitting the electrical pulses as pulses as frequencies through a communication channel. The system may further comprise a parallel decoder. The system further comprises at least a processor, memory, and a data compression component for compressing data to output a compressed binary string of data to be transmitted by the encoder or decoder or both. | 10-22-2015 |
| 20150326247 | Dictionary-based compression method, dictionary-based decompression method and dictionary composing method - The present disclosure discloses a dictionary-based compression method, a dictionary-based decompression method and a dictionary composing method. An embodiment of said dictionary-based compression method comprises: receiving digital data which include a plurality of data blocks; compressing the digital data according to a multilayer dictionary-based compression algorithm which includes a first dictionary-based compression algorithm, a second dictionary-based compression algorithm and a third dictionary-based compression algorithm. Said first, second and third dictionary-based compression algorithms execute compression by a unit range of N data blocks, a unit range of M data blocks and a unit range of L data block(s) respectively in which N, M, L are integers not greater than the number of total data blocks, wherein N is greater than M and M is greater than L. | 11-12-2015 |
| 20150372693 | ENCODING OF PLAIN ASCII DATA STREAMS - A pair of adjacent characters in a plain ASCII data stream is examined for a condition that the pair contains a consonant followed by one of a set of characters, or a vowel followed by one of the set of characters. The set of characters is selected only from vowels and the space character. If the condition is satisfied, the pair is encoded as a corresponding extended ASCII code. If the condition is not satisfied, the first character of the pair is emitted as a corresponding plain ASCII code, and a next pair is formed with the second character of the (previous) pair as the first character and a next character of the plain ASCII stream as the second character. The next pair as well as further pairs are examined for the condition and correspondingly processed. Compression of the plain ASCII data stream is thereby achieved. | 12-24-2015 |
| 20160006455 | DECODING METHOD, DECODING APPARATUS, AND COMPUTER-READABLE RECORDING MEDIUM - A decoding method includes: decoding first coded data included in a coded data into first partial data, the coded data being encoded from first data with a first character code, by a processor; detecting character boundary in the first partial data based on character code information that the coded data is encoded from the first data with the first character code, by the processor; and converting at least a part of the first partial data into second data with a second character code utilizing the detected character boundary, based on information associating the first character code with the second character code, by the processor. | 01-07-2016 |
| 20160043736 | SYSTEM AND METHOD TO CONCURRENTLY MATCH ANY TYPE, COMBINATION AND/OR RANGE OF CHARACTERS DEFINED BY A REGULAR EXPRESSION ON A HARDWARE IMPLEMENTATION USING A SINGLE DETECTION LOGIC - Method to simultaneously detect all possible types, combinations and/or ranges of characters of a Regular Expression search pattern in a search space by re-encoding the search pattern and the search space in single set bit representations, employing a single detection logic. The search space n-bit representation is re-encoded into a single set bit representation of 2n bits while single/multiple search pattern(s) n-bit representation(s) is (are) re-encoded and combined into a sole single/multiple set bit representation of 2n bits. The hardware implementation of the method detects the presence of any character existent from the search pattern in the search space. | 02-11-2016 |
| 20160094242 | HIERARCHICAL DATA COMPRESSION AND COMPUTATION - According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation. | 03-31-2016 |
| 20160094243 | HIERARCHICAL DATA COMPRESSION AND COMPUTATION - According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation. | 03-31-2016 |
| 20160099723 | ENHANCED DATA COMPRESSION FOR SPARSE MULTIDIMENSIONAL ORDERED SERIES DATA - Disclosed are methods and systems for significantly compressing sparse multidimensional ordered series data comprised of indexed data sets, wherein each data set comprises an index, a first variable and a second variable. The methods and systems are particularly suited for compression of data recorded in double precision floating point format. | 04-07-2016 |
| 20160105198 | CODING METHOD, DECODING METHOD, CODER, AND DECODER - A coding method, a decoding method, a coder, and a decoder are disclosed herein. A coding method includes: obtaining the pulse distribution, on a track, of the pulses to be encoded on the track; determining a distribution identifier for identifying the pulse distribution according to the pulse distribution; and generating a coding index that includes the distribution identifier. A decoding method includes: receiving a coding index; obtaining a distribution identifier from the coding index, wherein the distribution identifier is configured to identify the pulse distribution, on a track, of the pulses to be encoded on the track; determining the pulse distribution, on a track, of all the pulses to be encoded on the track according to the distribution identifier; and reconstructing the pulse order on the track according to the pulse distribution. | 04-14-2016 |
| 20160118998 | PREDICATE APPLICATION THROUGH PARTIAL COMPRESSION DICTIONARY MATCH - Apparatus and systems, including computer program products, implementing and using techniques for predicate application using partial compression dictionary match. A search strategy is developed for each predicate to be applied to compressed data. The compressed data is searched using the search strategy to locate the compression symbols identified in the search strategy. In response to locating a compression symbol from the search strategy in the compressed data, a respective row and applying the predicate is decompressed and a respective row that matches the predicate is returned to a database engine or an application. | 04-28-2016 |
| 20160124068 | CALIBRATION DATA - Apparatus is provided for: storing a four-dimensional matrix of fixed point calibration data; rearranging the four-dimensional matrix of fixed point calibration data into a one-dimensional sequence; calculating a differential sequence of the one-dimensional sequence; saving the differential sequence and a first element of the one-dimensional sequence into a binary file; and compressing the binary file using a DEFLATE algorithm. Apparatus is provided for corresponding decompression also. | 05-05-2016 |
| 20160164536 | IMPROVED DEFLATE COMPRESSION ALGORITHM - A compression algorithm replaces duplicative strings with a copy pair indicating a location and length of a preceding identical string that is within a window from the duplicative string. Rather than a replacing a longest matching string within a window from a given point with a copy pair, the longest matching string may be used provide it is at least two bytes larger than the next longest matching string or is at a distance that is less than some multiple of a distance to the next longest matching string. In another aspect, the length of the window in which a matching string may be found is dependent on a length of the matching string. In yet another aspect, rather than labeling each literal and copy pair to indicate what it is, strings of non-duplicative literals are represented by a label and a length of the string. | 06-09-2016 |
| 20160204796 | ENHANCED COMPRESSION, ENCODING, AND NAMING FOR RESOURCE STRINGS | 07-14-2016 |
| 20160204799 | HIERARCHICAL DATA COMPRESSION AND COMPUTATION | 07-14-2016 |
| 20160380648 | OPTIMIZED CODE TABLE SIGNALING FOR AUTHENTICATION TO A NETWORK AND INFORMATION SYSTEM - In various embodiments, a system comprising a network interface, a processor, and a non-transient memory medium operatively coupled to the processor is disclosed. The memory medium is configured to store a plurality of instructions configured to program the processor to receive a digital bit stream, transform the digital bit stream to an encoded digital bit stream. The encoded digital bit stream comprises at least one of a gateway channel, a composite channel, or a data channel, and any combination thereof, and provides the encoded digital bit stream to the network interface for transmission. A non-transitory computer-readable memory medium and a computer-implemented method also are disclosed. | 12-29-2016 |
| 20160380649 | HARDWARE DATA COMPRESSOR USING DYNAMIC HASH ALGORITHM BASED ON INPUT BLOCK TYPE - A hardware data compressor that compresses an input block of characters by replacing strings of characters in the input block with back pointers to matching strings earlier in the input block. A hash table is used in searching for the matching strings in the input block. A plurality of hash index generators each employs a different hashing algorithm on an initial portion of the strings of characters to be replaced to generate a respective index. The hardware data compressor also includes an indication of a type of the input block of characters. A selector selects the index generated by of one of the plurality hash index generators to index into the hash table based on the type of the input block. | 12-29-2016 |
| 20170237445 | METHODS AND SYSTEMS FOR DATA ANALYSIS AND COMPRESSION | 08-17-2017 |
| 20170237446 | DATA FEED ACCELERATION | 08-17-2017 |
| 20180026651 | TECHNOLOGIES FOR PERFORMING LOW-LATENCY DECOMPRESSION WITH TREE CACHING | 01-25-2018 |
| 20180026653 | TECHNOLOGIES FOR EFFICIENTLY COMPRESSING DATA WITH RUN DETECTION | 01-25-2018 |
| 20180026654 | TECHNOLOGIES FOR HIGH-PERFORMANCE SINGLE-STREAM LZ77 COMPRESSION | 01-25-2018 |
| 20180026655 | TECHNOLOGIES FOR PERFORMING SPECULATIVE DECOMPRESSION | 01-25-2018 |
| 20180026656 | TECHNOLOGIES FOR HEURISTIC HUFFMAN CODE GENERATION | 01-25-2018 |
| 20190149824 | Method and Apparatus for Multi-Table Based Context Adaptive Binary Arithmetic Coding | 05-16-2019 |
