PATENT CLAIM ANALYSIS

Application Number: 15926041
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2019-06
Patent Classification: ["370", "343000"]

Abstract:
A generalized frequency division multiplexing (GFDM) transceiver system includes a low complex GFDM transmitter with multiple sub-carriers and timeslots having IFFT based modulator for modulating data corresponding to a particular timeslot and different sub-carriers to corresponding sub-carrier frequencies and thereby generating transmittable GFDM data signal, multipath frequency selective fading GFDM channel having uncorrelated channel coefficients corresponding to different paths for transmitting the modulated GFDM data signal and a low complex GFDM receiver configured to operate with said multipath frequency selective fading channel involving channel equalization followed by self-interference equalization to receive the transmitted modulated GFDM data signal and thereby de-modulate the GFDM data signal to obtain the data.

Claim (Index 8):
The generalized frequency division multiplexing (GFDM) transceiver system as claimed in  claim 6 , wherein the joint-MMSE receiver includes:\n MN-point FFT operator to convert the equalized received GFDM data signal into frequency domain; means to multiply the received signal in frequency domain with complex valued channel information-based weights and then converting back to time domain using MN-point IFFT operator; means for reshuffling the physical connections in the MN-point IFFT operator for grouping the time domain converted samples according to subcarrier number followed by:\n converting the samples of each group into frequency domain using the M-point FFT operator; and \n multiplying the converted samples with pre-computed weights; \n means for reshuffling the physical connections in the M-point FFT operator for regrouping the converted samples according to time slots followed by converting samples of each group into frequency domain using the N-point FFT operator; processing the converted samples following Algorithm 1; means for reshuffling the physical connections in the N-point FFT operator for regrouping the processed samples according to sub-carrier number followed by:\n converting the samples of each group to time domain using the M-point IFFT operator; and \n multiplying the converted samples with complex weights computed using Algorithm 2; and \n means for reshuffling the physical connections in the M-point IFFT operator for regrouping the multiplied samples according to time slots to obtain equalized MN-point samples.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 90.0
- Lexical Diversity: 1.77778
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['14916431', '14021840', '12566216', '15160998', '15593691']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5385106300911292
- 35 USC 102 Novelty (BERT): 0.5230172733219879
- Combined Prediction Score: 0.536961294414215
- Mean Citation Score: 257.621414
- Max Citation Score: 306.04285
- Similarity Product: 211.3921677144587

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