UNIT – IV FOURIER TRANSFORMS

INTRODUCTION

The development of mathematical representation of periodic phenomena using

complex numbers leads to complex form of the Fourier series representation of periodic
function. The representation of periodic signals as a linear combination of harmonically
related complex exponentials can be extended to develop a representation of aperiodic signals
as linear combination of complex exponentials. This leads to Fourier Transforms.

Fourier Transform is widely used in the theory of communication engineering, wave

propagation and other branches of applied mathematics.

FOURIER INTEGRAL THEOREM (AU 2005,2008,2009,2010,2011)

If f(x) is piecewise continuous, has piecewise continuous derivatives in every finite

interval in (-,) and absolutely integrable in (-,) , then
f(x) = 1   𝑓(𝑡) 𝑒𝑖𝑠(𝑥−𝑡) 𝑑𝑡 𝑑𝑠 -------(i)
2
∫−  ∫−  


R.H.S is called the Fourier Complex integral or Fourier Complex integral representation of
f(x). OR f(x) = 1   𝑓(𝑡) 𝑐𝑜𝑠{𝑠(𝑥 − 𝑡)} 𝑑𝑡 𝑑𝑠 ---(ii)
∫ ∫
 0 − 


R.H.S is called the Fourier integral or Fourier integral representation of f(x)

𝑎
RESULTS:1. ∫𝑎 𝑓(𝑥)𝑑𝑥 = 2 ∫ 𝑓(𝑥)𝑑𝑥 if f(-x)=f(x) that is f(x) is an even function
−𝑎 0

= 0 if f(-x)=-f(x) that is f(x) is an odd function

2. 𝑒𝑖 = 𝑐𝑜𝑠 + 𝑖𝑠𝑖𝑛 , 𝑒−∞ = 0 , 𝑒0 = 1, 𝑒 ∞ = ∞ & Cos (a-b)=cos a cos b+sin a

sin b and so on

3.∫ 𝑢𝑑𝑣 = 𝑢𝑣 − 𝑢′𝑣1 + 𝑢′′𝑣2 − 𝑢′′′𝑣3 +….Bernoulli’s theorem where u &v are
function of x.

(2𝑛−1)
4. sin 0 = 0 , cos 0 =1 , cos n=(−1)𝑛where n=0,1,2,3 ,… sin n =0 , cos 
2
(2𝑛−1)
=0 for all n & sin = (−1)(𝑛+1)for n=1,2,3,…
2
 𝑒 𝑎𝑥 𝑎
5.∫𝑒𝑎𝑥𝑐𝑜𝑠𝑏𝑥𝑑𝑥 = {𝑎𝑐𝑜𝑠𝑏𝑥 + 𝑏𝑠𝑖𝑛𝑏𝑥} also ∫0 𝑒 𝑐𝑜𝑠𝑏𝑥𝑑𝑥 =
∞ −𝑎𝑥
𝑎2+𝑏2 𝑎 2+𝑏 2

𝑒−𝑎𝑥
∫ 𝑒 𝑠𝑖𝑛𝑏𝑥𝑑𝑥 =
−𝑎𝑥
{−𝑎𝑠𝑖𝑛𝑏𝑥 − 𝑏𝑐𝑜𝑠𝑏𝑥} also
𝑎2+𝑏2
∞ 𝑏
∫0 𝑒 𝑠𝑖𝑛𝑏𝑥𝑑𝑥 =
−𝑎𝑥
𝑎 2+𝑏 2

NOTE :

f(x) = 1  𝑓(𝑡) 𝑐𝑜𝑠{𝑠(𝑥 − 𝑡)} 𝑑𝑡 𝑑𝑠

∫ ∫
 0 −

= 1 𝑓(𝑡){𝑐𝑜𝑠 𝑠𝑥 𝑐𝑜𝑠 𝑠𝑡 + 𝑠𝑖𝑛 𝑠𝑥 𝑠𝑖𝑛 𝑠𝑡 } 𝑑𝑡 𝑑𝑠
∫ ∫
 0 −
1   1   
= ∫ 𝑐𝑜𝑠 𝑠𝑥(∫ 𝑓(𝑡)𝑐𝑜𝑠 𝑠 𝑑𝑡 )𝑑𝑠 += ∫ 𝑠𝑖𝑛 𝑠𝑥(∫  𝑓(𝑡)𝑠𝑖𝑛 𝑠𝑡 𝑑𝑡) 𝑑𝑠
− −
 

 0  0

