Abstract: A method for designing a loudspeaker excursion estimator comprises measuring an excursion-related parameter for a loudspeaker, for each of a plurality of loudspeaker input signal levels and each of a plurality of loudspeaker input signal frequencies. The method further comprises, for each of the loudspeaker input signal frequencies and based on the measured excursion-related parameters, identifying a respective loudspeaker input signal level corresponding to a target maximum excursion-related parameter value. The method further comprises determining a filter response, based on the identified loudspeaker input signal levels and their respective loudspeaker input signal frequencies, and implementing a filter, based on the calculated filter response, for generating an excursion estimation based on loudspeaker input signal levels.

Abstract: Aspects of the disclosure provide methods and apparatuses for storing data. In some examples, an information processing apparatus that includes processing circuitry is provided. The processing circuitry is configured to receive data and determine a target blockchain based on an attribute associated with the data and blockchain correspondence information. The blockchain correspondence information indicates attributes associated with a plurality of blockchains. Further, the processing circuitry is configured to store a first block that is generated based on the received data in the target blockchain.

Abstract: The present invention provide a method for processing data packet and apparatus and the method includes: receiving or sending compression configuration information of an application layer packet; and performing compression processing or decompression processing on the application layer packet according to the compression configuration information. By using the foregoing method, compression and decompression processing of the application layer packet can be implemented, thereby reducing overheads of packet transmission and improving utilization of a network resource.

Abstract: A method, comprises monitoring a encoding process of a source video file performed by an encoder; obtaining an encoding decision parameter used to encode a picture of the source video file during the encoding process; comparing the encoding decision parameter to a threshold; based on the step of comparing, identifying the picture as a candidate picture for a visual defect or coding error; and storing a timestamp of the candidate picture.

Abstract: An instrumentation trace capture technique enables software developers to monitor, diagnose and solve errors associated with application development and production. A client library of an investigative platform is loaded in a user application executing on a virtual machine instance of a virtualized computing environment. The client library interacts with an agent of the platform to instrument executable code of the user application and, to that end, loads a capture configuration that specifies, inter alia, methods and associated arguments, variables and data structures (values), to instrument. The client library inspects the executable code to determine portions of the code to instrument based on the capture configuration, which describes a degree of fidelity (e.g., a frequency) of the executable code and data to trace at runtime. Capture points of the runtime application are implemented as callbacks to the client library, which are registered with a runtime system executing the user application.

Abstract: A computer system processes data requests using a data delivery queue. A query received from a client is processed to generate response data, wherein the response data is held in a queue prior to transmitting to the client. The response data in the queue is iteratively divided into a plurality of blocks, wherein each block of the plurality of blocks is compressed prior to transmitting to the client, and wherein a block size of a given block is determined based on an amount of time to compress and transmit a preceding block. The plurality of blocks are transmitted to the client. Embodiments of the present invention further include a method and program product for processing data requests using a data delivery queue in substantially the same manner described above.

Abstract: A first electronic device according to various embodiments may select one of a plurality of representation matrices and one of a plurality of measurement matrices on the basis of a pattern and/or feature of data received from a sensor. The selection of the representation matrix and the measurement matrix may be performed on the basis of machine learning. Based on the selected representation matrix and measurement matrix, the first electronic device may adaptively compress at least a portion of the data. A second electronic device according to various embodiments may restore compressed data on the basis of the result of selecting the representation matrix and the measurement matrix. By dynamically selecting the representation matrix and the measurement matrix on the basis of machine learning, it is possible to reduce an error in the data restored by the second electronic device (e.g., a restoration error).

Abstract: Computer-implemented methods and systems are provided for storing data in association with a key within a hash table and for retrieving the data from the hah table using the key. The hash table comprises a plurality of storage tables. Each of the storage tables is associated with a respective primary hashing function for determining which of a plurality of buckets of the storage table should be used for storing data associated with a particular key. Each of the buckets is configured to store a limited number of elements. Each element comprises respective stored data and a representation of the respective key associated with the stored data. Each of the storage tables is further associated with a respective secondary hashing function with which the representations of the keys of the elements of that storage table are generated. The secondary hashing function for each of the storage tables is the primary hashing function for at least one of the other storage tables.

