PATENT CLAIM ANALYSIS

Application Number: 16235336
Application Type: Utility
Filing Date: 2018-12
Publication Date: 2019-11
Patent Classification: ["375", "240200"]

Abstract:
A method of decoding or encoding that includes generating a new multi-transform data structure by embedding one or more non-recursive transforms into a larger recursive transform. The method may further include receiving information regarding a target data block and determining whether to use a recursive transform or a non-recursive transform. When the determination is to use the recursive transform, the method may include generating the recursive transform using a multi-transform data structure and causing the target data block to be encoded or decoded using the generated recursive transform. If not, the method may include causing the target data block to be encoded or decoded using one of the one or more the non-recursive transforms embedded in the multi-transform data structure.

Claim (Index 2):
The method according to  claim 1 , wherein the size of the non-recursive transform of the COT is M, where M=N/2, and N is the size of the recursive transform of the COT.

Metadata:
- Claim Count in Document: 5.0
- Percentile: 98.0
- Lexical Diversity: 2.33333
- Patent Class: 375.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['16235995', '16225982', '13308483', '10097457', '13228200']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5186817948283214
- 35 USC 102 Novelty (BERT): 0.564422651660236
- Combined Prediction Score: 0.523255880511513
- Mean Citation Score: 353.403854
- Max Citation Score: 522.62177
- Similarity Product: 318.2615017511403

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

Dataset: test