Abstract: An optical communication system includes a signal processing apparatus and a wireless apparatus between which functions of a base station are divided, wherein a periodic symbol sequence including a cyclic prefix appended to a signal of a predetermined size to which an IFFT (Inverse Fast Fourier Transform) has been applied is transmitted between the signal processing apparatus and the wireless apparatus by means of digital RoF (Radio over Fiber) transmission, the signal processing apparatus and the wireless apparatus each include a transmission unit and a reception unit, the transmission unit includes: a compression size determination unit that acquires symbol information relating to a starting position of the symbol sequence and lengths of symbols constituting the symbol sequence, and that determines, based on the acquired symbol information, a compression size for each of symbols that are to be compressed; and a compression unit that compresses the symbol sequence in units of determined compression sizes, an

Abstract: A method to manage raw genomic data (SAM/BAM files) in a privacy preserving manner in a biobank. By using order preserving encryption of the reads' positions, the method provides a requested range of nucleotides to a medical unit, without revealing the locations of the short reads (which include the requested nucleotides) to the biobank. The method prevents the leakage of extra information in the short reads to the medical unit by masking the encrypted short reads at the biobank. That is, specific parts of the genomic data for which the medical unit is not authorized or the patient prefers to keep secret are masked at the biobank, without revealing any information to the biobank.

Abstract: A technique for user notification involves receiving an event notification related to an event associated with user notification by a user; providing the event notification from a stored array to a process executed by a processor; using the event notification as a first title used for the process; providing a second title from the stored array to the process; and using the second title to identify the process to the user.

Abstract: Deterministic network interface for an avionic network, configured for two Ethernet physical media, with two neighboring network interfaces. The network interface of the invention allows the realization of ring-topology network without collision in the physical Ethernet media. The communication between nodes is carried out in a fully deterministic fashion by an unconnected (UDP) protocol. The interface of the invention incorporates a hardware end-to-end integrity mechanism that ensures message integrity from the memory of the sender host to that of the recipient one.

Abstract: A method, computer program product, and system includes a processor obtaining data including values and generating a value conversion dictionary by applying a parse tree based compression algorithm to the data, where the value conversion dictionary includes dictionary entries that represent the values. The processor obtains a distribution of the values and estimates a likelihood for each based on the distribution. The processor generates a code word to represent each value, a size of each code word is inversely proportional to the likelihood of the word. The processor assigns a rank to each code word, the rank for each represents the likelihood of the value represented by the code word; and based on the rank associated with each code word, the processor reorders each dictionary entry in the value conversion dictionary to associate each dictionary entry with an equivalent rank, the reordered value conversion dictionary comprises an architected dictionary.

Abstract: Techniques for generating parities and repairing data erasures using a cache oblivious encoding algorithm are disclosed. The system includes an encoding module which receives a request to recreate data for a subset of a plurality of content stores from a storage manager. The encoding module generates a new first parity and a new second parity using the remaining content in the plurality of content stores. The encoding module generates a first portion of the requested data using the new first parity and a first parity for the plurality of content stores and a second portion of the requested data using the new second parity and a second parity for the plurality of content stores. The encoding module may recreate the data for the plurality of content stores using the first portion of the requested data and the second portion of the requested data.

Abstract: An apparatus having a circuit is disclosed. The circuit may be configured to (i) generate a sequence of hash values in a table from a stream of data values with repetitive values, (ii) find two consecutive ones of the hash values in the sequence that have a common value and (iii) create a shortened hash chain by generating a pointer in the table at an intermediate location that corresponds to a second of the two consecutive hash values. The pointer generally points forward in the table to an end location that corresponds to a last of the data values in a run of the data values.

Abstract: A quantization unit for quantizing orthogonal transform coefficients to calculate a coefficient level: calculates the number of value information bits of a significant coefficient level of an orthogonal transform coefficient to be processed in an image block; monitors coefficient levels output from the quantization unit in the image block from beginning to the N-th prior to the target in transmission order, and updates a state variable indicating whether or not at least one of monitored coefficient levels is significant; calculates the number of position information bits of the significant coefficient level of the orthogonal transform coefficient to be processed, based on a position of the orthogonal transform coefficient to be processed and the state variable; and sets the significant coefficient level to 0 in the case where the number of value information bits and the number of position information bits satisfy a predetermined condition.