Abstract: Aspects of the disclosure provide methods and apparatuses for storing service data. In some examples, an apparatus for storing service data includes processing circuitry. The processing circuitry receives service data of a user and determines, in a plurality of blockchains, a target blockchain according to a user attribute of the user. Based on the service data and an eigenvalue of a block header of a first block in the target blockchain, the processing circuitry generates a second block in the target blockchain. The first block is a previous block of the second block. The second block is used for recording the service data.

Abstract: The present disclosure provide a signal processing method and apparatus. The method includes: determining a total quantity of to-be-allocated bits corresponding to a current frame; implementing primary bit allocation on to-be-processed sub-bands; performing a primary information unit quantity determining operation for each sub-band that has undergone the primary bit allocation; selecting sub-bands for secondary bit allocation from the to-be-processed sub-bands according to at least one of a sub-band characteristic of each sub-band of the to-be-processed sub-bands or the total quantity of surplus bits; implementing secondary bit allocation on the sub-bands for secondary bit allocation; and performing a secondary information unit quantity determining operation for each sub-band of the sub-bands for secondary bit allocation.

Abstract: A system and a method for interpreting normal and errored segments of network measurement data differently, and processing network measurement data, including: receiving a first query for network measurement data; extracting compressed network measurement data and error metadata from a repository database based upon the first query; decompressing the extracted compressed network measurement data; retrieving an error segment of raw network measurement data based upon the error metadata; and merging the error segment of raw network measurement data with the decompressed extracted compressed network measurement data to produce extracted network measurement data.

Abstract: There is provided an audio decoder and a method therein for transforming a digital audio signal from a first frequency domain to a second frequency domain. For each received frame of the digital audio signal, the method identifies an upper limit of the frequency range, and if the upper limit of the frequency range is below the Nyquist frequency of said frame of the digital audio signal by more than a threshold amount, the Nyquist frequency of said frame of the digital audio signal is lowered from its original value to a reduced value by removing spectral bands of said frame of the digital audio signal above the identified upper limit of the frequency range. Thereafter said frame of the digital audio signal is transformed from the first frequency domain to the second frequency domain via an intermediate time domain.

Abstract: An exemplary sound reproducing, noise reducing method and system include supplying to a corresponding loudspeaker a useful signal that represents sound to be reproduced and an anti-noise signal that, when reproduced by the corresponding loudspeaker, reduces noise in the vicinity of the corresponding microphone. The method and system further include receiving audio input signals and processing the audio input signals to provide the useful signals so that the useful signals provide a more realistic sound impression for a listener wearing the helmet than the audio input signals.

Abstract: Disclosed herein is a method including receiving a stream of packets into a buffer, each packet having a processed video data portion and a page count portion, the processed video data portion being a result of a modulo operation performed on a word of video data, and the page count portion being a data page number on which the word of video data is to be placed. Each packet is read from the buffer, and an output packet including the video data portion and a data tag portion is generated therefrom. The data tag portion is associated with, but does not directly represent, the data page number where the word of video data of the processed video data portion or of video data of a processed video data portion of a next packet, is to be placed. Each data tag portion contains fewer bits than each corresponding page count portion.

Abstract: A decoding apparatus includes a differential decoder, an error correction decoder and a controller. The differential decoder performs differential decoding according to a differential encoding dependency to generate a differential decoding result. The error correction decoder performs a decoding process on multiple packets that need to be corrected according to the differential decoding result to accordingly generate respective error correction records, wherein the packets are generated according to the differential decoding results, and the packets include a first packet and a second packet. When the error correction record of the first packet indicates that the decoding process of the first packet is unsuccessful, the controller generates a set of error position information according to the error correction record of the second packet, and requests the error correction decoder to perform another decoding process on the first packet according to the error position information.

