PATENT CLAIM ANALYSIS

Application Number: 16014413
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2018-10
Patent Classification: ["375", "259000"]

Abstract:
A method includes: receiving a to-be-decoded symbol sequence, where the to-be-decoded symbol sequence includes N symbols; dividing the received to-be-decoded symbol sequence into a first symbol sequence and a second symbol sequence; calculating first distances between the first symbol sequence and each of corresponding 2 K  ideal superimposed symbol sequences, and obtaining paths corresponding to relatively small distances based on the first distances; sequentially performing sequence detection on each symbol in the second symbol sequence based on the paths corresponding to the 2 k-1  relatively small distances, calculating second distances between each symbol in the second symbol sequence and each ideal symbol sequence, and after the sequence detection is performed on a last symbol, obtaining an ideal symbol sequence corresponding to a minimum distance based on the second distances; and using the ideal symbol sequence corresponding to the minimum distance as an output symbol sequence.

Claim (Index 18):
The decoding apparatus according to  claim 15 , wherein both the first distances and the second distances are measure distances.

Metadata:
- Claim Count in Document: 44.0
- Percentile: 94.0
- Lexical Diversity: 2.83636
- Patent Class: 375.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['14537167', '09330182', '12013585', '13518437', '11418151']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4515002433855054
- 35 USC 102 Novelty (BERT): 0.5003546531942396
- Combined Prediction Score: 0.4563856843663788
- Mean Citation Score: 187.219088
- Max Citation Score: 192.68225
- Similarity Product: 126.74681260600688

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

Dataset: test