PATENT CLAIM ANALYSIS

Application Number: 16049724
Application Type: Utility
Filing Date: 2018-07
Publication Date: 2019-02
Patent Classification: ["714", "758000"]

Abstract:
This invention presents a method and apparatus for vertical layered finite alphabet iterative decoding of low-density parity-check codes (LDPC) which operate on parity check matrices that consist of blocks of sub-matrices. The iterative decoding involves passing messages between variable nodes and check nodes of the Tanner graph that associated with one or more sub-matrices constitute decoding blocks, and the messages belong to a finite alphabet. Various embodiments for the method and apparatus of the invention are presented that can achieve very high throughputs with low hardware resource usage and power.

Claim (Index 1):
A method for vertical layered finite alphabet iterative decoding of low-density parity-check (LDPC) codes, comprising:\n receiving channel values belonging to a channel output alphabet as inputs; iteratively processing one or more sub-matrices of a parity-check matrix constituting a plurality of decoding blocks, wherein the processing includes: traversing, in arbitrary order, a parity-check matrix sequentially from one decoding block to another decoding block either within a column block, or across one or more column blocks, in arbitrary order; computing, updating, and passing messages belonging to a finite alphabet, wherein the messages are iteratively passed between variable nodes and check nodes associated with the one or more sub-matrices in the decoding blocks; and using one or more variable node update functions to compute outgoing messages of the variable nodes; computing hard-decision estimates based on the messages received by the variable nodes; checking whether the hard-decision estimates constitute a codeword; and outputting the codeword, in accordance with the hard-decision estimates constituting a codeword.

Metadata:
- Claim Count in Document: 56.0
- Percentile: 95.0
- Lexical Diversity: 1.47692
- Patent Class: 714.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14499284', '14950659', '14826161', '15686361', '11003940']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3606558637367278
- 35 USC 102 Novelty (BERT): 0.5066814628535168
- Combined Prediction Score: 0.3752584236484068
- Mean Citation Score: 306.18703399999987
- Max Citation Score: 315.19638
- Similarity Product: 259.15839024434564

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

Dataset: test