PATENT CLAIM ANALYSIS

Application Number: 15741508
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2018-07
Patent Classification: ["341", "067000"]

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.

Claim (Index 1):
A method of processing data comprising an input sequence of bits, the method comprising the steps of:\n (i) identifying a processing bit length for use in processing said input sequence of bits; (ii) dividing the input sequence of bits into a plurality of portions wherein each portion has a respective portion bit length equal to said processing bit length and wherein the bits in each portion are arranged in a respective portion permutation; (iii) respectively sub-dividing each portion into a plurality of sub-divisions comprising at least a first sub-division and a second sub-division, wherein each sub-division of the plurality of sub-divisions comprises at least one bit, wherein the at least one bit of each first sub-division is arranged in a respective first sub-division permutation, and wherein the at least one bit of each second sub-division is arranged in a respective second sub-division permutation; (iv) performing frequency analysis:\n to determine, for each of a plurality of possible first sub-division permutations, how many times, within said input sequence of bits, a portion comprises a first sub-division having bits arranged in that possible first sub-division permutation; and \n to determine, for each of a plurality of possible second sub-division permutations, how many times, within said input sequence of bits, a portion comprises a second sub-division having bits arranged in that possible second sub-division permutation; \n (v) assigning a respective sub-division value to each of said plurality of possible first sub-division permutations based on how many times, within said input sequence of bits, a portion comprises a first sub-division having bits arranged in that possible first sub-division permutation; and assigning a respective sub-division value to each of said plurality of possible second sub-division permutations based on how many times, within said input sequence of bits, a portion comprises a second sub-division having bits arranged in that possible second sub-division permutation; (vi) for each portion permutation of a plurality of possible portion permutations, generating a respective label representing that portion permutation, wherein said generating comprises combining:\n the sub-division value assigned to the first sub-division permutation corresponding to the first sub-division of that portion permutation; with \n the sub-division value assigned to the second sub-division permutation corresponding to the second sub-division of that portion permutation; \n wherein said respective label comprises a representation of a combined value resulting from said combining; and \n (vii) forming a processed sequence of bits by replacing, within said input sequence of bits, bit portions comprising bits arranged in one of said plurality of possible portion permutations, with the respective label representing that one of said plurality of possible portion permutations.

Metadata:
- Claim Count in Document: 56.0
- Percentile: 86.0
- Lexical Diversity: 2.125
- Patent Class: 341.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['16314868', '12198239', '14675710', '13782157', '15804835']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5081844747665746
- 35 USC 102 Novelty (BERT): 0.5827549784018838
- Combined Prediction Score: 0.5156415251301055
- Mean Citation Score: 229.750734
- Max Citation Score: 458.37173
- Similarity Product: 407.7221556686735

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test