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 19):
An apparatus for wireless communication, in a system comprising:\n a processor; memory in electronic communication with the processor; and instructions stored in the memory and operable, when executed by the processor, to cause the apparatus to:\n receive a codeword over a wireless channel, the codeword being encoded using a polar code; \n determine bit-channel metrics for a plurality of bit-channels of the polar code based on the received codeword; \n partition an array of candidate path elements into one or more list sections, the array of candidate path elements comprising a first dimension associated with a list size for decoding of the received codeword and a second dimension associated with a length of the plurality of bit-channels; \n perform a list traversal over the plurality of bit-channels based on path metrics derived from the bit-channel metrics to obtain a plurality of candidate paths, the list traversal comprising determining a sectional permutation pattern for each list section, the sectional permutation pattern identifying a nested permutation of the candidate path elements over the each list section based on selecting the list size of candidate paths according to path metrics for each bit-channel of the each list section; \n reorganize the array of candidate path elements based on the sectional permutation patterns such that each of the plurality of candidate paths comprises a vector of the array of candidate path elements aligned in the first dimension; and \n output at least one of the plurality of candidate paths.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2991935584897577
- 35 USC 102 Novelty (BERT): 0.4719740066426742
- Combined Prediction Score: 0.3164716033050494
- Mean Citation Score: 214.379318
- Max Citation Score: 231.08342
- Similarity Product: 201.1691563009357

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

Dataset: test