Abstract: An encoding apparatus includes an intra-prediction module, a transform module and a control module. The intra-prediction module performs intra-prediction on an image block in a video frame according to a plurality of sets of reference image data to generate a residual block. The reference image data includes a set of reference image data corresponding to a predetermined side of the image block. The transform module performs preliminary transform on the residual block to generate a preliminary transform coefficient matrix. According to whether at least one of the reference image data corresponding to the predetermined side is generated according to image data of an adjacent pixel of the image block, the control module determines whether secondary transform perpendicular to the predetermined side is to be performed on a low-frequency component sub-matrix in the preliminary transform coefficient matrix.

Abstract: A detection learning module is used for enabling and/or disabling real-time compression detection by maintaining a history of real-time compression detection success for sampled data. The enabling or disabling of the real-time compression detection is based on a detection benefit function derived from a set of calculated heuristics indicating the real-time compression detection success on input streams. The detection benefit function is calculated based on at least one heuristic score.

Abstract: A system has a first web node, a first server node, a second server node, a push messaging server, and a second web node. The first web node receives a message from a first player at a first client node for a second player at a second client node within an online game. The first server node maintains a first persistent connection with the first client node. The second server node maintains a second persistent connection with the second client node. The push messaging server stores a game state of the first and second players of the online game, updates the game state based on the message, and notifies the first and second server node. The second web node receives the message from the push messaging server and forwards the message to the second client node via the second persistent connection.

Abstract: Methods of encoding and decoding for video data are described for encoding or decoding coefficients for a transform unit. In particular, the sign bits for the non-zero coefficients are encoded using sign bit hiding. Two or more sets of coefficients are defined for the transform unit and a sign bit may be hidden for each set, subject to satisfaction of a threshold test. The sets may correspond to coefficient groups that are otherwise used in multi-level significance map encoding and decoding.

Abstract: In one embodiment, a method of video encoding, the method comprising: encoding a position of a last non-zero coefficient within a video block, wherein the position of the last non-zero coefficient is provided in a significance map according to block width; and assigning at least one context model to the significance map; wherein the at least one context model includes at least three first contexts, and wherein each of the first three contexts is configured to be shared across two or more blocks of different widths.

Abstract: A transaction suspension system rapidly determines whether messages received by a centralized, anonymous data transaction processing system related to data objects correspond to a stored message pattern. Stored message patterns may include how the message impact objects within the data transaction processing system, which sources transmitted the messages, and when messages were received by the data transaction processing system. The transaction suspension system may prevent the further processing of messages, e.g., messages from a specific source, even if the message would have otherwise qualified for a completed, or processed, transaction.

Abstract: According to one embodiment, a magnetic disk device includes a memory including a first storage area and a second storage area different from the first storage area, and a controller configured to generate a compressed data compressing input data, generate a header data related to a compressed data group including a plurality of compressed data, generate a packet data including the compressed data group and the header data, store the packet data in the first storage area, and store the header data in the second storage area.

Abstract: Embodiments describe arrangements related to offload scanning of large scan lists. Embodiments may comprise logic such as hardware and/or code to facilitate offloading of the scans of large scan lists, e.g., lists on the order of thousands of networks or access points for networks, to network adapters such as wireless network interface cards. Many embodiments provide a network adapter with a compressed representation of a large scan list that may not fit uncompressed in memory of the network adapter. In some embodiments, the compressed representation of the scan list may be lossy, introducing balances related to the memory size on the network adapter, the extent of compression, and the list size, as well as a balance between the memory size and a probability of false positives. In many embodiments, the network adapter may wake the host device upon identifying a network on a scan list.

Abstract: 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, BMAX, allowed for encoding a vector segment. The method comprises, determining an initial number, Np—init, of segments for a target vector x; and further determining an average number of bits per segment, BAVG, based on a vector bit budget and Np—init. The method further comprises determining a final number of segments to be used, for the vector x, in the gain shape vector encoding, based on energies of the Np—init segments and a difference between BMAX and BAVG. The performing of the method enables an efficient allocation of the bits of the bit budget over the target vector.

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: Systems, methods, and other embodiments associated with a compressed data page that includes uncompressed data fields are described. One example method includes compressing user records and storing them on a compressed data page and then storing one or more uncompressed data fields on the compressed data page such that the uncompressed data fields can be updated in place without uncompressing the compressed data page.