NOTE :

1. If f(x) (or f(t)) is even, then f(t) cos st is an even function of t and f(t) sin st is an odd
function of t.

f(x) = 2  𝑓(𝑡)𝑐𝑜𝑠 𝑠𝑥 𝑐𝑜𝑠 𝑠𝑡 𝑑𝑡 𝑑𝑠 R.H.S is called the Fourier Cosine integral of

∫ ∫
 0 0
f(x)

2. If f(x) (or f(t)) is odd, then f(t) cos st is an odd function of t and f(t) sin st is an even
function of t.

f(x) = 2  𝑓(𝑡)𝑠𝑖𝑛 𝑠𝑥 𝑠𝑖𝑛 𝑠𝑡 𝑑𝑡 𝑑𝑠 R.H.S is called the Fourier sine integral of f(x)
∫ ∫
 0 0

Problems:

1. Show that f(x)=1 , 0<x< can not be represented by a Fourier integral.

  
Sol: ∫ |𝑓(𝑥)|𝑑𝑥 = ∫ 1𝑑𝑥 =( X) 0=  and this value tends to  as x  . that is ∫ 𝑓(𝑥)𝑑𝑥
0 0 0

is not convergent. Hence f(x)=1 can not be represented by a Fourier integral.

2
2  ( +2)𝑐𝑜𝑠𝑥
2. Using Fourier integral formula, prove that 𝑒−𝑥𝑐𝑜𝑠𝑥 =  ∫0 𝑑
4+4


Sol: Since the right hand side integrand contains Cosine term, We shall use cosine integral
formula.
 2  
f(x) = ∫ 𝑐𝑜𝑠𝑥(∫ 𝑓(𝑡)𝑐𝑜𝑠𝑡𝑑𝑡) 𝑑 Here f(t)= 𝑒−𝑡𝑐𝑜𝑠𝑡
 0 0

 
= 2 ∫ 𝑐𝑜𝑠𝑥(∫ 𝑒−𝑡𝑐𝑜𝑠𝑡𝑐𝑜𝑠𝑡𝑑𝑡)d
 0 0

2   1
= ∫ 𝑐𝑜𝑠𝑥(∫ 𝑒−𝑡 { ⌈𝑐𝑜𝑠(1 + )𝑡 + 𝑐𝑜𝑠(1 − )𝑡⌉} 𝑑𝑡)d

 

0 0 2

1  𝑒 −𝑡 
= ∫ (𝑐𝑜𝑠𝑥 { [−𝑐𝑜𝑠(1 + )𝑡 + (1 + )𝑠𝑖𝑛(1 + )𝑡]} +
 0 1+(1+)2 0
𝑒 −𝑡 
{1+(1−)2 [−𝑐𝑜𝑠(1 − )𝑡 + (1 − )𝑠𝑖𝑛(1 − )𝑡]} ) d
0

1
1 ∫(𝑐𝑜𝑠𝑥 {0 − 1 (−1)}+{0 − (−1)}) d
=
 0 1+(1+)2 1+(1−)2

1  1+(1−)2+1+(1+)2 
= 𝑐𝑜𝑠𝑥 {(1+(1−)2)(1+(1+)2)}d
 ∫0
1  2−𝟐 +2+2+𝟐 +2
=
 ∫0
𝑐𝑜𝑠𝑥 { 2 }d
( −2+2)(2 +2+2)

1 
= ∫ 𝑐𝑜𝑠𝑥 { 22+4
2 }d
 0 ( +2) −4
2 2

1  2(2+2)
=
 ∫0
𝑐𝑜𝑠𝑥 {4 }d
+42−42 +4

2 
∫ 𝑐𝑜𝑠𝑥 {(4+2)}d
2
f(x) =
 0  +4

3. Using the Fourier integral representation, show that

 𝑤𝑠𝑖𝑛𝑥𝑤  −𝑥  𝑐𝑜𝑠𝑥𝑤   𝑠𝑖𝑛𝑤 𝑐𝑜𝑠𝑥𝑤
