In mathematics, the Fourier sine and cosine transforms are integral equations that decompose arbitrary functions into a sum of sine waves representing the odd component of the function plus cosine waves representing the even component of the function.
Since the sine and cosine transforms use sine and cosine waves instead of complex exponentials and don't require complex numbers or negative frequency, they more closely correspond to Joseph Fourier's original transform equations and are still preferred in some signal processing and statistics applications and may be better suited as an introduction to Fourier analysis.
is frequency in cycles per unit time,[note 2] but in the abstract, they can be any dual pair of variables (e.g. position and spatial frequency).
The sine transform is necessarily an odd function of frequency, i.e. for all
The cosine transform is necessarily an even function of frequency, i.e. for all
The multiplication rules for even and odd functions shown in the overbraces in the following equations dramatically simplify the integrands when transforming even and odd functions.
Some authors[1] even only define the cosine transform for even functions
, the cosine transform of any even function can be simplified to avoid negative
of any odd function is zero, the cosine transform of any odd function is simply zero:
and the sine transform of any even function is simply zero:
The sine transform represents the odd part of a function, while the cosine transform represents the even part of a function.
Just like the Fourier transform takes the form of different equations with different constant factors (see Fourier transform § Unitarity and definition for square integrable functions for discussion), other authors also define the cosine transform as[2]
is typically used to represent the time domain,
can be recovered from its sine and cosine transforms under the usual hypotheses[note 4] using the inversion formula:[4]
is an odd function, then the cosine transform is zero, so its inversion simplifies to:
is an even function, then the sine transform is zero, so its inversion also simplifies to:
Remarkably, these last two simplified inversion formulas look identical to the original sine and cosine transforms, respectively, though with
A consequence of this symmetry is that their inversion and transform processes still work when the two functions are swapped.
is integrable, and is of bounded variation on an open interval containing the point
This latter form is a useful intermediate step in proving the inverse formulae for the since and cosine transforms.
One method of deriving it, due to Cauchy is to insert a
The complex exponential form of the Fourier transform used more often today is[7]
it can be shown (for real-valued functions) that the Fourier transform's real component is the cosine transform (representing the even component of the original function) and the Fourier transform's imaginary component is the negative of the sine transform (representing the odd component of the original function):[8]
An advantage of the modern Fourier transform is that while the sine and cosine transforms together are required to extract the phase information of a frequency, the modern Fourier transform instead compactly packs both phase and amplitude information inside its complex valued result.
The sine and cosine transforms meanwhile have the advantage that all quantities are real.
Since positive frequencies can fully express them, the non-trivial concept of negative frequency needed in the regular Fourier transform can be avoided.
They may also be convenient when the original function is already even or odd or can be made even or odd, in which case only the cosine or the sine transform respectively is needed.
For instance, even though an input may not be even or odd, a discrete cosine transform may start by assuming an even extension of its input while a discrete sine transform may start by assuming an odd extension of its input, to avoid having to compute the entire discrete Fourier transform.
Using standard methods of numerical evaluation for Fourier integrals, such as Gaussian or tanh-sinh quadrature, is likely to lead to completely incorrect results, as the quadrature sum is (for most integrands of interest) highly ill-conditioned.
Special numerical methods which exploit the structure of the oscillation are required, an example of which is Ooura's method for Fourier integrals[9] This method attempts to evaluate the integrand at locations which asymptotically approach the zeros of the oscillation (either the sine or cosine), quickly reducing the magnitude of positive and negative terms which are summed.