1- 1. Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran
2- 1. Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran , j.pourrostam@tabrizu.ac.ir
Abstract: (31 Views)
There are several ways of representing functions using some other basis functions. One way is using methods like Fourier series, power series, Laurent series and expansion in Bessel functions. Basis functions in these methods are deterministic functions and don’t have any random parameters. In another way, we can use a linear combination of some basis functions to determine an approximation to a known function, such that the basis functions are also with known definition but have some random parameters chosen from a probability space. In this paper we use discrete random processes as a basis to represent deterministic discrete functions. The functions to be represented are discrete. The used random processes are discrete WSS random processes, or equivalently sequences of i.i.d. random variables. In this method for each random process a coefficient is related, and the mean of these weighted random processes are calculated. These coefficients are random variables that depend on both random process and the deterministic function. It is shown that this mean of weighted random processes converges to the deterministic function with probability 1 (almost surely) and also in MS sense. If we consider the mean of only a finite number of random processes, we obtain an approximation to the deterministic function. The error of this approximation is considered as a random variable and the mean of the error is calculated. A formula relating the energy of the deterministic function and the power of the coefficients, similar to the Parseval's theorem in Fourier analysis, is obtained. There is some characteristics like linearity in this representation.
Type of Study:
S |
Subject:
stat Received: 2022/11/15 | Revised: 2025/12/17 | Accepted: 2025/11/2 | Published: 2025/12/17 | ePublished: 2025/12/17