(i)∫ dw = 𝑒 ,x>0 (ii)∫ dw = 𝑒−𝑥 ,x>0 (ii)∫ dw
0 1+𝑤2 2 0 1+𝑤2 2 0 𝑤

= , 0x<1
2

2 ∞ ∞
Sol: (i). Fourier sine integral for f(x) is f(x)= ∫0

𝑠𝑖𝑛𝑤𝑥{∫0 𝑓(𝑡)𝑠𝑖𝑛𝑤𝑡𝑑𝑡} d𝑤 Here
f(t)=e-t
2 ∞ ∞
f(x) = ∫ 𝑠𝑖𝑛𝑤𝑥{∫ 𝑒−𝑡𝑠𝑖𝑛𝑤𝑡𝑑𝑡} d𝑤
 0 0
 ∞
2 ∞ 𝑒 −𝑡
𝑠𝑖𝑛𝑤𝑥 {1+𝑤2 [−𝑠𝑖𝑛𝑤𝑡 − 𝑤𝑐𝑜𝑠𝑤𝑡]} d𝑤
 ∫0
=
0
2 ∞ 𝑤
= ∫ 𝑠𝑖𝑛𝑤𝑥 d𝑤
 0 1+𝑤2

𝜋 −𝑥
∞ 𝑤𝑠𝑖𝑛𝑤𝑥  𝑒 , 𝑥>0
∫ d𝑤 =  f(x) =𝑓(𝑥) = {2 where f(x)= 𝑒−𝑥, 𝑥>0
0 1+𝑤2 2

2 ∞ ∞
(ii).Fourier Cosine integral for f(x) is f(x)= ∫ 𝑐𝑜𝑠𝑤𝑥{∫ 𝑓(𝑡)𝑐𝑜𝑠𝑤𝑡𝑑𝑡} d𝑤 Here f(t)=e-t
 0 0

2 ∞ ∞
f(x) = ∫ 𝑐𝑜𝑠𝑤𝑥{∫ 𝑓(𝑡)𝑐𝑜𝑠𝑤𝑡𝑑𝑡} d𝑤
 0 0
2 ∞ ∞
= ∫ 𝑐𝑜𝑠𝑤𝑥{∫ 𝑒−𝑡𝑐𝑜𝑠𝑤𝑡𝑑𝑡} d𝑤
 0 0
∞
2 ∞ 𝑒 −𝑡
= ∫0 𝑐𝑜𝑠𝑤𝑥 { (−𝑐𝑜𝑠𝑤𝑡 + 𝑤𝑠𝑖𝑛𝑤𝑡)} 𝑑𝑤
𝜋 1+𝑤2 0
2 ∞ 1
= ∫ 𝑐𝑜𝑠𝑤𝑥 𝑑𝑤
𝜋0 1+𝑤2

∞ 1 𝜋 𝜋
∫ 𝑐𝑜𝑠𝑤𝑥 𝑑𝑤 = 𝑓(𝑥) = 𝑒 −𝑥 , x≥ 0
0 1+𝑤 2 2 2

(iii). Fourier integral formula for f(x) is

1 ∞ ∞
f(x) = 𝑓(𝑡)𝑐𝑜𝑠𝑤(𝑡 − 𝑥) 𝑑𝑡𝑑𝑤 where f(x)=1 for 0<x<1
∫
𝜋 0 ∫−∞
1 ∞ 0 1 ∞
= ∫ {∫ 0 + ∫ 1𝑐𝑜𝑠𝑤(𝑡 − 𝑥) 𝑑𝑡 + ∫ 0}dw
𝜋 0 −∞ 0 1

1
1 ∞ 𝑠𝑖𝑛𝑤(𝑡−𝑥)
= ∫ { } dw
𝜋 0 𝑤 0

1 ∞
= ∫ [𝑠𝑖𝑛𝑤(1−𝑥) − 𝑠𝑖𝑛𝑤(−𝑥) ] 𝑑𝑤
0
𝜋 𝑤 𝑤

1 ∞
= ∫ [𝑠𝑖𝑛𝑤(1−𝑥)+𝑠𝑖𝑛𝑤𝑥 ] 𝑑𝑤
0
𝜋 𝑤
 𝑤 (𝑤−2𝑤𝑥)
1 ∞ 2𝑠𝑖𝑛 2 𝑐𝑜𝑠 2 𝑑𝑤
= ∫0
𝜋 𝑤

𝑤 (𝑤−2𝑤𝑥)
∞ 𝑠𝑖𝑛 2 𝑐𝑜𝑠 2
𝑑𝑤 𝜋
∫0 𝑤
= 𝑓(𝑥)
2

FOURIER TRANSFORMS

DEFINITION

1 ∞
F[𝑓(𝑥)] = ∫−∞ 𝑓(𝑥)𝑒𝑖𝑠𝑥𝑑𝑥 is called the Fourier transform of f(x) and F is
√2𝜋

the Fourier transform operator, where s is used as the transform variable. Also it is denoted as
F(s)

NOTE: Sometimes the letter p or w is used as the transform variable and it is obtained from
Fourier complex integral representation of f(x)

DEFINITION (AU 2001, 2007, 2010, 2011)

1 ∞
The f(x)=𝐹−1[𝐹(𝑠)] = ∫−∞ 𝐹(𝑠)𝑒−𝑖𝑠𝑥𝑑𝑠 is called the inverse Fourier transform of F(s).
√2𝜋

NOTE: F[𝑓(𝑥)] & 𝑓(𝑥) = 𝐹−1[𝐹(𝑠)] together is called as Fourier transform pair.

1 ∞ 1 ∞
OR IF F[𝑓(𝑥)] = ∫−∞ 𝑓(𝑥)𝑒𝑖𝑠𝑥𝑑𝑥 THEN f(x)=𝐹−1[𝐹(𝑠)] = ∫−∞ 𝐹(𝑠)𝑒−𝑖𝑠𝑥𝑑𝑠
√2𝜋 √2𝜋

DEFINITION
2 ∞
Fc[𝑓(𝑥)] = √ ∫ 𝑓(𝑥)𝑐𝑜𝑠 𝑠𝑥 𝑑𝑥 is called as the Fourier cosine transform of f(x) and it is
𝜋0

also denoted as 𝐹𝑐(𝑠)

2 ∞
f(x) = 𝐹−1[𝐹 (𝑓(𝑥)]=√ ∫ 𝐹 (𝑓(𝑥)𝑐𝑜𝑠 𝑠𝑥 𝑑𝑠 is called as the Inverse Fourier cosine
𝑐 𝑐 𝜋 0 𝑐

transform of f(x)

NOTE: Fc[𝑓(𝑥)] & 𝑓(𝑥) = 𝐹−1[Fc[𝑓(𝑥)]] together is called as Fourier Cosine

transform pair. Obtained from Fourier Cosine integral representation of f(x).
 ∞
OR IF Fc[𝑓(𝑥)] = ∫0 𝑓(𝑥)𝑐𝑜𝑠 𝑠𝑥 𝑑𝑥 THEN f(x) =
2 ∞
𝐹−1[𝐹 (𝑓(𝑥)]= ∫ 𝐹 (𝑓(𝑥)𝑐𝑜𝑠 𝑠𝑥 𝑑𝑠
𝑐 𝑐 𝜋 0 𝑐

DEFINITION
2 ∞
Fs[𝑓(𝑥)] = √ ∫ 𝑓(𝑥)𝑠𝑖𝑛 𝑠𝑥 𝑑𝑥 is called as the Fourier sine transform of f(x) and it is
𝜋0

also denoted as 𝐹𝑠(𝑠)

2 ∞
f(x) = 𝐹−1[𝐹 (𝑓(𝑥)]=√ ∫ 𝐹 (𝑓(𝑥))𝑠𝑖𝑛 𝑠𝑥 𝑑𝑠 is called as the Inverse Fourier sine
𝑠 𝑠 𝜋 0 𝑠

transform of f(x)

NOTE: Fs[𝑓(𝑥)] & 𝑓(𝑥) = 𝐹−1[Fs[𝑓(𝑥)] ] Together is called as Fourier sine transform
pair. Obtained from Fourier sine integral representation of f(x). OR IF Fs[𝑓(𝑥)] =
∞ 2 ∞
∫ 𝑓(𝑥)𝑠𝑖𝑛 𝑠𝑥 𝑑𝑥 THEN f(x) = 𝐹−1[𝐹 (𝑓(𝑥)]= ∫ 𝐹 (𝑓(𝑥)𝑠𝑖𝑛 𝑠𝑥 𝑑𝑠
0 𝑠 𝑠 𝜋 0 𝑐

PROPERTIES OF FOURIER TRANSFORMS

1. LINEARITY PROPERTY: F is a linear operator.

𝐹[(𝑐1𝑓1(𝑥) + 𝑐2𝑓2(𝑥))] = 𝑐1𝐹[(𝑓1(𝑥))]+𝑐2𝐹[(𝑓2(𝑥))] , where 𝑐1 and 𝑐2are

constants.
∞
Proof:𝐹[(𝑐 𝑓 (𝑥) + 𝑐 𝑓 (𝑥))] =∫ (𝑐 𝑓 (𝑥) + 𝑐 𝑓 (𝑥))𝑒𝑖𝑠𝑥𝑑𝑥
1 1 22 −∞ 1 1 22

=𝑐 ∫∞ (𝑓 (𝑥))𝑒𝑖𝑠𝑥𝑑𝑥+𝑐 ∫ ∞ (𝑓 (𝑥))𝑒𝑖𝑠𝑥𝑑𝑥
1 −∞ 1 2 −∞ 2

= 𝑐1𝐹[(𝑓1(𝑥))]+𝑐2𝐹[(𝑓2(𝑥))]

1 𝑠
2. CHANGE OF SCALE PROPERTY: If F[𝑓(𝑥)] = F[𝑠], then F[𝑓(𝑎𝑥)] = F [ ]
|𝑎| 𝑎

(AU 2006,2009, 2010,2011 )

∞
F[𝑓(𝑎𝑥)] =∫
−∞
𝑓(𝑎𝑥) 𝑒𝑖𝑠𝑥𝑑𝑥 put ax=tand assuming that a>0
 𝑡
∞ 𝑖𝑠 𝑑𝑡 1 𝑠
F[𝑓(𝑎𝑥)] =∫ 𝑓(𝑡) 𝑒 𝑎 = F[ ]
−∞ 𝑎 𝑎 𝑎
𝑡
−∞ 𝑖𝑠 𝑑𝑡 1 𝑠
But F[𝑓(𝑎𝑥)] =∫ 𝑓(𝑡) 𝑒 𝑎 = − F[ ], if a<0
∞ 𝑎 𝑎 𝑎

1 𝑠
Therefore F[𝑓(𝑎𝑥)] = F[ ]
|𝑎| 𝑎

3. Shifting property (AU 1999,2000,2001,2006,2007,2008,20102011,2012)

i. F[𝑓(𝑥 − 𝑎)] = 𝑒𝑖𝑎𝑠 F[𝑠] ii. F[𝑒𝑖𝑎𝑥𝑓(𝑥)] = F[𝑠 + 𝑎]

Proof: we know that

F =

Put t = x-a , x→ implise t →

dt =dx, x→ implise t →

= F

F = F Hence proved (i)

ii. We know that

 F

F =

F = F (s+a)

Hence proved (ii).

4. MODULATION THEOREM: If F =F , then F

= (AU 2001, 2003, 2010)

Proof: F = dx

= dx

F =

5. TRANSFORM OF DERIVATIVES: If f(x) is continuous, f’(x) is piecewise

continuously differentiable(x) and f’(x) are absolutely integrble in (- and limit x tends

to - and of f(x) =0 , then

Proof: By the first three conditions given, and exist.

= is , on integration by parts.
 = 0 + is , by the given condition

NOTE: = where =

6. If = then

(i). =

(ii). F = if f, f’, f’’, ….fn-10 as x+ or - 

(iii) =

Proof:

(i) =

= by Leibnitz’s rule for constants limits

= since therefore

(ii) =
 =

= is , on integration by parts.

= 0 – is

= -is F(s) similarly F =

(iii) = since =

= since F =

CONVOLUTION: (AU 2000, 2003, 2008 ) The convolution of two functions f(x) and g(x)

over the interval (- is defined as f

Convolution Theorem for Fourier Transforms: (or Faltung theorem): The Fourier
Transform of the convolution of f(x) and g(x) is the product of their Fourier Transforms

. =F .G

Proof:

=F

= dx

= du (By changing the order of

integration where both variables x and u limits are constants)

Put x-u=t, dx=dt,t tends to - to

 = du

= du

= F du Treating u and t as dummy variable

F F that is = F(s).G(s)

NOTE: (i) =

CONJUGATE SYMMETRY PROPERTY: If F = F , then =

Proof: F = =

= Putting –x=t , dx=-dt and t varies from to -

= by definite integral property

= treating t as the dummy variable

PARSEVAL’S IDENTITY THEOREM: If F = F , then

(AU 2002,2007,2008,2010, 2011 Statement)

Proof: By convolution theorem we know that = F(s).G(s)

That is =

Put x=0, we get =

Now taking = then = also =

F = implies that G(s)=

Hence

PROPERTIES OF FOURIER SINE AND COSINE TRANSFORMS

1. CHANGE OF SCALE PROPERTY :

= and =

2. MODULATION THEOREM: If = , and = then

(i) =

(i) =

(i) =

(i) =

3. PARSEVAL’S IDENTITY FOR FOURIER SINE AND COSINE TRANSFORMS:

If = , and = then

(i) =

(ii) =

4. DERIVATIVES FOR FOURIER SINE AND COSINE TRANSFORM:

(i) = s - f(0)
 (ii) =- - f’(0)

(iii) =- s

(iv) =- +sf(0)

NOTE: = s and = -s where f(x)0 as x


5. If = , and = then (i) = -

(ii) =

Proof: (i) Fc

= By Leibnit’s rule for constants limits

= -

(ii) Fs

= By Leibnit’s rule for constants limits

PROBLEMS
1.Find the Fourier transform of the unit step function and unit impulse function.

SOL:The unit step function is defined as

F since

NOTE: F = & F = =

The unit impulse function or Dirac Delta function where

F =

F =

F =

F = & F =
2. Find the Fourier transform of f(x) if Where a is a positive real

number, hence deduce that (i) (ii) dt= (AU 2003, 2004, 2005)

SOL: =

= =

By Fourier inversion Formula f(x)=

f(x)= (

1=

= =

By Parseval’s identity theorem

 ds

2a = ds

= =

3. Find the Fourier transform of f(x) given by

Hence evaluate (i) show that (ii)

( AU 2000, 2001,2004,2005,2006,2007,2010,2011)

Sol: F

F = =F(s)
By inversion formula f(x)= =

f(x)= =

f(x)= (since is an

even function therefore is an even function and

is an odd function )

---(i) put x=1/2 in (i) so and

= =

Sol:(ii)By Parseval’s identity theorem

2 =

= =

Therefore = =
4. Find the Fourier transform of f(x) given by

Hence evaluate (i) = /2 (ii) = /3

(AU 2001,2005,2006,2007,2008,2009,2010,2011,2012)

Sol: F

F = =

By using inverse Fourier transform f(x)= =

f(x)= =

f(x)= (since is an even function

therefore is an even function and is an odd function )

By Parseval’s identity theorem

2 =

= =

Therefore
5. Find the Fourier transform of f(x) given by

Show that (i) (ii) dt= (iii)

(AU 1996,2001,2004,2008,2009,2010,2011, 2012)

Sol: F

F = =F(s)

By inversion formula f(x)= =

f(x)= =

f(x)= (since

is an even function therefore is an even function and

is an odd function )
 =

By Parseval’s identity theorem

2 =

= =

= =
6. Find the Fourier transform of f(x) given by

Hence evaluate (i) (ii) (AU 1996,2008,2011)

Sol: F

F = =

By using inverse Fourier transform f(x)= =

f(x)= =

f(x)= (since is an even function

therefore is an even function and is an odd function

)
By Parseval’s identity theorem

2 =

= =

Therefore
7. Find the Fourier transform of . Hence (i) Prove that is self reciprocal with

respect to Fourier transforms and (ii) Find the Fourier cosine transform of (AU 2007
2009

Sol: F

F =
 =

F = ( )

F = ( is self reciprocal with respect to Fourier transforms )

(ii) From (i) we have

Equating the real parts on

bothsides , we get

2  =

8. Find the Fourier cosine transform of

Sol: Fc where f(x) =

 =

Fc =

9. Find the Fourier sine transform of f(x) = , a>0 hence deduce that

= f(x) = (AU 2007,2009, 20102012)

Sol: Fs where f(x) =

= dx

Fs =

Fs =

By inversion formula for sine transform f(x) = =

f(x) =

f(x) =

= f(x) = ,
 == By replacing s=x, x=m & a=1

10. Find the Fourier sine transform of f(x) = (AU 2008,2009)

Sol: Fs where f(x) = =

Fs

11.Find and (AU 2011)

Sol: we know that (i) =- & (ii) =

Also Fs = and Fc =

= =
 =

12. Find the Fourier Sine transform of

Sol: Fc

Fc (say)

= dx ( By Leibnit’s rule for constants limits)

= dx

=
 =

when s=0,

(put x)

c=1

Fc

= that is

13. Find the Fourier cosine transform of (AU 2006,2008,2010,2011)

Sol: Fc

Fc
 =

14. Find the Fourier sine transform of . Hence show that dx

,a>0
Sol: Fs

Fs

Fs

Fs =

By inversion formula f(x) = =

f(x) =

( Replacing x=a & s=x then we get)

15. Find the Fourier sine transform of and deduce that

(AU 2005,2007,2009)

Sol: Fs
 Fs (say)

= dx ( By Leibnit’s rule for constants limits)

= dx

= dx

= Integrating bothsides with respect to s we get

a +c

To show that

We know that Fs

Fs = 


Integrating with respect to ‘a’ on bothsides we get
 Fs similarly Fs

Fs

16. Find the Fourier sine and cosine transform of and prove that is self reciprocal

under Fourier sine and cosine transforms.

Sol: Replacing x by ax and changing the limits,

 = , n>0 Putting a=is then

= , n>0

= , n>0

= , n>0
 =

= (c )

Equating the real and imaginary parts on both sides,

= (c )

= ( )

cos and sin

Taking we get cos

 = since

Similarly substitution gives sin

 =

and  that is self reciprocal under Fourier sine and

cosine transforms.

17. Evaluate (i) (ii) (iii)

Using convolution theorem. (AU 2001,2005,2006,2009,2010,2011),

 Sol: Let and g then and

By convolution theorem

By convolution theorem If = , and = then

(i) =

(ii) =

Sol (i)

 



where a>0 and b>0.

Sol(ii)

2 dx =
Sol(iii)

2 dx =
18. Find the function whose sine transform is , a>0 (AU 2010,2011)

Sol: The inverse Fourier sine transform of is

f(x) = =

…(i) differentiating bothsides with respect to x we get

= Integrating bothsides with respect to x we get

+c …(ii) putting x=0 in (i) gives f(0)=0 and (ii)c=0

19. Find the Fourier cosine transform of . Deduce

and

Sol:
 =

= By the inverse Fourier cosine transform

f(x) = =

f(x) = =

Interchanging x as s implies that

…..(i) putting s=2 in (i) we get

Differentiating (i) with respect to s we get

 putting s=2 we get

20. Find the Fourier sine transform of and Fourier cosine transform of

Sol: F
 Fc (say) …..(i)

= dx ( By Leibnit’s rule for constants limits)

= dx …….(ii)

= dx

= dx

= dx dx

= dx dx

Differentiating

again with respect to s

 that is

 and
 Put s=0,  …(i) and …(ii) since

s=0 gives




 

Solving (i) and (ii) & we get

Fc

F ) = dx

F =- F =

21. Find the Fourier sine transform of f(x) =

Sol: Fs

Fs
 =

Fs =  Fs =

22. Find the Fourier cosine transform of f(x) =

Sol: Fc

Fc
 =

Fc =

23. Solve the integral equation =

Hence evaluate

Sol: =

Fc = ................................................................ (i)

By the inverse Fourier cosine transform

f(x) = =

f(x) =

f(x) =
 Fc =

Fc = …..(ii)

From (i) and (ii) =

Now putting

dx =

(put x)

= =

24. Solve the integral equation = Also show that

Sol: Given =

Fc = ........................... (i)

By the inverse Fourier cosine transform

f(x) = =

f(x) =

f(x) =

25. Solve the integral equation =

Sol:Given =

Fs = ……(i)

By the inverse Fourier sine transform f(x) = =

 =

Shifting property

iii. F = F ii. F = F
Proof: we know that

F =

Put t = x-a , x→ implise t →

dt =dx, x→ implise t →

= F

F = F Hence proved (i)

iv. We know that

 F

F =

F = F (s+a)

Hence proved (ii).