PATENT CLAIM ANALYSIS

Application Number: 16026811
Application Type: Utility
Filing Date: 2018-07
Publication Date: 2019-06
Patent Classification: ["714", "776000"]

Abstract:
Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Claim (Index 40):
A decoder for decoding data that was encoded with an outer code then encoded with an inner code, the decoder comprising:\n a receiver for receiving each sequence of data symbols in the plurality from a noisy data channel; a noise guesser for selecting, according to a noise guessing order, a sequence of noise symbols previously unselected for each given received sequence of data symbols; a buffer for storing symbols formed by inverting a noise effect, of the selected sequence of noise symbols, on the given received sequence of data symbols; a codeword validator for obtaining a termination condition when the formed symbols comprise a codeword for the inner code; a memory for storing, for the given received sequence of data symbols when the termination condition is obtained, the formed symbols as a codeword for the inner code; an outer decoder for collectively decoding, when the memory stores a number k of codewords for the inner code wherein the number k\u2264m is determined by the outer code, the k stored codewords according to the outer code; and an outputter for outputting the decoded data.

Metadata:
- Claim Count in Document: 59.0
- Percentile: 95.0
- Lexical Diversity: 1.57282
- Patent Class: 714.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['16026822', '12411066', '10329864', '15236066', '15593402']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2368405437407311
- 35 USC 102 Novelty (BERT): 0.558265007796978
- Combined Prediction Score: 0.2689829901463558
- Mean Citation Score: 227.396804
- Max Citation Score: 420.35922
- Similarity Product: 396.8143455665374

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

Dataset: test