Discrete function theory has recently received considerable attention from many authors. Among these are Duffin and Duris [l, 21, Ferrand [3], and Washburn [4]. In [I], Duffin and Duris present discrete analogs of the onesided and two-sided Laplace transform. Washburn [4] develops the notion of a D-transform and uses it to find solutions of certain types of equations involving discrete functions, their integrals, and their derivatives. Here, we define a discrete analog of the classical Fourier transform and present some of its properties. Section 2, below, is concerned with the actual definition of the discrete Fourier transform and the inversion formula of Theorem 2.3. We also find that the Fourier transforms of two functions agree only when the functions differ by an additive function of the form (1)” K. In Section 3, a convolution theorem and an analog of Parseval’s indentity are proved. Section 4 lists the basic properties of the discrete Fourier transform, and provides some examples of discrete function-discrete Fourier transform pairs. We indicate a possible method for solving the filtering problem calf : h(t X) Sx = g(t) and solve an illustrative example. In what is to follow, we use the discrete exponential function e(z, t) defined by Ferrand [3] to be
Read full abstract