We introduce the operator Z that is often called the Zak transform. Our definition is a bit different from the one that usually appears in the literature. We will discuss this difference and will also give a historical account that the reader may find particularly interesting. In order to do this, however, we need to present our treatment of the operator Z (and Z̃) which shows that the Fourier t...

The problem of reconstructing a positive semi-definite 3-D image from the measurement of the magnitude of its 2-D fourier transform at a series of orientations is explored. The phase of the fourier transform is not measured. The algorithm developed here utilizes a Hamiltonian, or cost function, that at its minimum provides the solution to the stated problem. The energy function includes both da...

In engineering and applied mathematics, Zak transforms have been effectively used for over 50 years in various applied settings. As Gelfand observed in a 1950 paper, the variable coefficient Fourier series ideas articulated in Andre Weil’s famous book on integration lead to an exceedingly elementary proof of the Plancherel Theorem for LCA groups. The transform for functions on R appearing in Za...

The 2-D Fourier transform has been generalized into the 2-D separable fractional Fourier transform (replaces 1-D Fourier transform by 1-D fractional Fourier transform for each variable) and the 2-D separable canonical transform (further replaces the fractional Fourier transform by canonical transform) in [3]. It also has been generalized into the 2-D unseparable fractional Fourier transform wit...

Europhysics Letters (EPL) has a new online home at www.epljournal.org Take a look for the latest journal news and information on: • reading the latest articles, free! • receiving free e-mail alerts • submitting your work to EPL Abstract – Ramanujan sums are exponential sums with exponent defined over the irreducible fractions. Until now, they have been used to provide converging expansions to s...

Suppose we have a function s(t) that measures the sound level at time t of an analog audio signal. We assume that s(t) is piecewise-continuous and of finite duration: s(t) = 0 when t is outside some interval a ≤ t ≤ b. Make a change of variable x = (t− a)/(b− a) and set f(x) = s(t). Then 0 ≤ x ≤ 1 when a ≤ t ≤ b, and f(x) is a piecewise continuous function of x. We convert f(x) into a digital s...

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...

This chapter covers the fundamental principles and current applications of Fourier transform (FT) infrared and Fourier transform Raman spectroscopies as utilized in the analysis of polymeric materials. The primary emphasis of the first part is on the principles and advantages of these interferometric methods, whereas the remaining sections illustrate numerous applications focusing on the struct...

This paper proposes new image compression technique that uses Real Fourier Transform. Discrete Fourier Transform (DFT) contains complex exponentials. It contains both cosine and sine functions. It gives complex values in the output of Fourier Transform. To avoid these complex values in the output, complex terms in Fourier Transform are eliminated. This can be done by using coefficients of Discr...