In mathematics, the Zak transform (also known as the Gelfand mapping) is a certain operation which takes as input a function of one variable and produces as output a function of two variables. The output function is called the Zak transform of the input function. The transform is defined as an infinite series in which each term is a product of a dilation of a translation by an integer of the function and an exponential function. In applications of Zak transform to signal processing the input function represents a signal and the transform will be a mixed time–frequency representation of the signal. The signal may be real valued or complex-valued, defined on a continuous set (for example, the real numbers) or a discrete set (for example, the integers or a finite subset of integers). The Zak transform is a generalization of the discrete Fourier transform.[1] [2]
The Zak transform had been discovered by several people in different fields and was called by different names. It was called the "Gelfand mapping" because Israel Gelfand introduced it in his work on eigenfunction expansions. The transform was rediscovered independently by Joshua Zak in 1967 who called it the "k-q representation". There seems to be a general consensus among experts in the field to call it the Zak transform, since Zak was the first to systematically study that transform in a more general setting and recognize its usefulness.[1] [2]
In defining the continuous-time Zak transform, the input function is a function of a real variable. So, let f(t) be a function of a real variable t. The continuous-time Zak transform of f(t) is a function of two real variables one of which is t. The other variable may be denoted by w. The continuous-time Zak transform has been defined variously.
Let a be a positive constant. The Zak transform of f(t), denoted by Za[''f''], is a function of t and w defined by[1]
Za[f](t,w)=
| infty | |
| \sqrt{a}\sum | |
| k=-infty |
f(at+ak)e-2\pi
The special case of Definition 1 obtained by taking a = 1 is sometimes taken as the definition of the Zak transform.[2] In this special case, the Zak transform of f(t) is denoted by Z[''f''].
Z[f](t,w)=
| infty | |
| \sum | |
| k=-infty |
f(t+k)e-2\pi
The notation Z[''f''] is used to denote another form of the Zak transform. In this form, the Zak transform of f(t) is defined as follows:
Z[f](t,\nu)=
| infty | |
| \sum | |
| k=-infty |
f(t+k)e-k\nu
Let T be a positive constant. The Zak transform of f(t), denoted by ZT[''f''], is a function of t and w defined by[2]
ZT[f](t,w)=
| infty | |
| \sqrt{T}\sum | |
| k=-infty |
f(t+kT)e-2\pi
The Zak transform of the function
\phi(t)=\begin{cases}1,&0\let<1\ 0,&otherwise\end{cases}
Z[\phi](t,w)=e-2\pi
\lceil-t\rceil
-t
In the following it will be assumed that the Zak transform is as given in Definition 2.
1. Linearity
Let a and b be any real or complex numbers. Then
Z[af+bg](t,w)=aZ[f](t,w)+bZ[g](t,w)
Z[f](t,w+1)=Z[f](t,w)
Z[f](t+1,w)=e2\piZ[f](t,w)
Z[\bar{f}](t,w)=\overline{Z[f]}(t,-w)
If f(t) is even then
Z[f](t,w)=Z[f](-t,-w)
If f(t) is odd then
Z[f](t,w)=-Z[f](-t,-w)
Let
\star
Z[f\starg](t,w)=Z[f](t,w)\starZ[g](t,w)
Given the Zak transform of a function, the function can be reconstructed using the following formula:
f(t)=
| 1 | |
| \int | |
| 0 |
Z[f](t,w)dw.
Let
f(n)
n\inZ
f(n)
n
w
The discrete Zak transform of the function
f(n)
n
Z[f]
| infty | |
| Z[f](n,w)=\sum | |
| k=-infty |
f(n+k)e-2\pi.
Given the discrete transform of a function
f(n)
f(n)=
| 1 | |
| \int | |
| 0 |
Z[f](n,w)dw.
The Zak transform has been successfully used in physics in quantum field theory,[3] in electrical engineering in time-frequency representation of signals, and in digital data transmission. The Zak transform has also applications in mathematics. For example, it has been used in the Gabor representation problem.