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

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

Abstract: 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 td, are produced. The first negative envelope curve signal and the delayed envelope curve signal are added to form a first sum signal with a first zero crossing, wherein the first zero crossing represents a first time value. An amplitude is associated with the first time value, the amplitude corresponding to a signal height consistent with a maximum peak height from the envelope curve within a time interval about the first time value.

Abstract: A computer-implemented method of performing lossless compression of a digital data set uses an iterative compression process in which the number of symbols N and bit length per symbol n may vary on successive iterations. The process includes analyzing at least a part of the data set to establish a partition thereof into N symbols of symbol length n, and to determine whether the N symbols can be further compressed, and, if so, a model to be used in encoding the N symbols.

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

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

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

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

Abstract: A method of data compression includes obtaining a data set comprising a sequence of data blocks comprising a predetermined number of data items, partitioning said data set into one or more groups each comprising a predetermined number of data blocks, and performing data compression on one or more groups of data blocks. Data compression is performed by associating a control data item with each of said blocks, generating a control vector comprising the control data items assigned to each of said blocks within a group, removing data blocks comprising entirely data items having said specified value, compressing data blocks comprising at least one data item having a value different from said specified value using a fixed-rate compression scheme, providing a compressed data stream comprising said compressed data blocks, and providing an associated control vector stream to enable control of said compressed data stream.

Abstract: The present disclosure is directed towards systems and methods for compressing messages, such as Short Message Service (SMS) or text messages between fixed or mobile devices through communications networks. The data of, for example, SMS messages is compressed and forwarded through a communication network to an appliance having a processing unit. The appliance decompresses the message and controls its delivery through network communication devices, where the decompressed SMS message is forwarded to its destination.

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

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

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

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

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

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

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

Abstract: An encoding device enables the amount of processing operations to be significantly reduced while minimizing deterioration in the quality of an output signal. This encoding device (101) encodes an input signal by determining the correlation between a first signal generated by using the input signal and a second signal generated by a predetermined method. An importance assessment unit (202) sets the importance of each of a plurality of processing units obtained by dividing the frames of the input signal. A CELP coder (203) performs sparse processing in which the amplitude value of a predetermined number of samples among multiple samples constituted by the first signal and/or the second signal in each processing unit is set to zero according to the importance that was set for each processing unit, and calculates the correlation between the first signal and the second signal, either of which was subjected to sparse processing.

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

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

Abstract: According to an example implementation, at least one non-transitory computer-readable storage medium may include instructions stored thereon. When executed by at least one processor, the instructions may be configured to cause a computing system to select at least one function type to approximate an interval of data points within a time series, the at least one function type being less than all of a plurality of functions available to approximate the interval, while the first function type will approximate the interval of data points within a maximum allowable error, add data points from the time series to the interval, and when the first function type will no longer approximate the interval with the added data points within the maximum allowable error, select a function of a different type or a function of a different term from the plurality of functions to approximate the interval with the added data points.

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

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

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

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

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

Abstract: A data packing apparatus for continuously receiving current data is provided. The apparatus includes N barrel shifters, a controller and a packing module. The controller determines a shift amount according to a length of previous residual data, and controls the N barrel shifters to sequentially perform M barrel shifts on current merging data to achieve the shift amount, noting that N is an integer greater than or equal to two, and M is a natural number smaller than or equal to N. The packing module merges the previous residual data and the current merging data passed through the N barrel shifters. The maximum shift amounts of the M barrel shifts are smaller than a threshold associated with a length of an operation cycle. The current merged data is a part or all of the current data.

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

Abstract: A method for 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.

Abstract: The invention relates to compressing of sparse data sets contains sequences of data values and position information therefor. The position information may be in the form of position indices defining active positions of the data values in a sparse vector of length N. The position information is encoded into the data values by adjusting one or more of the data values within a pre-defined tolerance range, so that a pre-defined mapping function of the data values and their positions is close to a target value. In one embodiment, the mapping function is defined using a sub-set of N filler values which elements are used to fill empty positions in the input sparse data vector. At the decoder, the correct data positions are identified by searching though possible sub-sets of filler values.

Abstract: Physiological data is generated from signals received from one or more leads associated with the IMD. The physiological data is sampled to generate a plurality of data samples. A predictive encoding algorithm is applied to the plurality of data samples to generate a plurality of encoded data samples each corresponding to one of the plurality of data samples. An entropy encoding algorithm is then applied to the plurality of encoded data samples to generate a plurality of code words each corresponding to one of the plurality of encoded data samples. The code words are then stored in a memory in the IMD.

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

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

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

Abstract: Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet is generated having a first number of symbols that provide variable length codings of the words. The symbols in the first code alphabet are merged into a second number of groups of the symbols in the first code alphabet, where the second number is less than the first number. A second code alphabet is generated having the second number of symbols, wherein a second average codeword length of the codewords produced using the symbols in the second code alphabet is smaller than the codeword length (b) of the words, and wherein the second code alphabet comprises the code alphabet used by the deployed program.

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

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

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

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

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

Abstract: A method to at least one of compress and decompress data includes providing a string (T) consisting of multiple given substrings. Identification symbols ($,$1,$2,$3) are assigned to the substrings of the string (T). The substrings of the string (T) are transferred by permutation into a permuted string (O(T),O*(T)). The permuted string (O(T),O*(T)) is sorted into a sorted permuted string (oSort(T), oSort*(T)) according to a given sorting criterion. The identification symbols ($,$1,$2,$3) are permuted and sorted together with the substrings of the sting (T) so that, in a partial inverse transformation step, characters of an Nth substring are sequentially determined within the permuted string (O(T),O*(T)) after determining a position (P) of an Nth identification symbol ($,$1,$2,$3) assigned to an Nth substring within the sorted permuted string (oSort(T),oSort*(T)) without reading characters of other substrings of the permuted string (O(T),O*(T)).

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

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

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

Abstract: A method for compressing a data stream includes transforming a data stream into a transformed data stream of referencing symbols and other data elements, the referencing symbols representing a data sequence identical to a data sequence in a reference data block; and encoding the referencing symbols by replacing them with codewords according to an encoding scheme, the transformed stream includes at least one control symbol indicating a change between a portion of the transformed data stream containing a sequence of the other data elements and a portion of the transformed data stream containing a sequence of the codewords for the referencing symbols, the location of the control symbol within the transformed data stream defines the end of the respective portion of the transformed data stream, the encoding scheme providing at least one codeword associated to one of the referencing symbols is longer than a codeword representing the control symbol.

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

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

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

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

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