Encoding variable length symbols to enable parallel decoding

    公开(公告)号:US10721019B2

    公开(公告)日:2020-07-21

    申请号:US16391687

    申请日:2019-04-23

    Inventor: Andrew K. Martin

    Abstract: An approach is provided in which a source system selects a symbol in a first bit stream that is partitioned into at least a first data chunk and a second data chunk. The beginning of the selected symbol resides in the first data chunk. The source system generates a first pull timing indicator in response to determining that at least a portion of the selected first symbol resides in the second data chunk. The source system generates a multiplexed bit stream by combining the first bit stream with a second bit stream based on the first pull timing indicator and transmits the multiplexed bit stream to a destination system.

    Recommending data compression scheme using machine learning and statistical attributes of the data

    公开(公告)号:US10715176B1

    公开(公告)日:2020-07-14

    申请号:US16384869

    申请日:2019-04-15

    Abstract: Described herein is a system that facilitates recommending data compression using machine learning and statistical attributes. According to an embodiment, a system can comprise receiving a dataset, statistical attributes associated with the dataset, and a compression requirement for compression of the dataset. The system can further comprise based on the statistical attributes and the compression requirement, estimating a first compression attribute and a second compression attribute of a group of compression processes. The system can further comprise selecting a primary compression process from the group of compression processes, based on an output of an analytics component, wherein the analytics component employs a neural network to determine the primary compression process based on analysis of the statistical attributes, the compression requirement, and a compression objective.

    Reducing a size of multiple data sets

    公开(公告)号:US10693494B2

    公开(公告)日:2020-06-23

    申请号:US16566320

    申请日:2019-09-10

    Abstract: A computing device may select a plurality of data sets, determine a set of strings that are included in at least two data sets of the plurality of data sets, and select a particular string of the set of strings. The computing device may replace each occurrence of the particular string in the plurality of data sets to create a modified plurality of data sets such that the modified plurality of data sets is smaller in size than the plurality of data sets. The computing device may assign a reference to the particular string and replace each occurrence of the particular string in the plurality of data sets to create a plurality of modified data sets. The computing device may replace may store the reference and the particular string in a table.

    Method and apparatus for validating a transaction between a plurality of machines

    公开(公告)号:US10650373B2

    公开(公告)日:2020-05-12

    申请号:US15244985

    申请日:2016-08-23

    Applicant: Peter Lablans

    Inventor: Peter Lablans

    Abstract: A first and a second device both have access to a series of data representing configurations of hash functions. The first device selects a first configuration and implements a hashing function from the selected configuration. A hash value is generated and transmitted to the second device. The second device has hashing configurations stored on a memory. A processor in the second device selects the first hashing configuration to implement the hash function from the first configuration and generates a hash value. The hash values generated on the first device and generated on the second device are compared to determine an action. The first configuration is disabled and a new configuration is retrieved. At least 4 and more preferably at least 5 different n-state functions with n>2 are used in a hash function.

    Data compression coding method, apparatus therefor, and program therefor

    公开(公告)号:US10547324B2

    公开(公告)日:2020-01-28

    申请号:US16235741

    申请日:2018-12-28

    Abstract: A compression coding method, apparatus, and program suitable for continuously coding pieces of fixed length data are provided. The compression coding method includes: dividing, into columns each with a predetermined bit width, records consisting of a fixed-length bit string that includes one or more fields, pieces of data of the same type being contained in the same field among fields determined in advance; and determining, for each column, a probability of occurrence of a bit value in the column at the same position among a plurality of records, and coding the plurality of records on the basis of the probability of occurrence using an entropy coding method.

    Encoder, decoder and method
    48.
    发明授权

    公开(公告)号:US10461773B2

    公开(公告)日:2019-10-29

    申请号:US15332291

    申请日:2016-10-24

    Abstract: An encoder for compressing input data to generate corresponding encoded data is provided. The encoder is operable to process the input data to identify reoccurrence of mutually similar multi-dimensional patterns of data bits and/or data symbols therein. The encoder is then operable to represent one or more duplicate reoccurrences of the mutually similar multi-dimensional patterns of data bits and/or data symbols by way of one or more duplication symbols uniquely identifying the mutually similar patterns.

    Entropy encoding and decoding scheme

    公开(公告)号:US10404272B2

    公开(公告)日:2019-09-03

    申请号:US16198338

    申请日:2018-11-21

    Abstract: 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 si 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 si yields z, and, if n>1, for all i=1 . . . n−1, the value of si corresponds to a range of the ith partition.

Patent Agency Ranking