Abstract: A method of transmitting high speed serial data with reduced levels of radiated emissions is disclosed. A transmitting device scrambles data utilizing a pseudo-random number sequence generator. Scrambling the data eliminates transmission of repeated data sequences. The transmitting device similarly scrambles idle pairs of data between data transmissions to eliminate an additional source of repeated data sequences. The scrambled and encoded data is transmitted to a receiving device. The receiving device also includes a pseudo-random number sequence generator. Synchronization of the two pseudo-random number sequence generators occurs by utilizing control characters of the data frame being transmitted. Each of the pseudo-random number sequence generators is configured to generate the same sequence of numbers and is initialized to start with a first number in the sequence of numbers corresponding to the first byte of data being transmitted or received.

Abstract: An apparatus for selecting one of a first encoding algorithm and a second encoding algorithm includes a filter configured to receive the audio signal, to reduce the amplitude of harmonics in the audio signal and to output a filtered version of the audio signal. First and second estimators are provided for estimating first and second quality measures in the form of SNRs of segmented SNRs associated with the first and second encoding algorithms without actually encoding and decoding the portion of the audio signal using the first and second encoding algorithms. A controller is provided for selecting the first encoding algorithm or the second encoding algorithm based on a comparison between the first quality measure and the second quality measure.

Abstract: Disclosed is a low-complexity and yet efficient lossy method to compress distortion information for motion estimation, resulting in significant reduction in needed storage capacity. A system for implementing the method and a computer-readable medium for storing the method are also disclosed. The method includes determining and storing a distortion value for each trial motion vector in a plurality of trial motion vectors. Each trial motion vector specifies a position of a search region relative to a reference frame. The method further includes compressing each of the distortion values as a fixed number of bits based upon a minimum distortion value amongst the stored distortion values, and re-storing each compressed distortion value in place of its uncompressed value.

Abstract: Embodiments of the invention relate to an image or raster compression method for a multi-dimensional array of pixels. A user specifies a maximum error allowable per pixel for the compression algorithm. The raster is divided into a number of pixel blocks where each pixel is quantized and bit stuffed based on a number of block statistics including the maximum error allowable. The size of the pixel blocks is limited to two (e.g., 8×8 and 16×16) to save processing time with little difference in compression. A Look-Up Table (LUT) is used instead for certain types of data where it is more efficient.

Abstract: A method for decoding an encoded audio bitstream in an audio processing system is disclosed. The method includes extracting from the encoded audio bitstream a first waveform-coded signal including spectral coefficients corresponding to frequencies up to a first cross-over frequency and performing parametric decoding at a second cross-over frequency to generate a reconstructed signal. The second cross-over frequency is above the first cross-over frequency and the parametric decoding uses reconstruction parameters derived from the encoded audio bitstream to generate the reconstructed signal. The method further includes extracting from the encoded audio bitstream a second waveform-coded signal including spectral coefficients corresponding to a subset of frequencies above the first cross-over frequency and interleaving the second waveform-coded signal with the reconstructed signal to produce an interleaved signal. The interleaved signal is then combined with the first waveform-coded signal.

Abstract: The present invention relates to a method for encoding a voice signal, a method for decoding a voice signal, and an apparatus using the same. The method for encoding the voice signal according to the present invention, includes the steps of: determining an eco-zone in a present frame; allocating bits for the present frame on the basis of the location of the eco-zone; and encoding the present frame using the allocated bits, wherein the step of allocating the bits allocates more bits in the section in which the eco-zone is located than in the section in which the eco-zone is not located.

Abstract: A system and method for switching between multiple encoders or decoders may be implemented to quickly and seamlessly transfer coding operations between two encoders. Before switching from a first encoder to a second encoder, the second encoder is initialized and updated with a copy of the necessary information from the first encoder. Similarly when switching from a first decoder to a second decoder, the second decoder is initialized and the necessary information from the first decoder is passed to the second decoder. A controller may monitor the system to identify a condition that would trigger an encoder switch and identify the encoder that best suits the system conditions. A shared memory unit accessible by either encoder may store the initialization information. A shared decode unit accessible by either encoder may transmit decoded frames between encoders.

