cosine transform

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. The modern Fourier transform concisely contains both the sine and cosine transforms. 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.

Definition

The Fourier sine transform of $f(t)$ is:
If $t$ means time, then $\xi$ is frequency in cycles per unit time, 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 $\xi$:
$^s(-\xi) = - ^s(\xi).$

The Fourier cosine transform of $f(t)$ is:
The cosine transform is necessarily an even function of frequency, i.e. for all $\xi$:
$^c(-\xi) = ^c(\xi).$

Odd and even simplification

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 even only define the cosine transform for even functions $f_\text(t)$. Since cosine is an even function and because the integral of an even function from $\infty$ to $\infty$ is twice its integral from $0$ to $\infty$, the cosine transform of any even function can be simplified to avoid negative $t$:

$^c(\xi) = \int_^\infty \overbrace^\text \, dt = 2 \int_0^\infty f_\text(t)\cos(2\pi \xi t) \, dt.$

And because the integral from $\infty$ to $\infty$ of any odd function is zero, the cosine transform of any odd function is simply zero:

$^c(\xi) = \int_^\infty \overbrace^\text \, dt = 0.$

Similarly, because sin is odd, the sine transform of any odd function $f_\text(t)$ also simplifies to avoid negative $t$:

$^s(\xi) = \int_^ \overbrace^\text \, dt = 2\int_0^\infty f_\text(t)\sin(2\pi \xi t) \, dt$

and the sine transform of any even function is simply zero:

$^s(\xi) = \int_^\infty \overbrace^\text \, dt = 0.$

The sine transform represents the odd part of a function, while the cosine transform represents the even part of a function.

Other conventions

Just like the Fourier transform takes the form of different equations with different constant factors (see for discussion), other authors also define the cosine transform as
$^c(\xi)=\sqrt \int_0^\infty f(t)\cos(2\pi \xi t) \,dt$
and the sine transform as
$^s(\xi) =\sqrt \int_0^\infty f(t)\sin(2\pi \xi t) \,dt.$Another convention defines the cosine transform as $F_c(\alpha) = \frac \int_0^\infty f(x) \cos(\alpha x) \, dx$ and the sine transform as $F_s(\alpha) = \frac \int_0^\infty f(x) \sin(\alpha x) \, dx$using $\alpha$ as the transformation variable. And while $t$ is typically used to represent the time domain, $x$ is often instead used to represent a spatial domain when transforming to spatial frequencies.

Fourier inversion

The original function $f$ can be recovered from its sine and cosine transforms under the usual hypotheses using the inversion formula:

Simplifications

Note that since both integrands are even functions of $\xi$, the concept of negative frequency can be avoided by doubling the result of integrating over non-negative frequencies:

$f(t) = 2 \int _^\infty ^s(\xi) \sin (2\pi \xi t) \,d\xi \, + 2 \int _^\infty ^c(\xi) \cos (2\pi \xi t) \,d\xi \, .$

Also, if $f$ is an odd function, then the cosine transform is zero, so its inversion simplifies to:$f(t) = \int _^\infty ^s(\xi) \sin (2\pi \xi t) \, d\xi , \textf(t)\text$

Likewise, if the original function $f$ is an even function, then the sine transform is zero, so its inversion also simplifies to:

$f(t) = \int _^\infty ^c(\xi) \cos (2\pi \xi t) \, d\xi , \textf(t)\text$

Remarkably, these last two simplified inversion formulas look identical to the original sine and cosine transforms, respectively, though with $t$ swapped with $\xi$ (and with $f$ swapped with $^s$ or $^c$). A consequence of this symmetry is that their inversion and transform processes still work when the two functions are swapped. Two such functions are called ''transform pairs''.

Overview of inversion proof

Using the addition formula for cosine, the full inversion formula can also be rewritten as ''Fourier's integral formula'':
$f(t) = \int _^\infty \int_^\infty f(x) \cos (2\pi\xi (x-t) ) \,dx\,d\xi.$
This theorem is often stated under different hypotheses, that $f$ is integrable, and is of bounded variation on an open interval containing the point $t$, in which case
$\tfrac12\lim_\left(f(t+h)+f(t-h)\right) = 2\int_0^\infty \int_^\infty f(x) \cos (2\pi\xi (x-t) ) \,dx\,d\xi.$

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 $e^$ into the integral, where $\delta > 0$ is fixed. Then
$2\int_^\infty \int_0^\infty e^\cos(2\pi\xi(x-t))\,d\xi\, f(x)\,dx = \int_^\infty f(x)\frac\,dx.$
Now when $\delta\to 0$, the integrand tends to zero except at $x=t$, so that formally the above is
$f(t)\int_^\infty \frac\,dx = f(t).$

Relation with complex exponentials

The complex exponential form of the Fourier transform used more often today is
$\begin \hat(\xi) &= \int_^\infty f(t) e^\,dt \\ \end \,$where $i$ is the square root of negative one. By applying Euler's formula $(e^ = \cos x + i \sin x) ,$ 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):$\begin \hat(\xi) &= \int_^\infty f(t) \left(\cos (2\pi\xi t) - i\,\sin (2\pi\xi t)\right) dt && \text \\ &= \left (\int_^\infty f(t)\cos(2\pi \xi t) \,dt \right ) - i \left (\int_^\infty f(t)\sin(2\pi \xi t) \,dt \right ) \\ &= ^c (\xi) - i \, ^s (\xi) \, . \end$Because of this relationship, the cosine transform of functions whose Fourier transform is known (e.g. in ) can be simply found by taking the real part of the Fourier transform:$^c(\xi) = \mathrm$while the sine transform is simply the ''negative'' of the imaginary part of the Fourier transform:$^s(\xi) = - \mathrm \, .$

Pros and cons

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. But a disadvantage is its requirement on understanding complex numbers, complex exponentials, and negative frequency.

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.

Numerical evaluation

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 integralsTakuya Ooura, Masatake Mori, ''A robust double exponential formula for Fourier-type integrals'', Journal of computational and applied mathematics 112.1-2 (1999): 229-241. 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.

See also

*Discrete cosine transform
*Discrete sine transform
*List of Fourier-related transforms

Notes

{{NoteFoot

References

* Whittaker, Edmund, and James Watson, ''A Course in Modern Analysis'', Fourth Edition, Cambridge Univ. Press, 1927, pp. 189, 211

Integral transforms
Fourier analysis
Mathematical physics