Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VLC coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols s.sub.i with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols s.sub.i yields z, and, if n>1, for all i=1 . . . n−1, the value of s.sub.i corresponds to a range of the i.sup.th partition.

Methods and apparatus for compressing and decompressing genetic information from an individual. In one arrangement, a data compression method generates a compressed representation of at least a portion of an individual's genome by receiving an input file having a representation of the genome as a sequence of variants defined relative to a reference genome. A reference database having a plurality of reference lists of genetic variants from other individuals is accessed. Each reference list has a sequence of genetic variants from a single, phased haplotype. Two mosaics of segments from the reference lists are identified which match the genome to within a threshold accuracy. Each mosaic represents a single one of the two haplotypes of the individual's genome and includes a portion of the sequence of genetic variants from one of the reference lists. The compressed representation is generated by encoding the two mosaics and deviations from the two mosaics.

Methods, systems, and computer programs for compressing nucleic acid sequence data. A method can include obtaining nucleic acid sequence data representing: (i) a read sequence, and (ii) a plurality of quality scores, determining whether the read sequence includes at least one “N” base, based on a determination that the read sequence does not include at least one “N” base, generating a first encoded data set by using a first encoding process to encode each of the quality scores of the read sequence using a base-(x minus 1) number, where x is an integer representing a number of different quality scores used by the nucleic acid sequencing device, and using a second encoding process to encode the first encoded data set, thereby compressing the data to be compressed.

A data compression method, comprising: obtaining a plurality of values of a parameter and an occurrence probability of each of the plurality of values (S101), comparing the occurrence probability with a predetermined threshold, wherein values with the occurrence probability less than the predetermined threshold are first set of values, and values with the occurrence probability greater than or equal to the predetermined threshold are second set of values (S102); performing pretreatment on the first set of values (S103); and encoding the second set of values and the pretreated first set of values (S104). By means of the data compression method, the maximum codeword length can be effectively reduced, so as to reduce the requirements of a code table to the storage space.

The invention proposes a method and a device for arithmetic encoding of a current spectral coefficient using preceding spectral coefficients. The preceding spectral coefficients are already encoded, and both the preceding and current spectral coefficients are comprised in one or more quantized spectra resulting from quantizing a time-frequency-transform of video, audio or speech signal sample values.

Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VLC coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols s.sub.i with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols s.sub.i yields z, and, if n>1, for all i=1 . . . n−1, the value of s.sub.i corresponds to a range of the i.sup.th partition.

Methods and apparatus are provided for unified significance map coding. An apparatus includes a video encoder (400) for encoding transform coefficients for at least a portion of a picture. The transform coefficients are obtained using a plurality of transforms. One or more context sharing maps are generated for the transform coefficients based on a unified rule. The one or more context sharing maps are for providing at least one context that is shared among at least some of the transform coefficients obtained from at least two different ones of the plurality of transforms.

Methods and apparatus are provided for improved entropy encoding and decoding. An apparatus includes a video encoder (200) for encoding at least a block in a picture by transforming a residue of the block to obtain transform coefficients, quantizing the transform coefficients to obtain quantized transform coefficients, and entropy coding the quantized transform coefficients. The quantized transform coefficients are encoded using a flag to indicate that a current one of the quantized transform coefficients being processed is a last non-zero coefficient for the block having a value greater than or equal to a specified value.

The present disclosure relates generally to techniques for improving the implementation of certain operations on an integrated circuit. In particular, deep learning techniques, which may use a deep neural network (DNN) topology, may be implemented more efficiently using low-precision weights and activation values by efficiently performing down conversion of data to a lower precision and by preventing data overflow during suitable computations. Further, by more efficiently mapping multipliers to programmable logic on the integrated circuit device, the resources used by the DNN topology to perform, for example, inference tasks may be reduced, resulting in improved integrated circuit operating speeds.

This application discloses a data compression method and a computing device. The disclosed method is applied to the computing device. The method includes receiving, by the computing device, to-be-compressed data, and identifying a data type of the to-be-compressed data. The method further includes selecting one or more data compression models based on the identified data type and compressing the to-be-compressed data based on the selected one or more data compression models.