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 21):
The method of  claim 15  including storing updated P sequences of bit log likelihood ratios obtained after IT>1 iterations of said soft-input soft-output message passing decoding using P parity check matrices and on the condition that no valid codeword is produced using said additional decoding, further comprising the following steps:\n a. identifying Q\u2264N\u2212K disagreement positions on hard decisions of said P sequences of bit log-likelihood ratios; \n b. generating P new parity check matrices such that the sparse columns include N\u2212K columns corresponding to said Q\u2264N\u2212K disagreement positions and, on the condition that Q<N\u2212K, up to N\u2212K\u2212Q sparse columns corresponding to different combinations of N\u2212K\u2212Q of N\u2212K\u2212Q+R least reliable said updated P sequences of bit log-likelihood ratios, wherein R\u2265P is a configurable integer; \n c. decoding said updated log-likelihood ratios using said P new parity check matrices to produce further updated log-likelihood ratios, employing soft-input soft-output message passing decoding until a desired number of iterations is reached or until decoding using at least one of said P new parity check matrices produces a valid codeword; and\n on the condition that said decoding using said P parity check matrices produces no valid codeword, performing additional decoding that is based at least in part on algebraic decoding of the sequences of said further updated log-likelihood ratios.

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.6814902485877583
- 35 USC 102 Novelty (BERT): 0.6840283300513316
- Combined Prediction Score: 0.6817440567341156
- Mean Citation Score: 689.257146
- Max Citation Score: 721.49854
- Similarity Product: 695.4525501144493

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