Abstract: At a preliminary stage, a compressing unit generates frequency information, outputs a compression code associated with a piece of first data of the longest matching character string among the pieces of first data contained in the frequency information, when the longest matching character string has a length smaller than the predetermined length and outputs a compression code associated with a piece of position information matching with position information about the longest matching character string among the pieces of position information about the second data contained in the frequency information and a compression code associated with length information about the longest matching character string among the pieces of first data contained in the frequency information, when the longest matching character string has a length equal to or larger than the predetermined length.

Abstract: Detailed herein are embodiments of systems, methods, and apparatuses for compression using hardware and software. Embodiments include compressor hardware to operate on two streams with one of the streams being an offset of the other stream. Additionally, in some embodiments, the output of the compressor hardware is submitted to software for further processing.

Abstract: Methods and apparatuses for generating match data for a symbol in a symbol history for use in a hardware-based data compressor. An apparatus for performing history matching for Lempel-Ziv (“LZ”) compression includes a symbol history RAM comprising 2S N bit entries, each entry corresponding to a symbol value represented by S bits and indicating locations within the last N symbols of input data where the symbol value occurred; a symbol counter array comprising 2S counters, each counter corresponding to a symbol value and indicating a number of symbols processed since the last occurrence of the symbol value in the input data; and a barrel shifter configured to shift the entry corresponding to an input symbol value left by a number of bits based on a value of the counter corresponding to the input symbol value to produce a symbol match vector for the input symbol.

Abstract: A system and method are disclosed for encoding numbers in a way that improves the accuracy and efficiency of one or more computing devices working with the transmitted/stored encoded numbers. When the encoded value is missing one or more bits after transmission or storage, the remaining bits of the encoded value will be optimally rounded up or down for the number of bits actually received.

Abstract: Compressed data of mass spectra obtained at respective measurement points and normalization coefficients for XIC normalization or the like are stored in a memory (21). When a normalized imaging graphic at a specific m/z value is to be displayed, a data decompression processor (23) reads the minimally required set of compressed data from the memory (21) and restores the intensity value corresponding to the m/z value at each measurement point. A normalizing calculation processor (29) reads an XIC normalization coefficient corresponding to the m/z value from the memory (21) and corrects the intensity values at each measurement point by multiplying those values by the coefficient. An imaging graphic creation processor (27) assigns a display color to each of the corrected intensity values to create an imaging graphic, and displays the imaging graphic on the screen of a display unit (6).

Abstract: A decompression apparatus includes a memory configured to store a dictionary data including, in association with a compression code, a decompression symbol and address information indicating a position of flag information, which indicates whether the decompressed symbol is included in a block of decompressed data obtained by decompressing a block of compressed data or not, and a processor configured to execute a procedure, the procedure including accessing the dictionary data stored in the memory, obtaining, from the dictionary data, the decompressed symbol and the address information associated with the compressed symbol included in the block of compressed data, generating the decompressed data by using the obtained decompressed symbol, and updating the flag information stored at the position indicated by the obtained address information.

Abstract: A video encoder is configured to encode a binary sting indicating a position of a last significant coefficient within a video block. A video decoder is configured to decode the encoded binary string. The string may be coded using context adaptive binary arithmetic coding (CABAC). Binary indices of the binary string may be assigned a context. The context may be determined according to a mapping function. A context may be a assigned to one or more binary indices where each index is associated with a different block size. The last binary index of a 16×16 video block may share a context with the last binary index of a 32×32 video block.

Abstract: In one embodiment, a computer cache is extended with structures that can (1) establish the frequency by which distinct values occur in the cache and use that information to (2) compress values in caches into dense codes using a plurality of statistical-based compression techniques and (3) decompress densely coded values to realize caches that can store information densely that can be retrieved with low overhead.

