DocumentCode :
1165027
Title :
Stochastic Signal Representation
Author :
Coraluppi, Giorgio ; Young, Tzay Y.
Volume :
16
Issue :
2
fYear :
1969
fDate :
5/1/1969 12:00:00 AM
Firstpage :
155
Lastpage :
161
Abstract :
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 set S that subset S_{m} of m basis functions that best represents the elements of the ensemble. In this context the optimum representation is defined as the basis set S_{m} , which minimizes the expected value of a suitable performance index Q , defined as a function of both the basis S_{m} and the random signal f(t) . In particular, Q is here assumed to be the least-square error that may be achieved when the signal f(t) is approximated by a linear combination of the elements of S_{m} . 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.
Keywords :
Basis functions; Signal representations; Stochastic approximation algorithm; Approximation algorithms; Circuit theory; Convergence; Eigenvalues and eigenfunctions; Helium; Iterative methods; Linear approximation; Performance analysis; Signal representations; Stochastic processes;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1969.1082923
Filename :
1082923
Link To Document :
بازگشت