US 10,700,701 B2Granted

Data processing method and apparatus

AssigneeSISP Technologies Ltd.

InventorsStuart Marlow, Nicholas Stavrinou

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method of compression is disclosed in which an input sequence of bits is divided into a plurality of portions. Each portion is sub-divided into a plurality of sub-divisions. Frequency analysis is performed to determine the number of occurrences of each sub-division permutation and new values are assigned, based on the frequency analysis, to each of the sub-division permutations. For each portion a label representing the permutation of bits in that portion is assigned. The label comprises a representation of a combined value resulting from combining the new values associated with the sub-division permutations of that portion. A processed sequence of bits is generated by replacing, within the input sequence of bits, bit portions with the respective label representing the permutation of bits in that portion.

Claims26

Dependent claims

A method of processing data comprising an input sequence of bits, the method comprising the steps of:

(i) identifying a current processing configuration defining a current processing bit length for use in processing said input sequence of bits, wherein the current processing configuration defines a plurality of sub-divisions of each portion of a plurality of portions, each sub-division having a respective sub-division bit length, wherein a sum of said respective sub-division bit lengths equals said current processing bit length;
(ii) dividing the input sequence of bits into the plurality of portions, each portion comprising one or more sub-divisions according to the current processing configuration, wherein each portion has a respective portion bit length equal to said current processing bit length and wherein the bits in each sub-division are arranged in a respective one of a number of possible sub-division permutations;
(iii) for each of a plurality of possible sub-division permutations, analysing the input sequence of bits to respectively identify how many times, within said input sequence of bits, a portion comprises a sub-division having that possible sub-division permutation occurs;
(iv) determining whether at least one predetermined processing criterion has been achieved by comparing results of said analysing with the predetermined processing criterion;
(v) processing said input sequence of bits based on said determining wherein said processing comprises:
when the determining determines that the predetermined processing criterion has not been achieved, performing at least one of:
identifying a new processing configuration that is different to the current processing configuration and repeating steps (ii) to (v) using said new processing configuration as the current processing configuration;
and ending processing of said input sequence of bits;
and
when the determining determines that the at least one predetermined processing criterion has been achieved:
assigning a respective sub-division value to each of said plurality of possible sub-division permutations;
and forming a processed sequence of bits by replacing, within said sequence of bits, bit portions comprising a sub-division having bits arranged in one of said plurality of possible sub-division permutations with a portion label based on the sub-division values assigned to that sub-division permutation.

9 more elements

A method of processing data, the method comprising the steps of:

(i) dividing the data into a plurality of processing segments wherein each processing segment comprises an input sequence of bits;
(ii) identifying a current processing configuration defining a current processing bit length for use in processing a current processing segment of said data to form a processed segment meeting at least one predetermined processing criterion;
(ii) dividing the current processing segment into a plurality of portions wherein each portion has a respective portion bit length equal to said current processing bit length and wherein the bits in each portion are arranged in a respective one of a number of possible permutations;
(iv) assigning a respective label to each of a plurality of said possible permutations;
(v) forming a processed segment by replacing, within said current processing segment, bit portions comprising bits arranged in one of said plurality of possible permutations with the respective label assigned to that one of said possible permutations;
(vi) identifying a new processing configuration for use in processing a next processing segment of said data to form a processed segment meeting at least one predetermined processing criterion;
and
(vii) repeating, for each of said plurality of processing segments, steps (ii) to (vi) wherein the new processing configuration is used as the current processing configuration and the next processing segment of said data is used as the current processing segment, and wherein the processing configuration used for at least one of said processing segments of said data defines a different processing bit length to a processing bit length defined by a processing configuration used for at least one other of said processing segments of said data.

5 more elements

Dependencies are inferred from the claim text.

Facts

Application: 16/449,500Filed 24 Jun 2019 · continuation
Published: US 2019/0312589 A110 Oct 2019
Granted: 30 Jun 2020
Term ends: Not estimatedThe source records don’t support an estimate.

Classification9 codes

H03M 7/40
Compression ; Expansion; Suppression of unnecessary data, e.g. redundancy reduction: conversion to or from variable length codes, e.g.…
G06F 21/602
Protecting data: providing cryptographic facilities or services
H03M 7/3084
Compression ; Expansion; Suppression of unnecessary data, e.g. redundancy reduction: using adaptive string matching, e.g. the Lempel-Ziv method
H03M 7/3093
Data deduplication: using fixed length segments

Family

PCT/GB2016/052020Parent of this continuation · filed 4 Jul 2016
US 2019/0312589 A1Pre-grant publication · published 10 Oct 2019
Application15/741,508Parent of this continuation
US 10,382,057 B2Parent of this continuation
US 2018/0191372 A1Published application
US 10,700,701 B2This patent

From the US filing history. Foreign family members aren’t listed.