The objective of this paper is to develop the theoretical foundation to the pilot-assisted channel estimation using delay-time domain windowing for the coherent detection of OFDM signals. The pilotassisted channel estimation using delay-time domain windowing is jointly used with polynomial interpolation, decision feedback and Wiener filter. A closed-form BER expression is derived. The impacts o...

In this paper we study the solvability of backward doubly stochastic differential equations (BDSDEs for short) with polynomial growth coefficients and their connections with SPDEs. The corresponding SPDE is in a very general form, which may depend on the derivative of the solution. We use Wiener-Sobolev compactness arguments to derive a strongly convergent subsequence of approximating SPDEs. Fo...

A novel semiblind defocused image deconvolution technique is proposed, which is based on multivariate local polynomial regression MLPR and iterative Wiener filtering IWF . In this technique, firstly a multivariate local polynomial regression model is trained in wavelet domain to estimate defocus parameter. After obtaining the point spread function PSF parameter, iterative wiener filter is adopt...

Novel naphthylenic tori, generated by suitable modifications (that include the leapfrog procedure) of a square net embedded on the torus, are characterised by the ring spiral code, Hosoya polynomial and spectral data. The polynomial is formulated for two series of naphthylenic tori. The Wiener number is calculated by recursive formulae from the first derivative of the Hosoya polynomial, under x...

For the subclasses of nonlinear dynamic systems which can be considered as block oriented systems [8] there exist several identification methods using topologically identical models. One of the simplest nonlinear models of this category is the so-called Wiener model consisting of one linear dynamic block and one nonlinear static block. The Wiener models appear in many engineering applications [...

The distance d(u, v) between two vertices u and v of a graph G is equal to the length of a shortest path that connects u and v. Define WW (G, x) = 1/2 ∑ {a,b}⊆V (G) x d(a,b)+d(a,b), where d(G) is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are computed.

exists for every α ∈ R, where e(t) = e. What makes this a nontrivial strengthening of the Birkhoff ergodic theorem is that the set of full measure for which we have convergence does not depend on the choice of α ∈ R. Two different proofs of this theorem are based on the following results which are of interest on their own: (i) For ergodic systems, if f ∈ L(μ) and f ∈ E1(T ) , then for a.e. x ∈ ...

Space-time variational formulations and adaptive Wiener–Hermite polynomial chaos Galerkin discretizations of Kolmogorov equations in infinite dimensions, such as Fokker–Planck andOrnstein–Uhlenbeck equations for functions defined on an infinite-dimensional separable Hilbert space H , are developed. The wellposedness of these equations in the Hilbert space L2(H, μ) of functions on the infinite-d...