PATENT CLAIM ANALYSIS

Application Number: 16399298
Application Type: Utility
Filing Date: 2019-04
Publication Date: 2019-08
Patent Classification: ["375", "267000"]

Abstract:
Method of non-iterative singular-value decomposition (SVD). The method includes receiving, by receiver, a signal; determining, by a channel matrix generator connected to the receiver, a channel matrix for the received signal; reducing, by a singular-value decomposer connected to the channel matrix generator, the dimension of the channel matrix; performing, by the singular-value decomposer, an SVD on the dimension-reduced channel matrix to determine singular vectors and corresponding coefficients that maximize singular values of the singular vectors; and outputting a result of the SVD based on at least one of when the dimension of the dimension-reduced channel matrix is less than or equal to 2 and when two greatest singular values of corresponding singular vectors are determined.

Claim (Index 3):
The method of  claim 1 , wherein reducing the dimension of the channel matrix is comprised of reducing the dimension of the channel matrix by a rotation in a plane spanned by two coordinate axes.

Metadata:
- Claim Count in Document: 14.0
- Percentile: 100.0
- Lexical Diversity: 2.14754
- Patent Class: 375.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15950869', '14595819', '15828857', '13100966', '12554069']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4255212753232349
- 35 USC 102 Novelty (BERT): 0.5354436317473181
- Combined Prediction Score: 0.4365135109656433
- Mean Citation Score: 229.461628
- Max Citation Score: 353.9053
- Similarity Product: 256.3895606557727

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

Dataset: test