PATENT CLAIM ANALYSIS

Application Number: 16171224
Application Type: Utility
Filing Date: 2018-10
Publication Date: 2019-02
Patent Classification: ["375", "260000"]

Abstract:
Systems and methods for decoding block and concatenated codes are provided. These include advanced iterative decoding techniques based on belief propagation algorithms, with particular advantages when applied to codes having higher density parity check matrices such as iterative soft-input soft-output and list decoding of convolutional codes, Reed-Solomon codes and BCH codes. Improvements are also provided for performing channel state information estimation including the use of optimum filter lengths based on channel selectivity and adaptive decision-directed channel estimation. These improvements enhance the performance of various communication systems and consumer electronics. Particular improvements are also provided for decoding HD radio signals, satellite radio signals, digital audio broadcasting (DAB) signals, digital audio broadcasting plus (DAB+) signals, digital video broadcasting-handheld (DVB-H) signals, digital video broadcasting-terrestrial (DVB-T) signals, world space system signals, terrestrial-digital multimedia broadcasting (T-DMB) signals, and China mobile multimedia broadcasting (CMMB) signals. These and other improvements enhance the decoding of different digital signals.

Claim (Index 15):
A method for simple greedy scheduling of check equation updates, for at least M equations, where 1<M\u2264N\u2212K, during an iteration in decoding of codes represented by a parity check matrix with N\u2212K parity check rows and N columns, the method comprising the following steps:\n a. for each check node i, out of M check nodes of the parity check matrix, calculating Val i =Min 1 +Min 2 , i=1, 2, . . . , L where L\u22651 and where Min 1  and Min 2  are the two smallest values in the set of absolute values of variable-to-check messages {|Mvc(i,:)I} where index i corresponds to the set of check nodes; b. sorting the set {Val i } calculated in step a in decreasing order to obtain an ordering vector I={I 1 , I 2 , . . . , I M }, such that I 1  is the index of a check node with the largest value Val, I 2  is the index of a check node with the next largest value Val and I M  is the index of a check node with the smallest value Val; and c. updating M check node equations, according to the ordering vector, I={I 1 , I 2 , I M } calculated in step b, by calculating and propagating corresponding check-to-variable messages.

Metadata:
- Claim Count in Document: 53.0
- Percentile: 97.0
- Lexical Diversity: 1.85417
- Patent Class: 375.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15236066', '14942570', '13693023', '14825557', '14825531']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.7134960443647546
- 35 USC 102 Novelty (BERT): 0.6660332392439328
- Combined Prediction Score: 0.7087497638526724
- Mean Citation Score: 689.257146
- Max Citation Score: 721.49854
- Similarity Product: 600.5989685226452

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