| Entries |
| Document | Title | Date |
|---|
| 20100188273 | 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 reducing redundant data blocks by decoding a first data block from a first plurality of data blocks and a bitstream. | 07-29-2010 |
| 20100289676 | DATA COMPRESSION/DECOMPRESSION METHOD AND COMPUTER READABLE STORAGE MEDIUM STORING COMPRESSION/DECOMPRESSION PROGRAM - Repetitive portions are sequentially detected in compression target data, and it is determined whether the approximately corresponding position of each repetitive portion is under a word-repetition condition, which is a position corresponding to a multiple of a length of an instruction word, or whether the position is under a byte-repetition condition. When it is under a word-repetition condition, a word-repetition code including at least a value obtained by dividing an approximately corresponding position by an instruction word length and a value specifying a length of a corresponding portion is generated and output as compressed data. When it is a byte-repetition condition, a byte-repetition code including at least a value specifying an approximately corresponding position and a value specifying a length of a corresponding portion is generated and output as compressed data. | 11-18-2010 |
| 20100295713 | CODING APPARATUS, DECODING APPARATUS, CODE TRANSFORMING APPARATUS, AND PROGRAM - An coding apparatus includes a number-of-additional-bits calculating means | 11-25-2010 |
| 20100309031 | TIME-OF-FLIGHT MEASURING DEVICE - A time-of-flight measuring device for performing a hardware-based high-speed data compression process before transferring the data from a signal recorder to a data processor is provided. A time-series digital signal recorded by a signal recorder is converted to a plurality of time-series digital signals by being divided into a bit string including baseline information and a bit string not including the baseline information. Then, the time-series digital signal consisting of a bit string not including the baseline information is compressed by run-length encoding, such as zero length encoding or switched run-length encoding. Subsequently, static Huffman coding is performed on each of the time-series digital signals to reduce the data amount. | 12-09-2010 |
| 20100315270 | DIGITAL SIGNAL CODING METHOD AND APPARATUS, DIGITAL SIGNAL DECODING APPARATUS, DITIGAL SIGNAL ARITHMETIC CODING METHOD AND DIGITAL SIGNAL ARITHMETIC DECODING METHOD - In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset. | 12-16-2010 |
| 20100321217 | CONTENT ENCODING - 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 one or more repetitive sequence of symbols in the data stream, encoding each of the one or more repetitive sequence, replacing the one or more repetitive sequence of symbols that has been encoded with a single symbol representing the one or more repetitive sequence, repeating the steps until all repetitive sequences identified in the symbols of data stream are encoded, wherein the encoding is preformed by computing a binomial coefficient for each of the one or more repetitive sequences identified, forming a reduced sequence of symbols that were not encoded and statistically encoding the reduced sequence. | 12-23-2010 |
| 20100321218 | LOSSLESS CONTENT ENCODING - 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 one or more repetitive sequence of symbols in the data stream, encoding each of the one or more repetitive sequence, replacing the one or more repetitive sequence of symbols that has been encoded with a single symbol representing the one or more repetitive sequence, repeating the steps until all repetitive sequences identified in the symbols of data stream are encoded, wherein the encoding is preformed by computing a binomial coefficient for each of the one or more repetitive sequences identified, forming a reduced sequence of symbols that were not encoded and further encoding the reduced sequence using a binomial encoding process. Other embodiments are also disclosed. | 12-23-2010 |
| 20110001643 | SYSTEM AND METHOD FOR PROVIDING HIGH THROUGHPUT ENTROPY CODING USING SYNTAX ELEMENT PARTITIONING - A system and method for providing high throughput entropy coding contains the steps of: dividing syntax elements of video into one or more group of syntax elements; placing each group into a separate partition, resulting in more than one partition; and processing more than one of the more than one partition in parallel using entropy coding. | 01-06-2011 |
| 20110037626 | Data Compression Systems and Methods - Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified. | 02-17-2011 |
| 20110043389 | Data Compression - A system and method of compression is disclosed that includes the generation of position codes based on positions of individual codes. Individual codes having the same value are adjacent in the position code and are separated by a spacer code. The position codes can be generated from individual codes in increasing value or decreasing value of the individual codes. The position code can be prefixed by a maximum value of the individual codes or prefixed by a total number of the individual codes. The individual codes can be representative of an audio or a video data stream. | 02-24-2011 |
| 20110063143 | Data processing apparatus and method - An apparatus includes: a storage storing data input and sliding stored data per input; first and second comparators comparing in parallel the input data with each stored data and obtaining a position of data matching the input data; first and second determiners each determining whether a stored data matches the input data; a holder holding the result by the first or second comparator; a generator generating a value representing the position; a generator obtaining a longest length of a matching data list of the stored data that match the input data compared by the second comparator and that is at positions consecutive over each input, and generating a value representing the length; a generator generating a value using the input data as is; and a generator generating a code including these values. The comparison by the second comparator is controlled based on the result by the first or second comparator. | 03-17-2011 |
| 20110102210 | DIGITAL SIGNAL CODING METHOD AND APPARATUS, DIGITAL SIGNAL DECODING APPARATUS, DITIGAL SIGNAL ARITHMETIC CODING METHOD AND DIGITAL SIGNAL ARITHMETIC DECODING METHOD - In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset. | 05-05-2011 |
| 20110163898 | METHOD AND APPARATUS FOR COMPRESSING NUCLEOTIDE SEQUENCE DATA - The invention provides a data compression method, comprising: (a) obtaining a first reading sequence and a second reading sequence from an identical source by a receiving unit; (b) comparing the first reading sequence with the second reading sequence according to a comparison condition to generate a sequence comparison result by the processor; (c) outputting a final template sequence according to the sequence comparison result by the processor; (d) comparing the final template sequence to each of the first and second reading sequences, to generate a respective difference between the final template sequence and each of the first and second reading sequences by the processor; and (e) compressing the first and second reading sequences according to the final template sequences and all generated differences between the final template sequence and the first and second reading sequences, to generate a compression file by the processor. | 07-07-2011 |
| 20110210875 | ENCODING METHOD AND ENCODING APPARATUS FOR B-TRANSFORM, AND ENCODED DATA FOR SAME - The present disclosure relates to an encoding method and to an encoding apparatus for B-transform, and to encoded data for same. The apparatus is for encoding input data and includes: a B-transform unit for performing a B-transform on the input data to generate a binary expression; and an encoder for removing one or more binary symbols from the binary expression and scanning the binary expression with the one or more binary symbols removed to generate a bitstream. According to the present disclosure, it is possible to encode uniform distribution data efficiently, and using the B-transform by its characteristics for reducing the bit number in the generation of the binary expressions from the B-transform operation on the uniform distribution data enhances the data compression performance. | 09-01-2011 |
| 20110227765 | 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 |
| 20110254712 | METHODS AND DEVICES FOR REORDERED PARALLEL ENTROPY CODING AND DECODING - A method for parallel context modeling through reordering the bits of an input sequence to form groups of bits in accordance with a context model-specific reordering schedule. The reordering schedule is developed such that the groups of bits are formed to satisfy two conditions: first, that the context for each of the bits in a group of bits is different from the context of each of the other bits in that group, and the context of each of the bits in that group is determined independently from each of the other bits in that group. The parallel context modeling may be used in encoding or decoding operations. | 10-20-2011 |
| 20110254713 | ENCODING METHOD AND DECODING METHOD, AND DEVICES, PROGRAM AND RECORDING MEDIUM FOR THE SAME - Information that includes first information identifying integer quotients obtained by divisions using prediction residuals or integers not smaller than 0 that increase monotonically with increases in the amplitude of the prediction residuals, as dividends, and a separation parameter decided for a time segment corresponding to the prediction residuals or a mapped integer value of the separation parameter, as a modulus, and second information identifying the remainders obtained when the dividends are divided by the modulus is generated as a code corresponding to the prediction residuals, and each piece of side information that includes the separation parameter is subjected to variable length coding. | 10-20-2011 |
| 20110279293 | COMPRESSION AND DECOMPRESSION OF NUMERICAL DATA - The invention relates to a computer-implemented method for compressing numerical data comprising a structured set of floating point actual values. A floating point value is defined by a sign, an exponent and a mantissa. The method comprises computing a floating point predicted value related to a target actual value of the set. The computing includes performing operations on integers corresponding to the sign, to the exponent and/or to the mantissa of actual values of a subset of the set. The method also comprises storing a bit sequence representative of a difference between integers derived from the target actual value and the predicted value. Such a method is particularly efficient for reducing the storage size of a CAD file. | 11-17-2011 |
| 20110279294 | Parallel Processing of Sequentially Dependent Digital Data - Systems and methods decode sequentially-dependent data by using a plurality of processing units substantially in parallel. A splitting procedure determines at least one splitting point dividing a data-stream into at least two portions and each processing unit is assigned one portion of the data-stream for decoding. A skimming procedure is performed by at least one processing unit to decode relevant data for at least one portion of the data-stream, where the relevant data is sufficient to enable a processing unit to fully decode another portion of the data-stream. Each processing unit then performs a scanning procedure to fully decode its assigned portion of data-stream substantially in parallel. | 11-17-2011 |
| 20110285559 | Data Compression Systems and Methods - Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified. | 11-24-2011 |
| 20120001777 | SELECTIVE DATA COMPRESSION - A method and apparatus are described for determining whether to convey a communication signal in a compressed form along a communication path. The method comprises the steps of: (i) providing the communication signal that should be conveyed along said communication path; (ii) determining whether at least part of the communication signal comprises data having a non-random distribution; (iii) if the at least part of the communication signal is determined to comprise data having at least partially a non-random distribution, applying a compression algorithm onto that at least part of the communication signal to form a compressed form of the communication signal provided; and (iv) conveying the communication signal in its compressed form along the communication path. | 01-05-2012 |
| 20120044097 | 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 original context model. According to an exemplary embodiment of the method empirical statistics are determined for a file type of a file to be compressed; and the context model is generated by iteratively grouping contexts of an initial context model in accordance with the empirical statistics, the context model having fewer contexts than an initial context model. | 02-23-2012 |
| 20120056763 | SYSTEMS AND METHODS FOR DATA COMPRESSION - In one embodiment, an initial series of bytes are scanned to determine a frequency of occurrence within the initial series of bytes for a plurality of byte strings. A data structure is generated containing the plurality of byte strings and count values representing a frequency of occurrence for the plurality of byte strings in the initial series of bytes. A most common byte string of the plurality of byte strings in the initial series of bytes is determined from the count values. Each instance of the most common byte string in the initial series of bytes is replaced with a first substitute byte string to form a revised series of bytes. A most common byte string in the revised series of bytes is determined from the data structure without resetting the count values associated with at least some of the plurality of byte strings. | 03-08-2012 |
| 20120086585 | LOCAL BINARY XML STRING COMPRESSION - Targeted compression of strings is provided for XML and other documents using local tables whose scope need not align with syntactically well-formed document regions. The local table's scope is fixed (not sliding), and may be nested within other local table scopes. A string is nominated for inclusion, and record(s) are inserted in a document encoding to effect the nomination. The nominated string is placed in the local table in correspondence with a token identifier. During compression, reference(s) to the string's token identifier are included in the document encoding; during decompression the references are replaced by the string. The local table is deleted at the end of its scope. Tables may have multiple channels, with nominated strings placed in a channel based on frequency of references to the strings. The document encoding may include the local table(s), static table(s), and dynamic table(s) in a flat token value space. | 04-12-2012 |
| 20120086586 | METHOD AND DEVICE FOR PULSE ENCODING, METHOD AND DEVICE FOR PULSE DECODING - The present invention discloses a method and a device for pulse encoding, and a method and a device for pulse decoding. The method for pulse encoding includes: calculating an index value of an input pulse; selecting an adjustment threshold value according to the number of pulses, and comparing the index value of the pulse with the adjustment threshold value; if the index value is smaller than the adjustment threshold value, adopting the first number of encoding bits to encode the index value, if the index value is not smaller than the adjustment threshold value, adopting the second number of encoding bits to encode the index value plus an offset value, where the first number is smaller than the second number, the first number and the second number are both positive integers, and the offset value is greater than or equal to the adjustment threshold value. | 04-12-2012 |
| 20120098681 | HISTORY BUFFER APPARATUS AND METHOD FOR ADAPTIVE LOSSLESS DATA COMPRESSION - A history buffer for use in adaptive lossless data compression comprises a plurality of memory locations. The memory locations are partitioned into two or more segments, each segment configured to detect a match sequence independently of the other segments. Control logic is provided for controlling the detection of match sequences between the two or more segments. | 04-26-2012 |
| 20120112934 | METHOD FOR VECTOR QUANTIZATION OF A FEATURE VECTOR - The invention relates to a method for the vector quantization of a feature vector, in particular with respect to a data compression of a signal to be transmitted or to be stored, particularly a voice signal or a video signal, wherein at least one codebook from a plurality of codebook vectors is searched for a code vector representing the feature vector. During the search, a sequence of codebook vectors is examined for the suitability thereof to represent the feature vector. In the course of the search for the code vector, a set of neighboring vectors is dedicated to at least one of the codebook vectors potentially to be examined, preferably prior to the search. The search for the code vector includes at least part of the neighboring vectors. | 05-10-2012 |
| 20120112935 | METHOD AND APPARATUS FOR COMPRESSING OR DECOMPRESSING DATA IN FIBER CHANNEL SERVICES - The present invention provides a method and apparatus for compressing or decompressing data in Fiber Channel (FC) services. In the solution of the present invention, when compressing FC data, a K code indicator bit and an ERR code indicator bit are compressed into a K/ERR code indicator bit, and 8b codes and the K/ERR code indicator bit are compressed into 9b codes; when decompressing FC data, the 9b code is decompressed into 8b codes and a K/ERR code indicator bit, and the K/ERR code indicator bit is decompressed into a K code indicator bit and an ERR code indicator bit. The solution provided by the present invention overcomes the disadvantages that in conventional art, when processing FC service, the K code indicator bit and the ERR code indicator bit must be retained, and the K code and the ERR code are processed separately, which lead to a high bandwidth utilization ratio and a complex processing procedure. The solution provided by the present invention fully utilizes the current FC service bandwidth, enables to process the FC service with fewer resources, greatly simplifies the FC service processing, and promotes the spread of the FC technology. | 05-10-2012 |
| 20120127002 | CODING METHOD, DECODING METHOD, CODING APPARATUS, AND DECODING APPARATUS - A coding method according to an implementation of the present invention includes: transforming an input signal to generate a transformed output signal (S | 05-24-2012 |
| 20120127003 | CODING METHOD, DECODING METHOD, CODING APPARATUS, AND DECODING APPARATUS - A coding method according to the present invention comprises: transforming an input signal; quantizing a transformed output signal; and entropy coding quantized coefficients, wherein the transforming includes: generating a first transformed output signal by performing a first transform on the input signal using a first transform coefficient; generating a second transformed output signal by performing, using a second transform coefficient, a second transform on a first partial signal which is a part of the first transformed output signal, and outputting the transformed output signal including the generated second transformed output signal and a second partial signal which is the remaining part of the first transformed output signal other than the first partial signal; and modifying the first transformed output signal. | 05-24-2012 |
| 20120133532 | COMPRESSION AND DECOMPRESSION OF MASS SPECTROMETRY DATA - Functionality is described for compressing and decompressing mass spectrometry data, therefore making it easier to store, retrieve, transfer, and process the mass spectrometry data. The functionality operates by mapping data values (e.g., mass-to-charge data values or intensity data values) into index values, and then mapping the index values into delta values. The functionality then uses an encoding algorithm (such as a coding tree) to represent the delta values in compressed form. In a decoding stage, the functionality can interpret each encoded delta value with reference to a chain of preceding delta values, which ultimately link to an initial data value that is expressed in non-relative form. In one implementation, the functionality can define multiple such initial data values which correspond to multiple access points in a stream of compressed mass spectrometry data. | 05-31-2012 |
| 20120182163 | DATA COMPRESSION DEVICES, OPERATING METHODS THEREOF, AND DATA PROCESSING APPARATUSES INCLUDING THE SAME - A method of operating a data compression device includes analyzing data using an analyzer and generating a result of the analysis, while the data is buffered by an input buffer, and selectively compressing the buffered data according to the result of the analysis. A data compression device includes a data pattern analyzer configured to analyze data transmitted to an input buffer, and generate an analysis code based on the analysis of the data; and a data compression manager configured to selectively compress the data in the input buffer based on the analysis code. | 07-19-2012 |
| 20120194361 | Data Compression Using a Stream Selector with Edit-In-Place Capability for Compressed Data - A method for encoding an input file into an output file that is compressed so that the number of bits required to represent the output file is less than the number of bits of the input file. The encoding method includes the parsing of the input file into a series of data items, the data items having an order and collectively corresponding to the input file. The encoding method compares the series of data items against a static dictionary having at least mappings between terminal sequence pointers and representations of data items. | 08-02-2012 |
| 20120194362 | DATA FEED ACCELERATION - The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields. | 08-02-2012 |
| 20120194363 | METHODS AND DEVICES FOR LOAD BALANCING IN PARALLEL ENTROPY CODING AND DECODING - Devices and methods for entropy decoding a bitstream of encoded data by extracting a plurality of encoded subsequences from a payload field of the bitstream for parallel decoding on a set of parallel entropy decoders. The method includes dividing the payload of concatenated encoded subsequences into segments using a distribution function and distributing the segments amongst the set of parallel entropy decoders to balance the computational load among the parallel entropy decoders. The received bitstream includes auxiliary information inserted by the encoder to enable the decoder to entropy decode segments that begin with a portion of an encoded subsequence. | 08-02-2012 |
| 20120218130 | INDEXING COMPRESSED DATA - A method to at least one of compress and decompress data includes providing a string (T) consisting of multiple given substrings. Identification symbols ($,$ | 08-30-2012 |
| 20120223846 | COMPRESSION OF IMU DATA FOR TRANSMISSION OF AP - A method, controller and system in accordance with various aspects of the present disclosure facilitate reduced energy consumption in a motion sensing device having an inertial measurement unit (IMU), with a strap down integration unit, and an application processing unit (AP). The system and method include rounding velocity increments and orientation increments at the inertial measurement unit, thereby producing a remainder values. The remainder values are added to subsequent velocity increments and orientation increments prior to rounding of those values, and so on. In this way, while motion granularity is slightly decreased, there is no drift of integration errors over time. | 09-06-2012 |
| 20120229311 | DEVICE AND METHOD FOR COMPRESSING FEATURE DESCRIPTOR - A method and a device for compressing a feature descriptor are disclosed. The device includes a non-uniform quantizer and a run-length encoder. The non-uniform quantizer accesses a source feature descriptor from a storage device, and non-uniformly quantizes the source feature descriptor having source vectors into an intermediate feature descriptor having intermediate vectors according to a vector default value. The run-length encoder executes run-length coding for the intermediate feature descriptor to generate a compressed feature descriptor. | 09-13-2012 |
| 20120229312 | BAR CODE GENERATION METHOD USING COLOR CODE, DATA COMPRESSION METHOD, AND INTERNET SERVICE METHOD THEREOF - A method and a system for exchanging electronic information data, using a color code recognition device are provided. An electronic information data from the first computer is recognized in either in the ASCII code or in the binary digit format. The electronic information data is encoded by substituting each character of the ASCII codes or the binary digit recognized with a color value. The encoded data is transmitted to the second computer, and the transmitted data is decoded into the original electronic information data. The system for exchanging an electronic information data includes a storage device for storing the user identification database and the legend database, an encoding device for encoding the electronic information data, a decoding device for decoding the encoded data to restore the encoded data into its original format, and a network device for transmitting the data between a plurality of computers over the network. | 09-13-2012 |
| 20120242519 | METHOD AND APPARATUS FOR DATA COMPRESSION - A method of data compression is provided. The method comprises, dividing a stream of sequentially received-generated data coefficients into multiple sets of data coefficients, each set of data coefficients representing a time period and, for each set of data coefficients, selecting N data coefficients having the greatest magnitude, and ordering the N data coefficients according to their magnitude; selecting, for each N ordered data coefficients, a subset of data coefficients having a magnitude greater than a threshold value; comparing the data coefficient with the greatest magnitude from each subset to one another and selecting the Q largest data coefficients; and repeating the previous comparison step excluding the previously selected Q data coefficients until a total of P data coefficients have been selected, where N>P>Q. | 09-27-2012 |
| 20120256771 | METHOD FOR COMPRESSION AND REAL-TIME DECOMPRESSION OF EXECUTABLE CODE - Systems, methods, and other embodiments associated with compression and real-time decompression of executable code are described. According to one embodiment, an apparatus includes a memory that stores compressed blocks of data. The data is executable code for a processing element. The apparatus also includes a decompression logic. The decompression logic receives a request from the processing element for data and determines a compressed block that stores the data. The compressed block is decompressed to produce an uncompressed block. The decompression logic then provides the requested data to the processing element. In one embodiment an uncompressed block has a predetermined fixed block size. The predetermined fixed block size is selected based on at least one of an amount of uncompressed data, a desired compression ratio, and a desired access time. | 10-11-2012 |
| 20120262312 | COMPRESSION PRODUCING OUTPUT EXHIBITING COMPRESSION RATIO THAT IS AT LEAST EQUAL TO DESIRED COMPRESSION RATIO - An embodiment may include first circuitry and second circuitry. The first circuitry may compress, at least in part, based at least in part upon a first set of statistics, input to produce first output exhibiting a first compression ratio. If the first compression ratio is less than a desired compression ratio, the second circuitry may compress, at least in part, based at least in part upon a second set of statistics, the first output to produce second output. The first set of statistics may be based, at least in part, after an initial compression, upon other data that has been previously compressed and is associated, at least in part, with the input. The second set of statistics may be based at least in part upon the input. Many alternatives, variations, and modifications are possible. | 10-18-2012 |
| 20120262313 | METHODS AND DEVICES FOR CODING AND DECODING THE POSITION OF THE LAST SIGNIFICANT COEFFICIENT - Methods and devices are described for entropy coding data using an entropy coder to encode quantized transform domain coefficient data. Last significant coefficient information is signaled in the bitstream using two-dimensional coordinates for the last significant coefficient. The context for bins of one of the coordinates is based, in part, upon the value of the other of the coordinates. In one case, instead of signaling last significant coefficient information, the number of non-zero coefficients is binarized and entropy encoded. | 10-18-2012 |
| 20120262314 | 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. | 10-18-2012 |
| 20120268298 | METHOD AND APPARATUS FOR COMPRESSING AND DECOMPRESSING BLOCK UNIT DATA - An apparatus for compressing and decompressing data is disclosed. The apparatus for compressing data includes a block setting unit that divides data of at least one original file into two or more blocks, a compression unit that generates block compression data by applying a compression algorithm to data corresponding to at least one block among blocks divided by the block setting unit, and a compression file generation unit that generates a block header and the block body of the block for each block divided by the block setting unit, in which the block body includes the block compression data if the block is compressed by the compression unit or includes the original data of the block if the block is not compressed the by compression unit. | 10-25-2012 |
| 20120293344 | COMPRESSING AND DECOMPRESSING DATA - A technique includes compressing or decompressing data using a relative displacement of a location of a data pattern. | 11-22-2012 |
| 20120319876 | Method and System for Data Compression - In one aspect, methods and systems for variable-block length encoding of data, such as an inverted index for a file are disclosed. These methods and systems provide for relatively fast encoding and decoding, while also providing for compact storage. Other aspects include a nearly 1:1 inverted index comprising a position vector and a data store, wherein values that have a unique location mapping are represented directly in the position vector, while for 1:n values (n>1), the position vector can include a pointer, and potentially some portion of information that would typically be stored in the data area, in order to fully use fixed width portions of the position vector (where a maximum pointer size is smaller than a maximum location identifier size). | 12-20-2012 |
| 20130044011 | ENCODING DATA BASED ON WEIGHT CONSTRAINTS - A method for encoding data to be placed into a weight constrained memory array includes designating a set of crosspoints within a crossbar memory array as indicator crosspoints and a set of crosspoints within the memory array as data crosspoints, the set of indicator crosspoints selected so that a net number of times that each data crosspoint has been flipped can be determined from a subset of the set of indicator crosspoints, placing an input stream of data into a matrix corresponding to crosspoints within the memory array, bits of the input stream being placed into matrix elements that correspond to data crosspoints of the memory array, setting each matrix element corresponding to indicator crosspoints to a value corresponding to a fixed resistive state, and flipping each bit corresponding to a conductor of the memory array until no conductors within the memory array violate a weight constraint. | 02-21-2013 |
| 20130044012 | METHOD AND APPARATUS FOR COMPRESSION AND DE-COMPRESSION OF SPECTRAL DATA - A method and apparatus for data compression, particularly applicable to spectral signals such as Fast Fourier Transforms of vibration data. The data is merged to remove redundant frequencies when recorded at multiple sample rates, thresholded with respect to a noise floor to remove even more redundant data, and then the positions of non-zero signal values, with respect to the noise floor, are recorded in a first dataword and the non-zero signal values themselves are all recorded concatenated to form a second dataword. The compressed data set consists of the first and second datawords, together with the value of the noise floor, maximum original amplitude and the broadband power. In the event of successive data sets having the same or similar locations for non-zero signal values a re-use flag may be set and the locations dataword discarded. Preferably the signal values are non-linearly quantized to further reduce the amount of data. | 02-21-2013 |
| 20130063288 | METHODS AND COMPUTER PROGRAM PRODUCTS FOR PROVIDING A COMPRESSED CIRCULAR BUFFER FOR EFFICIENT STORAGE OF NETWORK PERFORMANCE DATA - Provided are methods and computer program products for providing a circular buffer of values representing performance data that corresponds to a network application on a network device. Methods may include compressing a binary representation of a value using bit-oriented compression that is biased based on a frequency of occurrence of values and/or value ranges, and appending the compressed binary representation to a circular buffer. The bit-oriented compressed may be biased such that values and/or value ranges that occur with a higher degree of frequency are compressed to a higher degree, while values and/or value ranges that occur with a lower degree of frequency are compressed to a lower degree. | 03-14-2013 |
| 20130088373 | DATA COMPRESSION APPARATUS AND DATA COMPRESSION METHOD - A size comparison unit reports, to an access control unit, the size of a piece of compressed data having the smallest size from among pieces of compressed data generated via compression processing units compressing blocks, an algorithm name representing a compression processing unit that has generated the piece of compressed data having the smallest size; the access control unit selects a piece of compressed data to be written in a tape medium and reports, to a statistical information processing unit, an algorithm name representing a compression processing unit that has generated this selected piece of compressed data; the statistical information processing unit extracts, from the reported algorithm name, a regularity present in a result of the selection of compressed data and, in accordance with this extracted regularity, specifies and stops a compression processing unit to be stopped. | 04-11-2013 |
| 20130120167 | Systems and Methods for Memory Efficient Data Decoding - Various embodiments of the present invention provide systems and methods for data processing. For example, a data processing system is disclosed that includes a data decoder circuit. The data decoder circuit is operable to: apply a decoding algorithm to a decoder input on a first decoder iteration to yield a first decoder output; compress an output derived from the first decoder output to yield a compressed decoder output; de-compress the compressed decoder output to yield a second decoder output; and apply the decoding algorithm to the second decoder output to yield a third decoder output. | 05-16-2013 |
| 20130293400 | METHOD FOR COMPRESSING DIGITAL VALUES OF IMAGE, AUDIO AND/OR VIDEO FILES - A method for differential compression of a sequence of digital values adapted to avoid error propagation during restoration of the values. | 11-07-2013 |
| 20130307709 | EFFICIENT TECHNIQUES FOR ALIGNED FIXED-LENGTH COMPRESSION - Systems and methods for performing compression of data. A data buffer is separated into equal-sized segments of data. A frequency count is performed to determine how often each segment of data appears in the data buffer. Frequently occurring segments are encoded with unique compression codes, while all other infrequently occurring segments are encoded with a common compression code. The compressed data buffer includes the compression codes, which are all of the same bit-length, and the uncompressed segments. The compression codes and the uncompressed segments are stored in the compressed data buffer in the order in which the corresponding segments appear in the original data buffer. | 11-21-2013 |
| 20130314260 | METHOD FOR REDUCING ULTRASOUND DATA - A method for reducing ultrasound data from an ultrasound signal includes rectifying the ultrasound signal and generating an envelope curve about maximum values of the rectified ultrasound signal. Each ultrasound pulse is represented as a curve portion with a single maximum value. A first negative envelope curve signal, which is reduced by a first factor f, and a delayed envelope curve signal which is not modified but is delayed by a time period t | 11-28-2013 |
| 20130321181 | COMPRESSING AND DECOMPRESSING SIGNAL DATA - The present invention relates to data compression and decompression, and particularly relates to a method and an apparatus for compressing and decompressing signal data. In an embodiment of the present invention, there is disclosed a method for compressing signal data, comprising: obtaining signal data; determining block lengths of a plurality of data blocks into which the signal data are divided, and determining exponents of the data blocks; forming a mantissa sequence of the data block by using the exponent of the data block to compress signal data contained in the data block; and forming a compressed data block by using the block length, the exponent and the mantissa sequence of the data block. By constructing a variable-length data block adapted to dynamic characteristics of signal data, the method for compressing signal data of the present invention increases the compression ratio of signal data. | 12-05-2013 |
| 20130321182 | COMPRESSING AND DECOMPRESSING SIGNAL DATA - The present invention relates to data compression and decompression, and particularly relates to a method and an apparatus for compressing and decompressing signal data. In an embodiment of the present invention, there is disclosed a method for compressing signal data, comprising: obtaining signal data; determining block lengths of a plurality of data blocks into which the signal data are divided, and determining exponents of the data blocks; forming a mantissa sequence of the data block by using the exponent of the data block to compress signal data contained in the data block; and forming a compressed data block by using the block length, the exponent and the mantissa sequence of the data block. By constructing a variable-length data block adapted to dynamic characteristics of signal data, the method for compressing signal data of the present invention increases the compression ratio of signal data. | 12-05-2013 |
| 20130342375 | DATA COMPRESSION AND MANAGEMENT - The present disclosure includes apparatuses and methods for data compression and management. A number of methods include receiving a number of data segments corresponding to a managed unit amount of data, determining a respective compressibility of each of the number of data segments, compressing each of the number of data segments in accordance with its respective determined compressibility, forming a compressed managed unit that includes compressed and/or uncompressed data segments corresponding to the number of data segments corresponding to the managed unit amount of data, and forming a page of data that comprises at least the compressed managed unit. | 12-26-2013 |
| 20140022098 | DATA COMPRESSION SYSTEMS AND METHODS - Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified. | 01-23-2014 |
| 20140022099 | METHODS FOR ENCODING AND DECODING DATA - The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields. | 01-23-2014 |
| 20140022100 | METHODS FOR ENCODING AND DECODING DATA - The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields. | 01-23-2014 |
| 20140028479 | DATA TRANSLATION SYSTEM AND METHOD - A data translation system and method. This invention provides a reverse approach to implement a M bit input to N bit output cumulative/monotonic transfer function, (where M>N) by a (2**N)×M bit memory instead of the conventional (2**M)×N bit memory. The invention offers substantial circuit size savings without compromising on transfer function resolution and is independent of transfer function mapping algorithms. The M bit memory content of the reverse LUT contains input video group information for each output level and the (2**N) addresses of the reverse LUT represent the corresponding transfer function output levels. This data to address representation of the input to output relationship is exactly opposite to the conventional address to data format. Search and compare methods are employed to locate the input video group that the incoming video belongs to and the associated address of the reverse LUT represents the output. | 01-30-2014 |
| 20140028480 | METHODS FOR ENCODING AND DECODING DATA - The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields. | 01-30-2014 |
| 20140049412 | DATA COMPRESSION UTILIZING LONGEST COMMON SUBSEQUENCE TEMPLATE - In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output. | 02-20-2014 |
| 20140049413 | DATA COMPRESSION UTILIZING LONGEST COMMON SUBSEQUENCE TEMPLATE - In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output. | 02-20-2014 |
| 20140091953 | METHOD AND APPARATUS FOR COMPRESSION OF GENERALIZED SENSOR DATA - Methods and apparatus for compression of generalized sensor data are described. One example method for use in compression of generalized sensor data at a first location for transmission to a second location includes analyzing the sensor data to identify high interest data and low interest data, and compressing the high interest data with a lossless compression algorithm. | 04-03-2014 |
| 20140097974 | DATA COMPRESSION - An exemplary encoder device includes a data storage comprising an indication of a coordinate system and a set of symbols, each having at least one coordinate position in the coordinate system. A processor associated with the data storage is configured to encode at least one symbol within information comprising a plurality of symbols using the coordinate position of the at least one symbol relative to the coordinate position of another symbol within the information. | 04-10-2014 |
| 20140104084 | OPTIMIZED BITSTREAM ENCODING FOR COMPRESSION - An apparatus includes a first circuit and a second circuit. The first circuit may be configured to generate (i) a compressed representation of an input sequence of characters and (ii) statistics regarding one or more types of information in the compressed representation of the input sequence of characters. The second circuit may be configured to generate a compressed bitstream representation of the input sequence of characters in response to the compressed representation of the input sequence of characters and one or more of the statistics regarding the one or more types of information in the compressed representation of the input sequence of characters. The bitstream values encoding the one or more types of information are generally determined based upon a frequency of occurrence of the one or more types of information in the compressed representation of the input sequence of characters. | 04-17-2014 |
| 20140104085 | OPTIMIZING COMPRESSION ENGINE THROUGHPUT VIA RUN PRE-PROCESSING - An apparatus includes a first circuit and a second circuit. The first circuit may be configured to generate a reduced representation of an input sequence of characters by replacing a repetition of a sequence of one or more characters by a code representing the repetition of the sequence of one or more characters. The second circuit may be configured to generate a compressed representation of the input sequence of characters in response to the reduced representation of the input sequence of characters. The second circuit is generally configured to recognize the code representing the repetition of the sequence of one or more characters and take into account the repetition of the sequence of one or more characters during a compression operation. | 04-17-2014 |
| 20140118171 | COORDINATE COMPRESSION USING POLYNOMIALS - A method for compressing a plurality of coordinates includes obtaining a plurality of approximately-zero polynomials of dimension dim for a plurality of coordinate parameters. The method further includes selecting dim+1 non-approximately-zero polynomials, and providing a compressed data set that includes the approximately-zero polynomials, the dim+1 non-approximately-zero polynomials, and evaluations of the selected dim+1 non-approximately-zero polynomials based on the coordinates. | 05-01-2014 |
| 20140132429 | Method for data compression and inference - Lossless and lossy codes are combined for data compression. In one embodiment, the most significant bits of each value are losslessly coded along with a lossy version of the original data. Upon decompression, the lossless reduced-precision values establish absolute bounds for the lossy code. Another embodiment losslessly codes the leading bits while trailing bits undergo lossy coding. Upon decompression, the two codes are summed. The method preserves edges and other sharp transitions for superior lossy compression. Additionally, the method enables description-length inference using noisy data. | 05-15-2014 |
| 20140145866 | DATA PROCESSING APPARATUS AND METHOD - A data processing apparatus and a data processing method thereof are provided. The data processing apparatus includes a register and a processor electrically connected to the register. The register is stored with a plurality of data. The plurality of data each includes a first sub-datum and a second sub-datum. The plurality of first sub-data corresponds to a first column and the plurality of second sub-data corresponds to a second column. The processor compresses the first sub-data by a first compression algorithm according to a first characteristic of the plurality of first sub-data and compresses the second sub-data by a second compression algorithm according to a second characteristic of the plurality of second sub-data. | 05-29-2014 |
| 20140152475 | DATA COMPRESSION DEVICES, OPERATING METHODS THEREOF, AND DATA PROCESSING APPARATUSES INCLUDING THE SAME - A method of operating a data compression device includes analyzing data using an analyzer and generating a result of the analysis, while the data is buffered by an input buffer, and selectively compressing the buffered data according to the result of the analysis. A data compression device includes a data pattern analyzer configured to analyze data transmitted to an input buffer, and generate an analysis code based on the analysis of the data; and a data compression manager configured to selectively compress the data in the input buffer based on the analysis code. | 06-05-2014 |
| 20140176353 | COMPRESSION FORMAT FOR HIGH BANDWIDTH DICTIONARY COMPRESSION - Method, apparatus, and systems employing dictionary-based high-bandwidth lossless compression. A pair of dictionaries having entries that are synchronized and encoded to support compression and decompression operations are implemented via logic at a compressor and decompressor. The compressor/decompressor logic operatives in a cooperative manner, including implementing the same dictionary update schemes, resulting in the data in the respective dictionaries being synchronized. The dictionaries are also configured with replaceable entries, and replacement policies are implemented based on matching bytes of data within sets of data being transferred over the link. Various schemes are disclosed for entry replacement, as well as a delayed dictionary update technique. The techniques support line-speed compression and decompression using parallel operations resulting in substantially no latency overhead. | 06-26-2014 |
| 20140184431 | METHODS FOR SIMPLIFIED MMI VQ BASED HARQ BUFFER REDUCTION FOR LTE - Methods of simplified MMI VQ based HARQ buffer reduction are disclosed. In one embodiment of the invention, the VQ obtains distribution information from source data based on a predefined codebook subset design. The subset design is predefined. Source data is trained within its corresponding subset to generate codebook. In one embodiment of the invention, the predefined subset algorithm is based on the LLR sign value. In another embodiment of the invention, source data is divided into subset based on predefined algorithm. The index to codebook is generated by search through the corresponding subset of the codebook instead of the whole codebook. In one embodiment of the invention, the training method is a modified Lloyd algorithm for MMI VQ. In another embodiment of the invention, the training method is a modified Lloyd algorithm for Euclidean distance VQ. | 07-03-2014 |
| 20140292549 | WAVELET-BASED SEISMIC DATA COMPRESSION - This invention is for a method for transforming a seismic trace into a compressed domain. The seismic source wavelet is transformed into a zero degree phase wavelet and a shifted 90 degree phase wavelet, and the two wavelets span a 2-dimensional sub-space. A dictionary is created by collecting the wavelets in the sub-space. In practice this dictionary is usually combined with conventional existing wavelet dictionaries. The seismic trace is projected onto the dictionary (sub-space alone or combined) to find the best matching projection, with a residual determined after each projection, wherein the sum of the residuals determines the fidelity of the data compression. | 10-02-2014 |
| 20140313064 | ENCODING APPARATUS, DECODING APPARATUS, ENCODING METHOD, ENCODING PROGRAM, DECODING METHOD, AND DECODING PROGRAM - A data predicted value generating unit generates a predicted value (data predicted value) for original data intended to be encoded, based on a history of original data which is floating-point data. A data predicted value modifying unit adjusts a mantissa value of the data predicted value by aligning an exponent value of the data predicted value with an exponent value of the original data. A first residual generating unit generates a residual (first residual) between new original data and the data predicted value after being adjusted. A first residual predicted value generating unit generates a predicted value for the first residual (first residual predicted value), based on a history of first residuals. A second residual generating unit generates a residual (second residual) between the first residual and the first residual predicted value. A residual encoding unit generates encoded data by encoding the second residual. | 10-23-2014 |
| 20140361911 | METHODS AND SYSTEMS FOR STORING SEQUENCE READ DATA - The present invention generally relates to storing sequence read data. The invention can involve obtaining a plurality of sequence reads from a sample, identifying one or more sets of duplicative sequence reads within the plurality of sequence reads, and storing only one of the sequence reads from each set of duplicative sequence reads in a text file using nucleotide characters. | 12-11-2014 |
| 20140375484 | DYNAMIC COMPRESSION/DECOMPRESSION (CODEC) CONFIGURATION - The present disclosure is directed dynamic compression/decompression (codec) configuration. In general, a device may include a codec configuration module to determine a configuration for use by the codec based on configuration criteria. The configuration criteria may include, for example, data characteristic information, system condition information and user expectation information. The configuration information may be used to select a codec configuration from one or more available codec configurations. For example, a benchmark module also in the device may determine the available codec configurations. After a codec configuration has been selected, it may be set in the codec. It may also be possible for the codec configuration module to monitor for changes in device operation (e.g., changes in the configuration criteria) and to update the codec configuration based on the monitored changes. | 12-25-2014 |
| 20150009051 | Data Compression Systems and Methods - Data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a system for compressing data comprises: a processor; one or more content dependent data compression encoders; and a single data compression encoder. The processor is configured to analyze data within a data block to identify one or more parameters or attributes of the data wherein the analyzing of the data within the data block to identify the one or more parameters or attributes of the data excludes analyzing based solely on a descriptor that is indicative of the one or more parameters or attributes of the data within the data block; to perform content dependent data compression with the one or more content dependent data compression if the one or more parameters or attributes of the data are identified; and to perform data compression with the single data compression encoder, if the one or more parameters or attributes of the data are not identified. | 01-08-2015 |
| 20150042495 | USING VARIABLE ENCODINGS TO COMPRESS AN INPUT DATA STREAM TO A COMPRESSED OUTPUT DATA STREAM - Provided are a computer program product, system, method, and data structure for compressing an input data stream. A determination is made of consecutive data units in the input data stream that match consecutive data units in a history buffer. A copy pointer symbol indicates a copy pointer symbol referencing previously received data units in the history buffer. A determination is made of a relative displacement count in the history buffer at which the number of matching consecutive data units start. A determination is made of a range of relative displacement counts comprising one of a plurality of ranges of displacement counts including the determined relative displacement count. A determination is made of the encoding scheme associated with the determined range. An encoding of the relative displacement count is determined from the determined encoding scheme. The determined encoding of the relative displacement count is indicated in the copy pointer. | 02-12-2015 |
| 20150061903 | LOSSLESS COMPRESSION OF THE ENUMERATION SPACE OF FOUNDER LINE CROSSES - Various embodiments provide lossless compression of an enumeration space for genetic founder lines. In one embodiment, an input comprising a set of genetic founder lines and a maximum number of generations G is obtained. A set of genetic crossing templates of a height h is generated. A determination is made if at least a first genetic crossing template in the set of genetic crossing templates is redundant with respect to a second genetic crossing template in the set of genetic crossing templates. Based on the at least first genetic crossing template being redundant is redundant with respect to the second genetic crossing template, the at least first genetic crossing template is removed from the set of genetic crossing templates. This process of removing the at least first genetic crossing template from the set of genetic crossing templates the redundant creates an updated set of genetic crossing templates. | 03-05-2015 |
| 20150123825 | TECHNIQUES FOR COMPRESSING MASS SPECTROMETRY DATA IN REAL-TIME - Techniques are described for performing data compression of a first data set including data points in a plurality of dimensions. First processing is performed to determine a second set of final sums. For each data point in the first data set, a corresponding final sum of the second set is determined that is a sum of intensities associated with a first portion of data points, wherein the first portion of data points for which the intensities are summed for said each data point are included within a geometric shape centered on said each data point. Second processing is performed to determine a final set of final combined keep values. Each of the final combined keep values corresponds to a different one of the data points in the first data set and denotes whether to keep or otherwise remove the different one of the data points from the first data set. | 05-07-2015 |
| 20150358030 | Compression and De-Compression of Complex Valued OFDM Data for a Radio Base Station - A compression method is disclosed, which comprises receiving an OFDM data block comprising a plurality of complex valued data samples wherein each in-phase and quadrature sample value is represented by a first number of bits. The method also comprises calculating an average of absolute sample values of the OFDM data block and mapping the average absolute sample value to a standard deviation value. The method further comprises quantizing each of the sample values using quantization thresholds scaled by the standard deviation value to produce quantized in-phase and quadrature sample value representations, each comprising a second number of bits, and mapping the standard deviation value and the quantized sample value representations to an OFDM transmission frame. Corresponding de-compression method, compressor, de-compressor and network node are also disclosed. | 12-10-2015 |
| 20150372692 | GENERATING A CODE ALPHABET OF SYMBOLS TO GENERATE CODEWORDS FOR WORDS USED WITH A PROGRAM - Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet has a first number of symbols that provide variable length codings of the words. A second code alphabet is generated having a second number of symbols formed by merging the symbols in the first code alphabet, wherein the second code alphabet comprises the code alphabet used by the deployed program. | 12-24-2015 |
| 20150381201 | SYSTEM AND METHOD FOR DICTIONARY-BASED CACHE-LINE LEVEL CODE COMPRESSION FOR ON-CHIP MEMORIES USING GRADUAL BIT REMOVAL - A multi-pass compression iteratively removes combinations of bits from locations in each word of a cache line of an uncompressed data stream. For each combination of removed bits, the remaining bits in the word values of the cache line are analyzed to generate a compression score. A highest compression score triggers the building of a dictionary from the remaining bits in the word values of the cache line. After a dictionary is built, the method may continue iteratively to create subsequent dictionaries from the words that remain uncompressed in the cache line. To decompress a word, a first bit section of the compressed word is used to identify a dictionary that is then queried for bits indexed in a second bit section of the compressed word. The uncompressed word is reconstructed by interleaving the queried bits with the removed combination of bits from a third bit section of the word. | 12-31-2015 |
| 20160006453 | METHOD FOR DATA COMPRESSION AND TIME-BANDWIDTH PRODUCT ENGINEERING - A method and apparatus for compression of digital and analog data utilizing an anamorphic spectrum transformation to warp an analog or digital signal to provide time-bandwidth compression after sampling is performed on the warped signal. The anamorphic spectrum transformation performs reallocating samples to assign more samples to fine features with high frequency waveform portions and fewer samples to coarse features with low frequency portions of the analog temporal signal, resulting in shorter record length and fewer number of samples. | 01-07-2016 |
| 20160006454 | COMPRESSION DEVICE, COMPRESSION METHOD, DECOMPRESSION DEVICE, DECOMPRESSION METHOD, INFORMATION PROCESSING SYSTEM, AND RECORDING MEDIUM - A compression device includes a processor configured to execute a process. The process includes: storing, in a storage, a first compressed code in association with a first element, the first compressed code corresponding to a combination of a first element and a first delimiter, the first element being one of a plurality of elements constituting input data, the first delimiter being one of delimiters delimiting the plurality of elements and succeeding the first element in the input data; acquiring, from the storage, the first compressed code in response to reading a sequence of the first element and the first delimiter from the input data; and writing the first compressed code into a storage area that stores therein compressed data of the input data. | 01-07-2016 |
| 20160020872 | ENCODING AND DECODING METHODS AND APPARATUSES OF ETHERNET PHYSICAL LAYER - The present invention discloses encoding and decoding methods and apparatuses of an Ethernet physical layer, the encoding method includes: determining a to-be-encoded first information group, where the first information group includes m characters, m≧2, and m is an integer, where a character attribute of any character is a data character, a boundary character, or a third-type character, and one character occupies one byte; detecting a character attribute of each character in the first information group; if the first information group includes n boundary characters, where n≧1, and n is an integer, deleting the n boundary characters, and generating a second information group by using a character, except the n boundary characters, in the first information group, and type information and position information that are of the n boundary characters, where the second information group includes m bytes; and adding header information to the second information group. | 01-21-2016 |
| 20160036462 | SPLIT GAIN SHAPE VECTOR CODING - The invention relates to an encoder and a decoder and methods therein for supporting split gain shape vector encoding and decoding. The method performed by an encoder, where the encoding of each vector segment is subjected to a constraint related to a maximum number of bits, B | 02-04-2016 |
| 20160043734 | APPARATUS FOR REDUCING DATA VOLUMES - Apparatus for reducing data volumes, which apparatus comprises: (1) a source systems data profiler and extractor subsystem comprising: a. a fuzzy logic controller comprising fuzzyfier, inference, and output handling, b. type reducer outputting meta-keys ( | 02-11-2016 |
| 20160049951 | HARDWARE COMPRESSION TO FIND BACKWARD REFERENCES WITH MULTI-LEVEL HASHES - Concurrently writing an uncompressed data element, if the uncompressed data element comprises an indication that it is valid, in a main hash table using a first address generated by a first hash function, and reading a first data element from the main hash table using the first address. Introducing a first pipeline delay for maintaining the uncompressed data element in a first data path until the first data element is read. Concurrently writing the first data element to a victim hash table, if the first data element comprises an indication that it is valid, using a second address generated by a second hash function, and reading a second data element from the victim hash table using a third address generated by the second hash function. Introducing a second pipeline delay for maintaining the uncompressed data element in the first data path until the second data element is read. | 02-18-2016 |
| 20160056839 | COMPRESSION DEVICE, COMPRESSION METHOD, DECOMPRESSION DEVICE, DECOMPRESSION METHOD, AND COMPUTER-READABLE RECORDING MEDIUM - A non-transitory computer-readable recording medium has stored therein a compression program that causes a computer to execute a process. The process includes: extracting a numeric character string from input data, the numeric character string indicating a numerical value and including therein at least one numeral; and converting the numeric character string to a compressed code utilizing a dictionary that associates numeric character strings and compressed codes. | 02-25-2016 |
| 20160079996 | COMPRESSION RATIO FOR A COMPRESSION ENGINE - An output sequence of data elements is processed. The output sequence of data elements represents a sequence of input data elements in a compressed format. An output data element comprises a backward reference for each string in the input data elements that occurs again in an input data element that is used to produce the output data element. A backward reference identified in a selected output data element is used for selecting the string to which it refers in the stored input data elements. The selected string is combined with strings of one or more subsequent output data elements. A matching sequence in the stored input data elements matching at least part of one or more combined strings is found. A combined string of the one or more combined strings having the longest matching sequence is selected. The backward reference is redefined to indicate the longest matching sequence. | 03-17-2016 |
| 20160112062 | PARALLEL DICTIONARY-BASED COMPRESSION ENCODER - Systems, devices and methods for data compression using history search for dictionary based compression. Systems, devices and methods may use parallel processing techniques for data compression and encoding. Systems, devices and methods may provide memory search techniques for hardware. | 04-21-2016 |
| 20160182084 | PHYSICAL LAYER ENCODING AND DECODING METHOD AND APPARATUSES THEREOF | 06-23-2016 |
| 20160191074 | SYSTEMS AND METHODS FOR COMPRESSION OF HIGH-FREQUENCY SIGNALS - Systems and methods for compressing high-frequency signals are described in certain embodiments herein. According to certain embodiments, a high-frequency signal can be converted into a lower frequency signal so that it can be processed by one or more devices in a lower frequency infrastructure. In certain embodiments, the high-frequency signal can be compressed by certain signal conditioning components and an algorithm executed by a computer processor to at least receive a high-frequency signal, correct the high-frequency signal, determine a number of samples to be taken from the high-frequency signal (i.e., sample the high-frequency signal), store a value associated with the sampled signal, and generate a waveform that includes lower frequency content that may represent the original, high-frequency signal. | 06-30-2016 |
| 20160204795 | SYSTEMS AND METHODS FOR MODEL-FREE COMPRESSION AND MODEL-BASED DECOMPRESSION | 07-14-2016 |
| 20160254824 | DETERMINING COMPRESSION TECHNIQUES TO APPLY TO DOCUMENTS | 09-01-2016 |
| 20190146801 | GENERAL PURPOSE DATA COMPRESSION USING SIMD ENGINE | 05-16-2019 |