Abstract: In order to improve the compression rate for configuration information including address information and data information when transmitting or storing configuration information which includes addresses and data having differing characteristics, an information compression device is provided with a compressor which receives as input and compresses the configuration information provided with the addresses and data, and a compressed information storage module for storing the configuration information which is compressed, that is, compressed configuration information, as the information to be decompressed for the user, said compressor including an information separating module for separating the configuration information into address information and data information, an address compressor and data compressor which separately compress the separated address information and data information, and a compressed information outputting module for combining the compressed address information and data information and output

Abstract: This invention is time stamping subsystem of an electronic apparatus. A time stamp generator generates a multibit time stamp value including a predetermined number of least significant bits overlapping a predetermined number of most significant bits. Each client receives the least significant bits. Each client associates captured data with a corresponding set of the least significant bits in a message. A central scheduling unit associates most significant bits of the time stamp value with the least significant bits of the message. This associating compares overlap bits of the most significant bits and least significant bits. The most significant bits are decremented until the overlap bits are equal.

Abstract: Embodiments of systems, apparatuses, and methods for performing delta encoding on packed data elements of a source and storing the results in packed data elements of a destination using a single vector packed delta encode instruction are described.

Abstract: An intra frame predication scanning method for video coding includes steps of: providing a two-dimensional residual coefficient array of a pixel block; dividing the two-dimensional residual coefficient array into a plurality of sub-arrays; converting, in a predetermined order, residual coefficients in the respective sub-array into a one-dimensional individual-sub-array residual coefficient series; connecting the one-dimensional individual-sub-array residual coefficient series of all the sub-arrays as a one-dimensional all-sub-array residual coefficient series of the pixel block; and performing an entropy coding on the one-dimensional all-sub-array residual coefficient series. A video coding method is also provided.

Abstract: A method of communicating corrections for information related to satellite signals among global navigation satellite system (GNSS) receivers is described. The method includes at a first GNSS device determining a component of position of a satellite. The component is then divided by a first value to thereby obtain an integer value and a remainder value, and the only the remainder value is transmitted from the first GNSS device to the second GNSS device. Knowing the first value, the second GNSS device calculates the component of position.

Abstract: A planetary scale object rendering system may provide a plurality of spherical mesh topologies of different levels of detail made up of abutting faces. Tessellation of the faces may be provided at continuous levels of detail. The geometry data at different locations and levels of detail in the mesh topology may be randomly accessible. The geometric data may be organized in quadtrees in some embodiments. A layered quadtree data structure may be formed from the bottom layer up with successively higher parent layers formed from the root nodes of previous child layers. The quadtree structure may be randomly accessed from the top down.

Abstract: A method of processing audio signals for an auditory prosthesis is provided. The method includes a noise reduction step (22) and a later compression step (24). A gain control step is provided prior to the compression step (24). The gain control step operates so as to minimize the occurrence of signal compression in the compression step (24). An auditory prosthesis arranged to provide the method is also provided.

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

Abstract: A method is disclosed for compressing a sequence of initial digital values into a compressed sequence of compressed values, intending to restore these values into a decompressed sequence of decompressed values. For a first initial value of the sequence, the compressed value of the first initial value is equal to the first initial value and the decompressed value of the compressed value of the first initial value is equal to the first initial value.

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: There is provided an encoder and decoder for encoding and decoding input data (D1, D2 or D3) to generate corresponding encoded output data (D2 or D3, D5). The encoder includes a data processing arrangement, optionally for analyzing a range of values present in the input data (D1) to determine at least one pre- and/or post-pedestal value, optionally to translate the input data (D1) using the at least one pre- and/or post-pedestal value to generate translated data, and then to apply a form of ODelta coding to the data, optionally translated data, to generate processed data, and to combine the processed data and optionally the at least one pre- and/or post-pedestal value for generating the encoded output data (D2 or D3). The decoder includes a data processing arrangement for processing the encoded data (D2 or D3), optionally to extract therefrom at least one pre- and/or post-pedestal value.

