PATENT CLAIM ANALYSIS

Application Number: 15937503
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-10
Patent Classification: ["714", "776000"]

Abstract:
Techniques are described to address run-time issues and other considerations of data structure reorganization operations executed while decoding a polar code. A receiving entity (e.g., a user equipment or a base station) may partition an array, or other data structure, into sections. The array may be used during a list decoding operation of a polar code. As the array is populated with path elements for candidate paths, each section may be organized and a permutation pattern calculated for each section. Upon identifying a section reorganization event, the array or subsections of the array may be reorganized according the permutation patterns determined for each section.

Claim (Index 24):
The apparatus of  claim 19 , wherein:\n the performing the list traversal comprises: reorganizing, for each bit-channel of a given list section, the candidate path elements within the given list section having a lower bit-channel index based on the selecting of the candidate paths for the each bit-channel.

Metadata:
- Claim Count in Document: 10.0
- Percentile: 90.0
- Lexical Diversity: 1.65714
- Patent Class: 714.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15851303', '15467321', '14684284', '15818393', '15819828']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3195231577345253
- 35 USC 102 Novelty (BERT): 0.4994889419608941
- Combined Prediction Score: 0.3375197361571622
- Mean Citation Score: 214.379318
- Max Citation Score: 231.08342
- Similarity Product: 147.84627962786908

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