Subspace-Constrained Partial Update Method For High-Dimensional Adaptive Processing Systems
OwnerBrian G. Ageeinventor
Life of this patent
Estimating the term…
Loading patent…
OwnerBrian G. Ageeinventor
Estimating the term…
A method is explained for any adaptive processor processing digital signals by adjusting signal weights on digital signal(s) it handles, to optimize adaptation criteria responsive to a functional purpose or externalities (transient, temporary, situational, and even permanent) of that processor. Adaptation criteria for the adaptive algorithm may be any combination of a signal or parameter estimation, and measured quality(ies). This method performs a linear transformation adapting parameters from M to (M1+L) dimensions in each adaptation event, such that M1 weights are updated without constraints and M0=M−M1 weights are forced by soft constraints into an L-dimensional subspace they spanned at the beginning of the adaptation period. The same dimensionality reduction, using the same linear transformation, is applied to the input data. The reduced-dimensionality weights are then adapted using the identical optimization strategy employed by the processor, except with input data that has also been reduced in dimensionality.
1) A method of implementing partial updates in an adaptive processor that adjusts weights to optimize an adaption criterion in a signal estimation or parameter estimation algorithm comprising, during each of a plurality of successive cycles:
5) A method of implementing partial updates in an adaptive processor that adjusts weights to optimize an adaption criterion in a signal estimation or parameter estimation algorithm comprising, during each of a plurality of successive cycles:
9) A method of implementing partial updates in an adaptive processor that adjusts weights to optimize an adaption criterion in a signal estimation or parameter estimation algorithm comprising, during each of a plurality of successive cycles:
Dependencies are inferred from the claim text.