PATENT CLAIM ANALYSIS

Application Number: 16163824
Application Type: Utility
Filing Date: 2018-10
Publication Date: 2019-04
Patent Classification: ["375", "316000"]

Abstract:
According to an aspect of the present invention, a signal processor comprises an N-point phase FFT transformer operative to perform a FFT like transformation according to a first relation Y  [ k ] = ∑ n = 0 n = N - 1   exp [ j   angle  [ x  ( n ) ] ] * exp  [ - j   2  π   kn N ] , wherein angle [x(n)] representing the phase of the signal x(n). In that, a plurality of butterfly units with each butterfly unit in the plurality of butterfly units comprises an adder, subtractor and a multiplier, wherein the adder, the subtractor and multiplier receive a phase only signals with a signal amplitude less than unity. The butterfly units are arranged in plurality of stages to perform the operation as in the first relation.

Claim (Index 1):
A signal processor comprising:\n an N-point phase FFT transformer operative to perform a FFT like transformation according to a first relation: Y \ue8a0 [ k ] = \u2211 n = 0 n = N - 1 \ue89e \ue89e exp [ j \ue89e \ue89e angle \ue89e [ x \ue8a0 ( n ) ] * exp \ue8a0 [ - j \ue89e \ue89e 2 \ue89e \ue89e \u03c0 \ue89e \ue89e kn N ] , wherein angle [x(n)] representing the phase of the signal x(n)

Metadata:
- Claim Count in Document: 11.0
- Percentile: 97.0
- Lexical Diversity: 2.17105
- Patent Class: 375.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['10865210', '12413511', '14761995', '10140771', '10129046']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4077007119599882
- 35 USC 102 Novelty (BERT): 0.480129890494125
- Combined Prediction Score: 0.4149436298134019
- Mean Citation Score: 144.807108
- Max Citation Score: 153.34604
- Similarity Product: 109.07285612856148

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