Search Results for ""

A one-sided (singly infinite) Z-Transform, Z[{a_n}_(n=0)^infty](z)=sum_(n=0)^infty(a_n)/(z^n). This is the most common variety of Z-transform since it is essentially ...

The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

A one-dimensional transform which makes use of the Haar functions.

A transform which localizes a function both in space and scaling and has some desirable properties compared to the Fourier transform. The transform is based on a wavelet ...

The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...

Let f(x) be a positive definite, measurable function on the interval (-infty,infty). Then there exists a monotone increasing, real-valued bounded function alpha(t) such that ...

A fast Fourier transform-like algorithm which produces a hologram of an image.

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...

An efficient version of the Walsh transform that requires O(nlnn) operations instead of the n^2 required for a direct Walsh transform (Wolfram 2002, p. 1072).

The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...