Harman Patil (Editor)

Sine and cosine transforms

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, the Fourier sine and cosine transforms are forms of the Fourier integral transform that do not use complex numbers. They are the forms originally used by Joseph Fourier and are still preferred in some applications, such as signal processing or statistics.

Contents

Definition

The Fourier sine transform of  f (t), sometimes denoted by either f ^ s or F s ( f ) , is

∫ − ∞ ∞ f ( t ) sin ⁡ ( 2 π ν t ) d t .

If t means time, then ν is frequency in cycles per unit time, but in the abstract, they can be any pair of variables which are dual to each other.

This transform is necessarily an odd function of frequency, i.e. for all ν:

f ^ s ( − ν ) = − f ^ s ( ν ) .

The numerical factors in the Fourier transforms are defined uniquely only by their product. Here, in order that the Fourier inversion formula not have any numerical factor, the factor of 2 appears because the sine function has L2 norm of 1 2 .

The Fourier cosine transform of  f (t), sometimes denoted by either f ^ c or F c ( f ) , is

∫ − ∞ ∞ f ( t ) cos ⁡ ( 2 π ν t ) d t .

It is necessarily an even function of frequency, i.e. for all ν:

f ^ c ( ν ) = f ^ c ( − ν ) .

Some authors only define the cosine transform for even functions of t, in which case its sine transform is zero. Since cosine is also even, a simpler formula can be used,

2 ∫ 0 ∞ f ( t ) cos ⁡ ( 2 π ν t ) d t .

Similarly, if  f  is an odd function, then the cosine transform is zero and the sine transform can be simplified to

2 ∫ 0 ∞ f ( t ) sin ⁡ ( 2 π ν t ) d t .

Fourier inversion

The original function  f  can be recovered from its transforms under the usual hypotheses, that  f  and both of its transforms should be absolutely integrable. For more details on the different hypotheses, see Fourier inversion theorem.

The inversion formula is

f ( t ) = ∫ 0 ∞ f ^ c cos ⁡ ( 2 π ν t ) d ν + ∫ 0 ∞ f ^ s sin ⁡ ( 2 π ν t ) d ν ,

which has the advantage that all frequencies are positive and all quantities are real. If the numerical factor 2 is left out of the definitions of the transforms, then the inversion formula is usually written as an integral over both negative and positive frequencies.

Using the addition formula for cosine, this is sometimes rewritten as

π 2 ( f ( x + 0 ) + f ( x − 0 ) ) = ∫ 0 ∞ ∫ − ∞ ∞ f ( t ) cos ⁡ ( ω ( t − x ) ) d t d ω ,

where  f (x + 0) denotes the one-sided limit of  f  as x approaches zero from above, and  f (x − 0) denotes the one-sided limit of  f  as x approaches zero from below.

If the original function  f  is an even function, then the sine transform is zero; if  f  is an odd function, then the cosine transform is zero. In either case, the inversion formula simplifies.

Relation with complex exponentials

The form of the Fourier transform used more often today is

f ^ ( ν ) = ∫ − ∞ ∞ f ( t ) e − 2 π i ν t d t = ∫ − ∞ ∞ f ( t ) ( cos ⁡ ( 2 π ν t ) − i sin ⁡ ( 2 π ν t ) ) d t Euler's Formula = ( ∫ − ∞ ∞ f ( t ) cos ⁡ ( 2 π ν t ) d t ) − i ( ∫ − ∞ ∞ f ( t ) sin ⁡ ( 2 π ν t ) d t ) = f ^ c ( ν ) − i f ^ s ( ν )

References

Sine and cosine transforms Wikipedia
(Text) CC BY-SA