Abstract: In one example a method includes: receiving a first input value associated with a first data field; responsive to determining that the first data field is associated with an increment operation, selecting a second input value associated with a corresponding second data field of a previously transmitted message; comparing the first input value and second input value to determine if the first input value includes a sum of the second input value and an increment value; when the first input value includes the sum of the second input value and increment value, generating a message that omits the first input value for the first data field, and providing an operator symbol indicating the increment operation to specify that the first data field of the message is to be associated with the sum of the increment value and second input value of the second data field in the previously transmitted message.

Abstract: The invention provides two kinds of new compressive sensing technologies. In the first technical solution, there is proposed a permutation-based multi-dimensional sensing matrix and an iterative recovery algorithm with maximum likelihood (ML) local detection, which can fully exploit the digital nature of sparse signals. In the second technical solution, there is proposed a sparse measurement matrix which contains a permutation-based multi-dimensional measurement matrix, and an iterative recovery algorithm which fully utilizes the features of measurement symbols to design simple local recovery in each iteration. The second technical solution can achieve the linear decoding complexity and lower bound of sketch length empirically at the same time.

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 technique for providing end-to-end data protection while supporting multiple cyclic-redundancy-check (CRC) algorithms includes receiving a data block protected by a first CRC. The first CRC is generated using a first CRC algorithm. The integrity of the data block is checked using the first CRC and the first CRC algorithm. A second CRC for the data block is then computed using a second CRC algorithm different from the first CRC algorithm. The data block, first CRC, and second CRC are stored on a storage medium, such as magnetic tape.

Abstract: A detection learning module is used for enabling and/or disabling real-time compression detection by maintaining a history of real-time compression detection success for sampled data. The enabling or disabling of the real-time compression detection is based on a detection benefit function derived from a set of calculated heuristics indicating the real-time compression detection success on input streams.

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

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: A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associated with a node is an S1 symbol, the child node of the node is included in the middle part or the upper part of the octree. In hierarchical entropy encoding, a non-S1 symbol is first encoded as a pre-determined symbol ‘X’ using symbol set S2={S1, ‘X’} and the non-S1 symbol itself is then encoded using symbol set S0 (S2?S0), and an S1 symbol is encoded using symbol set S2. Another implementation defines corresponding hierarchical entropy decoding. A further implementation reconstructs the octree and restores the geometry data of a 3D mesh from the octree representation.

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

Abstract: In an embodiment, an indicator is set to indicate that all of a plurality of most significant bytes of characters in a character array are zero. A first index and an input character are received. The input character comprises a first most significant byte and a first least significant byte. The first most significant byte is stored at a first storage location and the first least significant byte is stored at a second storage location, wherein the first storage location and the second storage location have non-contiguous addresses. If the first most significant byte does not equal zero, the indicator is set to indicate that at least one of a plurality of most significant bytes of the characters in the character array is non-zero. The character array comprises the first most significant byte and the first least significant byte.

Abstract: Methods and devices are provided for data compression. Data compression can include receiving a plurality of data chunks, sampling at least some of the plurality of data chunks extracting a common portion from a number of the plurality of data chunks based on the sampling, and storing a remainder of the plurality of data chunks in memory.

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

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

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: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for encoding and decoding information. In one aspect, methods of encoding information in an encoder include receiving a signal representing information using a collection of discrete digits, converting, by an encoder, the received signal into a time-based code, and outputting the time-based code. The time-based code is divided into time intervals. Each of the time intervals of the time-based code corresponds to a digit in the received signal. Each digit of a first state of the received signal is expressed as an event occurring at a first time within the corresponding time interval of the time-based code. Each digit of a second state of the received signal is expressed as an event occurring at a second time within the corresponding time intervals of the time-based code, the first time is distinguishable from the second time.

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

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

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

Abstract: Methods and apparatus are provided for Lempel-Ziv data compression with shortened hash chains based on repetitive multi-byte runs. Data is compressed by processing a sequence of data to identify a repetitive pattern, such as a multi-byte run; and providing indicators associated with the sequence of data of a start position and an end position of the repetitive pattern. The indicators of the start and end positions of the repetitive pattern may comprise, for example, flags associated with the positions. The indicators of the start and end positions of the repetitive pattern are processed to determine a sequence length of the repetitive pattern. In addition, a match can be identified in the sequence of data having a length that is greater than or equal to an offset of s bytes to identify a run comprised of an s-byte sequence.