Abstract: Embodiments of the present invention disclose a data decoding method and apparatus, relate to the field of wireless communications, and can improve a resource utilization rate in a decoding process, thereby improving decoding efficiency. The method of the present invention includes: dividing a to-be-decoded data transport block into N code blocks, where N is an integer greater than or equal to 2; and decoding the N code blocks in parallel according to a reverse direction of encoding. The present invention is applicable to data decoding.

Abstract: A first differential encoding circuit is configured to perform a differential encoding on n-lines parallel input data to generate n-lines parallel output data. A second differential encoding circuit is configured to perform a differential encoding on n-lines parallel input data to generate n-lines parallel output data. A multiplexing circuit is configured to alternately multiplex the generated parallel output data from the first differential encoding circuit and the second differential encoding circuit, and configured to output the multiplexed data.

Abstract: Coding circuitry for difference-based data transformation in an illustrative embodiment comprises a difference-based encoder having a plurality of processing stages, with the difference-based encoder being configured to generate respective orders of difference from a sequence of data samples and to output encoded data determined based on at least a selected one of the orders of difference. The coding circuitry may be configured to implement lossless, linear compression of the sequence of data samples. The coding circuitry may additionally or alternatively comprise a difference-based decoder having a plurality of processing stages, with the difference-based decoder being configured to process encoded data comprising selected ones of a plurality of orders of difference and to reconstruct a sequence of data samples based on the selected orders of difference.

Abstract: A method and system for monitoring and analyzing at least one signal are disclosed. An abstract of at least one reference signal is generated and stored in a reference database. An abstract of a query signal to be analyzed is then generated so that the abstract of the query signal can be compared to the abstracts stored in the reference database for a match. The method and system may optionally be used to record information about the query signals, the number of matches recorded, and other useful information about the query signals. Moreover, the method by which abstracts are generated can be programmable based upon selectable criteria. The system can also be programmed with error control software so as to avoid the re-occurrence of a query signal that matches more than one signal stored in the reference database.

Abstract: An image encoding method using color space estimation is provided. A method for encoding a second color space pixel corresponding to coordinates of a first color space pixel using color spaces, includes encoding a pixel of a first color space; calculating a color space estimation value of a current pixel of a second color space by referring to the encoded pixel of the first color space; and encoding a differential value of the calculated color space estimation value and the current pixel value. Thus, the image compression efficiency can be enhanced by using the information between the color spaces in the image encoding, and the lossless image compression can be accomplished by ruling out the similarity of the pixels.

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

Abstract: In one embodiment, a protection control monitoring device includes a conversion unit sequentially converting analog data corresponding to an amount of electricity of a power system into digital data and outputting the results as a data sequence, a calculation unit sequentially calculating difference data representing a difference between adjacent data in the data sequence and outputting results as a difference data sequence, a data block generation unit dividing each of a plurality of difference data in the difference data sequence into a plurality of partial data, generating data blocks from a plurality of corresponding partial data, and outputting results as a data block sequence, a compression unit losslessly compressing the data block sequence, and a storage unit storing the losslessly compressed data block sequence.

Abstract: In a method and device for encoding and/or decoding a sequence of discrete source values (Si) sub-groups (Gi) of a number of successive source values are taken from the sequence of source values. The sub-groups of source values are encoded into packets, comprising in each case an initial value (S1) corresponding to a first source value in a sub-group, a standardization factor (R) and difference values (?Si), standardized in accordance with the standardization factor, between values corresponding with other source values (Si) in the sub-group and in each case a value corresponding with a preceding source value (Si-1) in the sub-group. A standardization factor (R) is determined per packet subject to a greatest difference value (?max) within the sub-group between a source value and a preceding source value. The invention also relates to an information carrier provided with a thus encoded sequence of source values.

