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 14):
The method of  claim 13  wherein said soft-input soft-output message passing decoding comprises the following steps for at least one variable node:\n a. calculating a check-to-variable message Mcv(i,j) from check node i to variable node j; \n b. identifying two smallest absolute values, Min 1  and Min 2 , in a set of variable-to-check messages Mvc(i, k), where k\u2260j, excluding the message from variable j to check node i, Mcv(i,j); \n c. calculating the scaling factor \u03b1=1\u2212\u03b2\u00b7Min 1 /Min 2 , where \u03b2 is a non-negative number such that 0\u2264\u03b2\u22641; and \n d. scaling the check-to-variable message Mcv(i,j) as Mcv(i,j)=\u03b1\u00b7Mcv(i,j).

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.7172783242260948
- 35 USC 102 Novelty (BERT): 0.6544824758763027
- Combined Prediction Score: 0.7109987393911156
- Mean Citation Score: 689.257146
- Max Citation Score: 721.49854
- Similarity Product: 600.6563367446648

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