Fractional Fourier transform of the Gaussian and fractional domain signal support

The fractional Fourier transform (FrFT) provides an important extension to conventional Fourier theory for the analysis and synthesis of linear chirp signals. It is a parameterised transform which can be used to provide extremely compact representations. The representation is maximally compressed when the transform parameter, α, is matched to the chirp rate of the input signal. Existing proofs are extended to demonstrate that the fractional Fourier transform of the Gaussian function also has Gaussian support. Furthermore, expressions are developed which allow calculation of the spread of the signal representation for a Gaussian windowed linear chirp signal in any fractional domain. Both continuous and discrete cases are considered. The fractional domains exhibiting minimum and maximum support for a given signal define the limit on joint time-frequency resolution available under the FrFT. This is equated with a restatement of the uncertainty principle for linear chirp signals and the fractional Fourier domains. The calculated values for the fractional domain support are tested empirically through comparison with the discrete transform output for a synthetic signal with known parameters. It is shown that the same expressions are appropriate for predicting the support of the ordinary Fourier transform of a Gaussian windowed linear chirp signal.