Answers are grounded in this paper and cite their sources.
The representation of signals in the time domain requires the decomposition of functions of time into linear combinations of a finite number of basis functions. The purpose of this paper is to introduce a stochastic approximation algorithm, which, given an ensemble of signals\{f(t)\}, selects from a setSthat subsetSₘofmbasis functions that best represents the elements of the ensemble. In this context the optimum representation is defined as the basis setSₘ, which minimizes the expected value of a suitable performance indexQ, defined as a function of both the basisSₘand the random signalf(t). In particular,Qis here assumed to be the least-square error that may be achieved when the signalf(t)is approximated by a linear combination of the elements ofSₘ. The procedure is analyzed in detail for the case when the basis functions are one-sided complex exponentials. The convergence properties of the algorithm are discussed for this case. An illustrative example of application of the proposed method is also presented.
No takes yet. Share an insight, caveat, or question.
Coraluppi et al. (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: