Poularikas A. D.

Sine and Cosine Transforms

The Handbook of Formulas and Tables for Signal Processing.
Ed. Alexander D. Poularikas
Boca Raton: CRC Press LLC, 1999

1999 by CRC Press LLC

13

Sine and Cosine

Transforms

13.1 Fourier Cosine Transform (FCT)

13.2 Fourier Sine Transform (FST)

13.3 Discrete Cosine Transform (DCT)

13.4 Discrete Sine Transform (DST)

13.5 Properties of DCT and DST

13.6 FCT and FST Algorithm Based on FFT

13.7 Fourier Cosine Transform Pairs

13.8 Fourier Sine Transform Pairs

13.9 Notations and Denitions

References

13.1 Fourier Cosine Transform (FCT)

13.1.1 Denitions of FCT

The sufcient conditions for the inversion formula are that

f

(

t

) be absolutely integrable in [0,

) and
that

f

(

t

) be piece-wise continuous in each bounded subinterval of [0,

). At the point

t

o

where

f

(

t

) has a
jump discontinuity

13.1.2 Properties of the FCT

13.1.2.1 Transform of Derivatives

If

f

(

t

) and

f

(

t

) have a jump discontinuity at

t

o

of

d

and

d

, respectively,

F
F
c c
c c c
f t F f t t dt
F f t F t dt t
{ ( )} ( ) ( )cos
{ ( )} ( ) ( )cos

0
1
0
0
2
0
f t f t f t
o o
( ) [ ( ) ( )]/ . + + 0 0 2

F
c c
f t f t t dt F f { ( )} ( )cos ( ) ( )

0
2
0
f t f t t ( ) ( ) and vanish as and are continuous in [0, ).

1999 by CRC Press LLC

13.1.2.2 Scaling
13.1.2.3 Shifting in t-domain

If and

f

(

t

) is piece-wise continuous and absolutely integrable [0,

), then

13.1.2.4 Shifting in the



-domain

13.1.2.4.1 Differentiation in the

-Domain

13.1.2.5 Asymptotic Behavior
13.1.2.6 Integration in the t-Domain
13.1.2.7 Convolution

For then

F
c c o o
o o o o
f t F f d t d t
d f t f t d f t f t
{ ( )} ( ) ( ) sin cos
( ) ( ), ( ) ( )

+ +

2
0
0 0 0 0

F
c c
f at
a
F
a
a { ( )}

_
,
>
1
0

f t f t
e
( ) ( )

F
F
c e e c
c c
f t a f t a F a a
f t a f t a F a
{ ( ) ( )} ( )cos
{ ( ) ( )} ( )cos
+ + >
+ +
2 0
2



F f t t f t t
F f t t f t t
f t t F F
f at
c c s
s
c c s
c c c
c
( ) { ( )cos } { ( )sin }
.
( ) { ( )cos } { ( )sin }
{ ( )cos } ( ) ( )
{ (

+ >
>
+ >
+ +
[ ]
F F
F
F F
F
F
0
0
0
1
2
where means the sine transform.
))cos } ,

t
a
F
a
F
a
a
c c

_
,
+

_
,

1
]
1
>
1
2
0

F t f t
c
n
c
n n ( )
( ) {( ) ( )}
2 2
1 F
lim ( )

F
c
0

F
c
t
s s
f d F F ( ) ( ), ( )

'

1
sine transform
f t f t g t g t
e e
( ) ( ) ( ) ( ) and
f t g t f g t g t d
e e
( ) ( ) ( )[ ( ) ( )] + +

0

F
c c c
f g t g t d F G ( )[ ( ) ( )] ( ) ( ) + +

'

0
2

1999 by CRC Press LLC

13.1.3 Examples of FCT

Pulse Function
Lambda Function
Inverse Function
Exponential Function
Decaying Cosine

by setting

13.2 Fourier Sine Transform (FST)

13.2.1 Denition FST

F
c a a
a
p t p t a t dt t dt
a
{ ( )} ( )cos cos
sin

1
2
0 0
2

f t
t a
a t a
t a
a t a
t a
f t
t
a
t dt
a t
a
t dt
a
a a
c
a a
( )
/
( ) /
,
,
,
{ ( )} cos cos ( cos cos )

'

< <
< <
>
+



2
0
0
2
2
2 1
2 2 1
0 0
2
2
F

f t
t
t a
f t
t
t dt d Ci a
Ci y d
c
a a
y
( )
{ ( )} cos cos ( )
( ) cos
>

1
1 1
1
F

cosine integral function

f t e a t
f t e t dt
a
a
at
c
at
( ) ,
{ ( )} cos
>

+

0 0
0
2 2
F

f t e at a b t
f t e at t dt
b
b a b a
bt
c
bt
( ) cos , , ,
{ ( )} cos cos
( ) ( )
>

+
+
+ +

1
]
1

0 0
2
1 1
0
2 2 2 2
F

cos cos . at
e e
t
e e
jat jat j t j t

+

2 2
and


F f t f t t dt
f t F F t d t
s s
s s s
( ) { ( )} ( )sin
( ) { ( )} ( )sin

>

F
F
0
1
0
0
2
0
-

1999 by CRC Press LLC

13.2.2 Properties of FST

13.2.2.1 Transforms of Derivatives
13.2.2.2 Scaling
13.2.2.3 Shifting in t-Domain
13.2.2.4 Shifting in



-Domain
13.2.2.5 Differentiation in the



-Domain
13.2.2.6 Asymptotic Behavior
13.2.2.7 Integration in the t-Domain
F
F
s s
s c
f t F f
f t F
{ ( )} ( ) ( )
{ ( )} ( )
+



2
0
F
s s
f at
a
F a a { ( )} ( / ) >
1
0

f t f t f t
t
t
f t
f t a f t a F a
f t a f t a F a a
e
s s
c s
( ) ( ) ( ) ( )
{ ( ) ( )} ( )cos
{ ( ) ( )} ( )sin

+ +
+ >
0
0 0
0 0
2
2 0
F
F



F f t t f t t
f t t F F
f at t
a
F
a
F
a
f at
s s c
s s s
s s s
s
( ) { ( )cos } { ( )sin }
{ ( )cos } ( ) ( )
{ ( )cos }
{ ( )sin

+ +
+ +
[ ]

_
,
+

_
,

1
]
1
F F
F
F
F
1
2
1
2

t
a
F
a
F
a
c c
}
+

_
,

_
,

1
]
1
1
2

F t f t
F t f t
s
n
s
n n
s
n
c
n n
( )
( )
( ) {( ) ( )}
( ) {( ) ( )}
2 2
2 1 2 1
1
1

+ +
F
F
lim ( )

F
s
0

F
s
o
t
c
f d F ( ) ( )

'

1

1999 by CRC Press LLC

13.2.2.8 Integration in the



-Domain
13.2.2.9 The Convolution Property

13.2.3 Examples of FST

Pulse Function
Lambda Function
Inverse Function
Exponential Function

by setting

F
c s
F d
t
f t
1
1
( ) ( )

'

2
0
F G f g t g t d
s c s
( ) ( ) ( )[ ( ) ( )] = F +

'

F
s a
a
p t
a
t dt
a
a
/
sin
cos
2
0 2
1
0

_
,

'

>

f t
t a
a t a
t a
a t a
f t
t
a
t dt
a t
a
t dt
a
a a
s
a
a
a
( )
/
( ) /
,
,
,
{ ( )} sin sin ( sin sin )

'

< <
< <
+



2
0
0
2
2 1
2 2
0
2
2
otherwise
F

f t
t
t a
f t
t
t dt d si a
si y
x
x
dx
x
x
dx
x
x
dx Si y
s
a a
y
y
( )
{ ( )} sin sin ( )
( )
sin sin sin
( )
>






1
1 1
2 0 0
F

f t e a t
f t e t dt
a
at
s
at
( ) ,
{ ( )} sin
>

+

0 0
0
2 2
F

sin ( ) /

t e e j
j t j t


2

1999 by CRC Press LLC

Decaying Cosine

by setting

13.3 Discrete Cosine Transform (DCT)

13.3.1 Transform Kernel

If we set

13.3.2 Discrete Cosine Transform (DCT)

If a nite duration signal is divided into

N

intervals of

t

each, there exists

N

+ 1 sample points. If these

N

+ 1 points are represented by vector the DCT is
where
f t e at a b t
f t e at t dt
a
b a
a
b a
bt
s
bt
( ) cos , , ,
{ ( )} cos sin
( ) ( )
>


+
+
+
+ +

1
]
1

0 0
1
2 0
2 2 2 2
F

cos ( ) / sin ( ) / . at e e t e e j
jat jat j t j t
+

2 2 and

K t t
K m n K t mn f t
m f
t
f t
m n
c
c c m n
m
n
( , ) cos
( , ) ( , ) cos( )
,
,

2
2

sampled angular frequency
sampled time
sample intervals of frequency and time
positive integers
f t N
K m n mn N
c

1 2 /
( , ) cos( / )
x, X
c
X C x C N N
c
+ + [ ] , [ ] ( ) ( ) 1 1 matrix

[ ] [ ] / cos , , , ,
,
( ) / cos ( )
( ) /
C C N k k
mn
N
m n N
k i N k i N
X m X N k k
mn
N
x n
x n x N k
mn m n
i i
c c
n
N
m n
m
N

1
]
1

_
,

matrix element of
for or for or
element of
element of
2 0 1
1 0
1
2
0
2
2
0
0

L
mm n c
k
mn
N
X m cos ( )

_
,

1999 by CRC Press LLC

13.4 Discrete Sine Transform (DST)

13.4.1 Discrete Sine Transform (DST)

13.5 Properties of DCT and DST

13.5.1 The Unitary Property

If denotes the m

th

column vector of matrix [

C

] then
or
The same applies for matrix [

S

].

13.5.2 Inverse Transformation

These are

unitary

symmetric matrices.

13.5.3 Scaling

A change of

t

to

a

t

changes

f

to

f/a

, provided N remains the same. If we set

T

=

N

t

, the time
duration of the data, then

f

= 1/2

T

.

[ ] [ ] / sin , , , ,
[ ] , [ ] ( ) ( )
,
( ) / sin ( )
S S N
mn
N
m n N
X S x S N N
x N X N
X m X N
mn
N
x n
mn
s
s
s s
n
N

_
,

_
,

matrix element of
matrix (boundary points are zero)
data vector DST vector
element of
2 1 2 1
1 1
1 1
2
1
1

L
X m x n
s
( ) , ( ) DST pairs
x n x N
mn
N
X m
m
N
s
( ) / sin ( )

_
,

element of 2
1
1

c
m
c c m n
c c m n
c c m n
m
T
n
m
T
n
m
T
n



0
1 0
1 0
for
for
for
c c
m
T
n mn mn
, Kronecker delta
[ ] [ ], [ ] [ ] C C S S


1 1
f t N f N t 1 2 1 2 / / or

1999 by CRC Press LLC

13.6 FCT and FST Algorithm Based on FFT

13.6.1 FCT of Real Data Sequence

Construct an even or symmetric sequence using the sequence as follows:
DFT of {

s

(

n

)} is
The (

N

+ 1) point DCT of {

x

(

n

)} is the same as the 2N-point DFT of the sequence {

s

(

n

)}. Hence the
DCT of {

x

(

n

)} can be computed using a 2N-point FFT of {

s

(

n

)}.

13.6.2 FST of Real Data Sequence

Let be an (

N

1) point data sequence. Its DST is (see 13.4.1)
Construct a (2

N

1) point odd or skew-symmetric sequence {

s

(

n

)} using {

x

(

n

)}.
The 2

N

-point DFT of {

s

(

n

)} is

{ ( ), , , , }
( ) / cos ( )
/
x n n N N
X m N k k
mn
N
x n
k n or N
k n or N
c
n
N
m n
n
n
+

_
,

0 1 1
2
1 0
1 2 0
0
L sequence with points
for
for

s n x n n N
x n n N
x N n N n N
( ) ( ),
( ), ,
( ),
< <

<
0
2 0
2 2 1
S m x x N
mn
N
x n
F
m
n
N
( ) ( ) ( ) ( ) cos ( ) + +

_
,

1
]
1
1

2 0 1
1
1

{ ( ), , , } x n n N 1 1 L
X m N
mn
N
x n
s
n
N
( ) / sin ( )

_
,

2
1
1

s n x n n N
n N
x N n N n N
( ) ( ),
, ,
( ),
< <

<
0
0 0
2 2 1
S m j
mn
N
x n
F
n
N
( ) sin ( )

_
,

2
1
1

1999 by CRC Press LLC

13.7 Fourier Cosine Transform Pairs

13.7.1 Fourier Cosine Transform Properties
13.7.2 Fourier Cosine Transform Pairs (see Section 13.9 for notation and
denitions)

TABLE 13.1

Properties of FCT

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

TABLE 13.2

Fourier Cosine Transform Pairs

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
f t ( ) F f t t dt
c
o
( ) ( ) cos >

0
F t
c
( ) ( / ) ( ) 2 f
f at a ( ) > 0
( / ) ( / ) 1 a F a
c

f at bt a b ( ) cos , > 0 ( / ) 1 2a F
b
a
F
b
a
c c
+

_
,
+

_
,

1
]
1
f at bt a b ( )sin , > 0 ( / ) 1 2a F
b
a
F
b
a
s s
+

_
,

_
,

1
]
1
t f t
n 2
( ) ( ) ( ) 1
2
2
n
n
n c
d
d
F

t f t
n 2 1 +
( ) ( ) ( )
+
+
1
2 1
2 1
n
n
n s
d
d
F

f r g t r g t r dr
o
( )[ ( ) ( )] + +

2F G
c c
( ) ( )
f r dr
t
( )

( / ) ( ) 1 F
s
f t a f t a
o
( ) ( ) + 2 0 F a a
s
( )sin >
f r g t r g t r dr
o
o
( )[ ( ) ( )] +

2F G
s s
( ) ( )
f t ( )
F
c
( ) > 0
( / ) 1 t
( / ) ( / )
/
2 1
1 2
( / )[ ( )] 1 1 1 t U t
( / ) ( )
/
2
1 2
C
( / ) ( ) 1 1 t U t
( / ) [ / ( )]
/
2 1 2
1 2
C
( ) arg
/
t a a + <
1 2

( / ) {cos [ ( )] sin [ ( )]}

/
2 1 2 1 2
1 2
a C a a S a +
( ) ( )
/
t a U t a
1 2
( / ) [cos sin ]
/
2
1 2
a a
a t a a ( )
2 2 1
0 + >

( / ) exp( ) 2 a
t t a a ( )
2 2 1
0 + >

1 2 / [ ( ) ( )] e a e a
a a
Ei Ei
( )( ) 1 1
2 2 2
+

t t
( / ) exp( ) 2
>

t t a a ( )
2 2 1
0 cos ( ) sin ( ) a a a a Ci Si +
1 0 < < t a
1

sin( ) a
0 a t < <

1999 by CRC Press LLC

11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.

TABLE 13.2

Fourier Cosine Transform Pairs (continued)
f t ( )
F
c
( ) > 0
1 0 < < t a Ci( ) a
1/ t a t < <
[( ) ]
[ ]
/ /
/
a t a
a t
a
2 2 1 2 1 2
2 2 1 2
0
+ +
+
>
2
1 2

_
,

/
e
a
1 1
0 0
( ) ( )
, ,
a jt a jt
a
+
+

> >




[ ( )]
1 1
e
a
e a
at
> Re 0 a a ( )
2 2 1
+

( ) 1+

t e
t
2 1
2 2
( ) +

t e a
at
> Re 0


2
3 2
2 2 3 4 1
( ) cos[ / tan ( / )]
/
a a +

e t a
at
> / Re 0
( / ) ( ) [( ) ]
/ / /
2
2 2 1 2 2 2 1 2 1 2
a a a + + +

t e a
n at
> Re 0 n a a
n
m a
n m
m
n
m
![ /( )] ( )
2 2 1
2 0
1
2
1
1
2
+
+

_
,

_
,
+

exp( ) / , Re > at t a
2
0
( / ) exp( / ) ( / )
/
/
8 8 8
1 2 2
1 4
2
a a I a

t a t a
n 2 2 2
4 exp( ), arg / <
( )

1 2
1 2 1 n n n
a


exp[ ( / ) ( / )
/
2 2
2
2
1 2
a a
n
]He
t a t a

>
3 2
0
/
exp( / ), Re ( / ) exp[ ( ) ( )
/ / /
a a a
1 2 1 2 1 2
2 2 ]cos
t a t a

>
1 2
0
/
exp( / ), Re ( / ) ( ) sin( )]
/
2 2 2
1 2
[cos a a
e a
at
>
2
0 Re


2
1 2
4
a
e
a /( )
t e
at
a

> >
1
0 0 Re , Re ( )( ) cos[ tan ( / )]
/

a a
2 2 2 1
+

t t
1 2 /
ln
( / )
/
2
1 2
[ln(4 ) + C+ /2]
( ) ln , t a t a
2 2 1
0 >

( / ){sin( )[ ( ) ln ] 2 a a a ci
cos( )[ ( ) / ]} a a si 2
t t

+
1
1 ln( ) ( / ){[ ( )] [ ( )] } 1 2
2 2
ci si +
exp( / )sin( / / ) + t t 2 4 2 ( ) 1
4 1
+

exp( / ) cos( / / ) + t t 2 4 2

2 4 1
1 ( ) +

ln ,
a t
t
a
2 2
2
1
0
+
+
>
( / )[exp( ) exp( )] a
ln[ ( / ) ], 1 0
2
+ > a t a ( / )[ exp( )] 1 a
ln( ), Re 1 0 + >

e a
at
1
2
1 1
2
2
a h
a

_
,
csc
t e t
t 1
sin
( / ) tan ( ) 1 2 2
1 2

t at
2 2
sin ( )
( / )( / )

2 2 2
0 2
a a
a
<
>

'

sin
, ,
t
t
n
n

_
,
2 3 L
n n r
r n r
n
n
n
r
r n
r n

2
1 2
0
0
0
2
1
>
< +

< <

'

( ) /
( ) ( )
!( )!
,

1999 by CRC Press LLC
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
TABLE 13.2 Fourier Cosine Transform Pairs (continued)
f t ( )
F
c
( ) > 0
exp( ) cos , Re > t at
2
0 ( / )( / ) exp cosh
/
1 2
4 2
1 2
2 2

_
,

_
,

a a
( ) ( cos ) a t t
2 2 1 2 1
1 2 + +

( / )( / )( ) ( ) 1 2 1
2 1 1
a e
a


Re , a > < 0 1


+ < ( ), e e
a a a
0 1
sin( ), at a
2
0 > ( / )( / ) cos sin
/
1 4 2
4 4
1 2
2 2

a
a a

_
,

_
,

1
]
1
1
sin[ ( )], a t a 1 0
2
> + + ( / )( / ) cos[ / /( )]
/
1 2 4 4
1 2 2
a a a
cos( ), at a
2
0 >
( / )( / ) cos sin
/
1 4 2
4 4
1 2
2 2

a
a a

_
,

_
,

1
]
1
1
cos[ ( )], a t a 1 0
2
> ( / )( / ) sin[ / /( )]
/
1 2 4 4
1 2 2
a a a + +
sin
,
at
t
a > 0

2
4
0
<

>

'

a
a
a
e at a
t
> >

sin , , Re 0 0
1
2
2 2
1
2
2 2
( )
( )
( )
( )
a
a
a
a
+
+ +
+

+

sint
te
t
1
2
1
2
2
tan

_
,

sin ( )
,
2
2
0
at
t
a >

2
2
0 2
1
2
( ) a a
a
<
<

'

1
0
2

>
cos
,
at
t
a

2
0
( ) a a
a
<
<

'

e at a
t
>

cos , Re Im

2
1 1
2 2 2 2
+
+
+ +

1
]
1
( ) ( ) a a
cos[ ( ) ]
( )
/
/
b a t
a t
t a
a t
2 2 1 2
2 2 1 2
0
0

< <
< <

'

2
2 2 1 2
J a b
o
[ ( ) ]
/
+
tan

_
,
1
t
a
t

2
Ei a ( )
e He t
t
n

2
2
2 ( )

2
1
2
4
2
( ) ( )
/

n
n
e He
e He t
t
n

2
2 2 /
[ ( )]

2
2
2 2
n e L
n
! ( )
/
J at a
o
( ), > 0
( )
/
a a
a
a
2 2 1 2
0
0
< <

< <

'

1999 by CRC Press LLC

13.8 Fourier Sine Transform Pairs
13.8.1 Fourier Sine Transform Properties
13.8.2 Fourier Sine Transform Pairs
TABLE 13.3 Fourier Sine Transform Properties
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
TABLE 13.4 Fourier Sine Transform Pairs
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
f t ( ) F f t t dt
s
o
( ) ( )sin >

0
F t
s
( ) ( / ) ( ) 2 f
f at a ( ), > 0
( / ) ( / ) 1 a F a
s

f at bt a b ( ) cos , , > 0 ( / ) 1 2a F
b
a
F
b
a
s s
+

_
,
+

_
,

1
]
1
f at bt a b ( )sin , , > 0
+

_
,

_
,

1
]
1
( / ) 1 2a F
b
a
F
b
a
c c

t f t
n 2
( ) ( ) ( ) 1
2
2
n
n
n s
d
d
F

t f t
n 2 1 +
( ) ( ) ( )
+
+
+
1
1
2 1
2 1
n
n
n c
d
d
F

f r g s ds dr
t r
t r
o
( ) ( )

+

( / ) ( ) ( ) 2 F G
s s
f t a f t a
o o
( ) ( ) + + 2F a
s
( ) cos
f t a f t a
e e
( ) ( ) + 2F a
c
( )sin
f r g t r g t r dr
o
( )[ ( ) ( )] +

2F G
s c
( ) ( )
f t ( ) F
s
( )
1/ t / 2
1/ t ( / )
/
2
1 2
1 1 1 / [ ( )] t U t ( / ) ( )
/
2
1 2
S
( / ) ( ) 1 1 t U t
( / ) [ / ( )]
/
2 1 2
1 2
S
( ) , arg
/
t a a + <
1 2

( / ) {cos [ ( )]
sin [ ( )]}
/


2 1 2
1 2
1 2
a S a
a C a

'

( ) ( )
/
t a U t a
1 2
( / ) (sin cos )
/
2
1 2
a a +
t t a a ( ) ,
2 2 1
0 + >

( / ) exp( ) 2 a
t a t a ( ) ,
2 2 1
0 >

( / ) cos 2 a
t t a a ( ) ,
2 2 2
0 + >

( / ) exp( ) 4a a
a t t a a
2 2 2 1
0 [ ( )] , + >

( / )[ exp( )] 2 1 a
t t ( ) 4
4 1
+

( / ) exp( )sin 4
1999 by CRC Press LLC
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
TABLE 13.4 Fourier Sine Transform Pairs (continued)
f t ( ) F
s
( )
1 0
0
< <
< <

'

t a
a t
1 cos a

t a a
t a
2 2
1 2
2 2 1 2
+

1
]
1
+
/
/
( )

e
a
2
e a
at
> , Re 0 ( ) a
2 2 1
+

te a
at
> , Re 0 ( )( ) 2
2 2 2
a a +

t at e a
at
( ) , Re 1 0 + >

( )( ) 8
3 2 2 3
a a +

e t a
at
> , Re 0 ( / ) ( ) [( ) ]
/ / /
2
2 2 1 2 2 2 1 2 1 2
a a a + +

t e a
at
>
3 2
0
/
, Re ( ) [( ) ]
/ / /
2
1 2 2 2 1 2 1 2
a a +
exp( ), Re > at a
2
0

_
,

j a a
j
a
( / )( / ) exp( / )
/
1 2 4
2
1 2 2


Erf
t t a a exp( / ), Re >
2
4 0 2
2
a a a ( ) exp( )
t a t a

<
3 2
2
/
exp( / ), arg /
( / ) exp[ ( ) ]sin( )
/ / /
a a a
1 2 1 2 1 2
2 2
t a t a

<
3 4
2
/
exp( ), arg /
( / )( / ) [ ( / )
/
/
2 8
1 2
1 4
2
a J a
+ + cos( / / ) ( / )
/
8 8 8
2
1 4
2
a Y a
+ sin( / / )] 8 8
2
a
e e
t t

/
( )
2 1
1

1
2
tanh( )
t e a
at
<
1
2
2 , arg /
1
2
2

Erf
a

_
,

t t
1
ln
+ ( / )[ ln ] 2 C
t t a t a ( ) ln ,
2 2 1
0 >

( / ){cos [ ( ) ln ] 2 a a a Ci
+ sin [ ( ) / ]} a a Si 2
t a t a

+ >
1 2 2
1 0 ln( ),
Ei ( / ) a
ln ,
t a
t a
a
+

> 0
( / )sin a
t at a

>
1 2
0 sin ( ),

/
/
4 0 2
8 2
0 2
< <

>

'

a
a
a
t at a

>
2 2
0 sin ( ), ( / )( ) ln 1 4 2 2 + + a a
+ ( / )( ) ln ( / ) ln 1 4 2 2 1 2 a a
t at a

>
2
1 0 [ cos ],
( / ) ln ( ) / 2
2 2 2
a
+ + ( / ) ln ( ) /( ) a a a 2
sin( ), at a
2
0 > ( / ) {cos( / ) [ /( ) ]
/ /
2 4 2
1 2 2 1 2
a a C a
+ sin( / ) [ /( ) ]}
/

2 1 2
4 2 a S a
cos( ), at a
2
0 > ( / ) {sin( / ) [ /( ) ]
/ /
2 4 2
1 2 2 1 2
a a C a
cos( / ) [ /( ) ]}
/

2 1 2
4 2 a S a
1999 by CRC Press LLC
13.9 Notations and Denitions
1. f(t) Piece-wise smooth and absolutely integrable function on the positive real line.
2. F
c
() The Fourier cosine transform of f(t).
3. F
s
() The Fourier sine transform of f(t).
4. f
o
(t) The odd extension of the function f over the entire real line.
5. f
e
(t) The even extension of the function f over the entire real line.
6. C() is dened as the integral:
.
7. S() is dened as the integral:
.
8. Ei(x) is the exponential integral function dened as:
.
9. is dened as .
10. Ci(x) is the cosine integral function dened as:
34.
35.
36.
37.
38.
39.
40.
41.
42.
TABLE 13.4 Fourier Sine Transform Pairs (continued)
f t ( ) F
s
( )
tan ( / ),

>
1
0 a t a
( / )[ exp( )] 2 1 a
sin
,
at
t
a > 0
1
2
ln

a
a
sin t
t 1
2

sin

0
0

'

sin ,
a
t
a
2
0

_
,

>

2
2
1

_
,
a
J a ( )
tan ( / ),

>
1
0 t a a

2
e
a
tan ( / ), Re

>
1
2 0 a t a

e a
a
sinh( )
Erfc( ), at a > 0
( ) /
/
1
2 2
4

e
a

J at a
o
( ), > 0
0 0
1
2 2
< <
< <

'

a
a a /
J at t a
o
( ) / , > 0
sin ( / )
/

< <
< <

'

1
0
2


a a
a
( ) cos
/ /
2
1 2 1 2

o
t t dt
( ) sin
/ /
2
1 2 1 2

o
t t dt
<

x
t
t e dt x
1
, arg( )
Ei( ) x ( / )[( ( ) ( )] 1 2 0 0 Ei Ei x j x j + +
1999 by CRC Press LLC
.
11. Si(x) is the sine integral function dened as:
12. I
v
(z) is the modied Bessell function of the rst kind dened as:
.
13. He
n
(x) is the Hermite polynomial function dened as
.
14. C is the Euler constant dened as
15. ci(x) and si(x) are related Ci(x) and Si(x) by the equations:
.
16. Erf(x) is the error function dened by
.
17. J
v
(x) and Y
v
(x) are the Bessel functions for the rst and second kind, respectively,
and
.
18. U(t) is the Heaviside step function dened as

x
t t dt
1
cos
o
x
t t dt

1
sin
m
v m
z
m v m
z z

+ +
< <
0
2
2
1
( / )
! ( )
, , arg( )

( ) exp( / ) [exp( / )] 1 2 2
2 2 n
n
n
x
d
dx
x
lim ( / ) ln . ...
m
n
m
n m

1
]
1
1

1
1 0 5772156649
ci Ci si Si ( ) ( ), ( ) ( ) / x x x x 2
( / ) exp( ) 2
2

o
x
t dt

J x
x
m v m
v
m
m
v m
( ) ( )
( / )
! ( )

+ +

1
2
1
0
2

Y x v J x v J x
v v v
( ) { [ ( )cos ( )]}

cosec
U t t
U t t
( )
( )
<
>
0 0
1 0
1999 by CRC Press LLC
19. is the binomial coefcient dened as .
20. (x) is the Gamma function dened as
.
References
Churchill, R. V., 1958. Operational Mathematics, 3rd ed. New York: McGraw-Hill.
Erdelyi, A. 1954. Bateman Manuscript, Vol. 1. New York: McGraw-Hill.
Rao, K. R. and Yip, P. 1990. Discrete Cosine Transform: Algorithms, Advantages, Applications. Boston:
Academic Press.
Sneddon, I. N. 1972. The Uses of Integral Transforms. New York: McGraw-Hill.
Yip, P., 1996. The discrete sine and cosine transforms, Chapter 3 in The Transforms and Applications
Handbook, Ed. A. D. Poularikas, Boca Raton, Florida: CRC Press.
m
n

_
,

m
n m n
!
!( )!
( ) x e t dt
t x

0
1