PATENT CLAIM ANALYSIS

Application Number: 15957657
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2019-10
Patent Classification: ["708", "446000"]

Abstract:
The present disclosure relates to methods and systems for signal processing using coordinate descent technique for solving technical implementation problems that are expressed as unit-modulus least squares (UMLS) and unit-modulus quadratic program (UMQP) problems. Embodiments provide for iteratively minimizing an objective function of a signal vector associated with a UMLS/UMQP problem expression over a set of coordinates of the signal vector to a convergence point. The objective function is minimized with respect to a vector element corresponding to a selected coordinate index, while other vector elements that do not correspond to the selected coordinate index are fixed. Accordingly, at each iteration, minimizing the objective function involves a solution to a one-dimensional univariate quadratic minimization. Embodiments also provide various coordinate index selection rules that include a cyclic CD rule (CCD), a randomized CD rule (RCD), randomly permuted CD rule (RPCD), and a greedy CD rule (CCD).

Claim (Index 1):
A method of communications in a wireless communication system, the communications including operations expressed as a function of a signal vector subject to a unit-modulus constraint, wherein the function of the signal vector is iteratively minimized over a set of coordinates to a convergence point, the method comprising:\n selecting, at a current iteration of the operations, a coordinate index corresponding to a vector element of the signal vector; applying, at the current iteration, minimizing operations to the function of the signal vector with respect to the vector element corresponding to the selected coordinate index, wherein the minimizing operations result in an optimal value for the vector element corresponding to the selected coordinate index with respect to a next iteration, the next iteration being subsequently adjacent to the current iteration, and wherein vector elements corresponding to coordinate indices different than the selected coordinate index are not changed by the minimizing operations in the current iteration; and updating a residual of the function of the signal vector, with respect to the next iteration, based on the optimal vector element, wherein updating the residual value of the next iteration includes a scalar-vector multiplication operation of the optimal vector element.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 91.0
- Lexical Diversity: 1.80645
- Patent Class: 708.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15344279', '10399848', '14642904', '15952864', '12853886']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3606926250776679
- 35 USC 102 Novelty (BERT): 0.5002701704612676
- Combined Prediction Score: 0.374650379616028
- Mean Citation Score: 158.440458
- Max Citation Score: 165.73698000000005
- Similarity Product: 106.06789116807464

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