Abstract: The invention relates to the digital signal requantization, at a given quantization step size, of a first word received in a first period of time and encoded in a first number of bits, into a second word, with a quantization error equal to a third number. A sequence of third words is outputted, equal to the second word, with the sequence subdivided into a first group comprising a number of third words that is equal to the third number and a second group of third words. Before outputting them, the correction means adds a least significant bit to the third words of the first group and adds or subtracts least significant bits to or from the third words of the second group, such that the sum of the least significant bits added to and subtracted from the second group is zero.

Abstract: A data element can be encoded into multiple encoded data elements using an encoding algorithm that includes an encoding function and one or more encoder constant. The encoded data elements can be organized into multiple pillars, each having a respective pillar number. Each of the pillars is sent to a different storage unit of a distributed storage network. To recover the original data element, the encoded data elements are retrieved from storage, and the encoder constant is recovered using multiple encoded data elements. Recovering the encoder constant allows the encoding algorithm originally used to encode the data elements to be determined, and used to recover the original data element. The security of the stored data is enhanced, because an encoded data element from a single pillar is insufficient to identify the encoder constant.

Abstract: A first differential encoding circuit is configured to perform a differential encoding on n-lines parallel input data to generate n-lines parallel output data. A second differential encoding circuit is configured to perform a differential encoding on n-lines parallel input data to generate n-lines parallel output data. A multiplexing circuit is configured to alternately multiplex the generated parallel output data from the first differential encoding circuit and the second differential encoding circuit, and configured to output the multiplexed data.

Abstract: Coding circuitry for difference-based data transformation in an illustrative embodiment comprises a difference-based encoder having a plurality of processing stages, with the difference-based encoder being configured to generate respective orders of difference from a sequence of data samples and to output encoded data determined based on at least a selected one of the orders of difference. The coding circuitry may be configured to implement lossless, linear compression of the sequence of data samples. The coding circuitry may additionally or alternatively comprise a difference-based decoder having a plurality of processing stages, with the difference-based encoder being configured to process encoded data comprising selected ones of a plurality of orders of difference and to reconstruct a sequence of data samples based on the selected orders of difference.

Abstract: A signal corresponding to a short-period change and a signal corresponding to a long-period change of a sound signal are detected, and optimal quantization is performed based on the combination of the two signals. In an ADPCM encoding apparatus (100), a differential value dn between a 16-bit input signal Xn and a decoded signal Yn-1 of one sample ago is calculated by a subtractor (102). Thereafter, the 16-bit differential value dn is adaptively quantized by an adaptive quantizing section (103), so as to be converted to a (1 to 8)-bit length-variable ADPCM value Dn. Thereafter, the ADPCM value Dn is compression-encoded by a compression-encoding section (108) to generate a signal D?n, and the signal D?n is framed by a framing section (130) and outputted. Further, in an ADPCM decoding apparatus, a framed input signal is subjected to a reverse of the aforesaid process so as to be decoded.

Abstract: In a method for decoding digital information, a bit-stream signal comprising binary information is received at a digital receiver utilizing wired communication. The received bit-stream signal is sampled for each binary value at least two different sampling points within an eye pattern associated with the related binary value in order to obtain a hard-bit value for each sampling point. A single soft-bit value for each binary value based on the hard-bit values of the relevant binary value is generated and the bit value of the binary value is determined by subjecting the soft-bit values to a soft-decision algorithm.

Abstract: Systems and methods for the encoding of data in a dataset, comprising the storage of the data in an i-th temporary code list (TCL(i)); generating an i-th folder (folder(i)) from the i-th temporary code list (TCL(i)) by replacing each value by an index that refers to the same value in a reference database; generating new temporary codes, using a predetermined formula F that always combines at least two values from the i-th folder (folder(i)), and placing thereof in an (i+1)-th temporary code list (TCL(i+1)); and the recursive repetition of actions b) and c) for subsequent values of i, so long as the (i+1)-th temporary code list (TCL(i+1)) or the (i+1)-th folder (Folder(i+1)) contains one or more values more than once.

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

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