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 13):
A method for decoding codes represented by a parity check matrix of dimension (N\u2212K)\u00d7N, comprising:\n a. generating P>1 parity check matrices with N\u2212K sparse columns wherein up to N\u2212K sparse columns contain only a single entry equal to 1 per column, wherein sparse columns of each of P parity check matrices correspond to different subsets of N\u2212K bit log-likelihood ratios of N\u2212K+R least reliable bit log-likelihood ratios, wherein R\u2265P is a configurable integer; b. decoding of channel log-likelihood ratios using said P parity check matrices with sparse columns to produce updated log-likelihood ratios by employing soft-input soft-output message passing decoding until a desired number of iterations is reached or until said decoding using at least one of said P matrices produces a valid codeword; and c. on the condition that 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 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.6932197717800582
- 35 USC 102 Novelty (BERT): 0.6504512815547014
- Combined Prediction Score: 0.6889429227575226
- Mean Citation Score: 689.257146
- Max Citation Score: 721.49854
- Similarity Product: 531.9028449059533

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