FOURIER ANALYSIS O F DISCRETE SIGNALS

4-2.3 A b a n d p a s s w a v e f o r m x(t) i s t o b e s a m p l e d a n d t h e n r e c o n s t r u c t e d b y
p a s s i n g t h e s a m p l e s t h r o u g h a b a n d p a s s filter. I f t h e s a m p l e s a r e t o b e t a k e n e v e r y
At s a n d t h e s a m p l i n g w i d t h i s t , d e t e r m i n e t h e m í n i m u m s a m p l i n g r a t e i f
0

?F{x(t)} = X(f) e x i s t s o n l y f o r 1 0 0 s |/¡ < 1 2 0 H z . D o e s t h e r e e x i s t a m á x i m u m

sampling rate?

4-2.4 T h e t i m e f u n c t i o n x{t) = 5 e o s 2 0 0 0 7 r t e o s 4000-77Í i s s a m p l e d 9 0 0 0 t i m e s

2

per second. I f reconstruction is t o be accomplished b y passing thesampled signal

t h r o u g h a n i d e a l l o w - p a s s filter o f b a n d w i d t h 5 2 0 0 H z , d e t e r m i n e t h e o u t p u t t i m e
f u n c t i o n , a s s u m i n g t h e filter h a s z e r o p h a s e s h i f t a n d u n i t y g a i n o v e r i t s p a s s b a n d .
C o m p u t e t h e m e a n s q u a r e e r r o r o f t h e o u t p u t t i m e f u n c t i o n . W h a t i s t h e mínimum
s a m p l i n g rate that permits t h e signal t o be uniquely reconstructed?

4-3.1 C o m p u t e t h e D F T o fthe f o l l o w i n g sequences:

a. {x(n At)} = { 1 , 0 , 0 } At = 1 / 2 s
b. {x(n At)} = { 1 , 0 , 0 , 1 , 0 , 0 } At = 2 s

4-3.2 Carry out, i n t h e time domain, the periodic a n d aperiodic convolution o f

the f o l l o w i n g sequences a n d sketch t h e results. U s i n g t h e D F T a n dproperly a u g -
mented sequences, compute t h e periodic a n d aperiodic c o n v o l u t i o n s o f t h e se-
quences

{x {nAt)}
x = { 1 , 1 , 1 , 1} A i= 1 s

{x (nAt)}
2 = { 2 , 2 , 1 , 1} A i= 1 s

4-4.1 C o m p u t e t h e constants W kN required i nt h e 8-point decimation-in-time F F T

algorithm. H o w m a n y are real a n dh o w m a n y are c o m p l e x ?

4-4.2 M a k e a t a b l e o f t h e n u m b e r s o f c o m p l e x m u l t i p l i c a t i o n s a n d a d d i t i o n r e -
quired for direct a n dfor t h e decimation-in-time a l g o r i t h m c o m p u t a t i o n o fthe D F T
w h e n N = 1 2 8 ,1024, 32,768.

4-5.1 L e t h{t) = e x p ( - r ) ; t > 0 . S a m p l e h(t) w i t h A i = 0 . 0 1 s a n d N = 1 0 2 4 .

C o m p u t e a n a p p r o x i m a t i o n t o samples o ft h eF o u r i e r transform b y using t h e F F T .

4-5.2 T w o c o m m o n l y u s e d w i n d o w f u n c t i o n s a r e t h e H a m m i n g w i n d o w a n d t h e
H a n n i n g w i n d o w . T h e s e functions possess t h edesirable property o fbeing compact
in t h e frequeney d o m a i n a n d having l o wsidelobes i n t h e t i m e d o m a i n . These
functions are as follows:

i + Uos ^ |/|</ 0

Jo
Hanning window: X¡(f) =
0 elsewhere

• 0.54 + 0.46 eos^ |/| < / o

Jo
H a m m i n g w i n d o w : X (f) 2 =
0 elsewhere

U s i n g t h eF F T , compute a n dplot t h e time function corresponding t o these spectra.

 PROBLEMS 217

4-5.3 U s et h eF F T t o c o m p a r e t h e sidelobe characteristics o f

a. T h e r e c t a n g u l a r window
b. T h e H a m m i n g w i n d o w
c. T h e H a n n i n g w i n d o w

4-5.4 D e t e r m i n e t h e D F T ( u s i n g t h e F F T ) f o r t w o c y c l e s o f a s i n e w a v e . T h e n
repeat t h e calculation for several increases i n t h e data record length b y factors o f
t w o . S u p e r i m p o s e t h e p l o t s o f t h e D F T t o demónstrate t h e e f f e c t o f t h e r e c o r d
l e n g t h o n t h e D F T estímate.

4-5.5 R e p e a t P r o b l e m 4 - 5 . 4 u s i n g a H a m m i n g w i n d o w o v e r t h e d a t a t o d e m ó n -
strate t h e i m p r o v e d c o n v e r g e n c e that results.

4-5.6 F i n d t h e e r r o r i n c o m p u t i n g t h e s p e c t r u m o f a r e c t a n g u l a r p u l s e , u(t + |)
— u(t — i ) , u s i n g t h e F F T . U s i n g a s a m p l i n g i n t e r v a l o f 0 . 1 2 5 s a n d d u r a t i o n s o f
4 s a n d 1 6 s a n d t h e n r e p e a t i n g w i t h a s a m p l i n g i n t e r v a l o f 0 . 0 6 2 5 s, c o m p u t e t h e
error at each point o f the F F T spectrum using thek n o w n analytical solution a n d
plot t h e result.

4-6.1 C a r r y o u t t h e n u m e r i c a l c o n v o l u t i o n o f t h e t w o f u n c t i o n s s h o w n u s i n g a
s a m p l i n g i n t e r v a l o f 0 . 0 1 s. R e p e a t , u s i n g t h e F F T w i t h e x a c t l y t h e s a m e s p a c i n g
o f samples. C o m p a r e t h eresults b y t h et w o methods w i t h each other a n dw i t h t h e
exact solution.

X, x 2

- 1 o í —- Figure P4-6.1

4-6.2 C o n v o l v e s i n co t a n d e \t > 0 ) t h e o r e t i c a l l y . T h e n r e p e a t w i t h
0 sampled
representations o fthese functions using F F T techniques.

4-6.3 U s i n g t h e p r o c e d u r e d i s c u s s e d i n t h e t e x t , d e s i g n a l o w - p a s s f i l t e r h a v i n g a
cut-off frequency o f 2 H zand employing a sampling frequency o f 4 0 H z . Compare
t h e f r e q u e n c y r e s p o n s e s o f t h i s filter w i t h t h a t o f a s e c o n d - o r d e r B u t t e r w o r t h filter
with thesame cut-off frequency.

4-6.4 U s e t h e i m p u l s e r e s p o n s e o f t h e filter o f P r o b l e m 4 - 6 . 3 t o filter t h e f o l l o w i n g

signal.

x(t) = s i n 27rt + 1 0 s i n lO-ní

 PROBLEMS 167

7. P a p o u l i s , A . , Signal Analysis. New York: McGraw-Hill Book Company, 1977.

T h i s b o o k i s w r i t t e n at a senior-graduate level. M a n y interesting applications o f
F o u r i e r analysis are discussed that illustrate t h e use o f these techniques i n signal
design a n dsignal processing.

8. Z i e m e r , R . E . , W . H . T r a n t e r , a n d D . R . F a n n i n , Signáis and Systems: Con-

tinuous and Discrete. N e w Y o r k : M a c m i l l a n P u b l i s h i n g C o . , I n c . , 1 9 8 9 .
T h i s b o o k c o v e r s m o s t o f the s a m e topics as the present t e x t a l t h o u g h i na d i f f e r e n t
o r d e r . T h e c o n t i n u o u s c a s e i s c o v e r e d i n t h e first h a l f o f t h e b o o k , a n d t h e d i s c r e t e
case is covered i n t h e second half.

PROBLEMS

3-2.1 C o m p u t e t h e e x p o n e n t i a l F o u r i e r s e r i e s expansión f o r t h e p e r i o d i c wave-

f o r m s s h o w n a n dsketch t h eamplitude spectrum o f each.

xjt)

T 2T 0 T/2 T 3772 2T -

Triangular waue Halí-wave redified smusoid

Figure P3-2.1

3-2.2 C o m p u t e t h e t r i g o n o m e t r i c F o u r i e r s e r i e s expansión f o r t h e p e r i o d i c w a v e -
f o r m s s h o w n using t h eresults g i v e n i n Table 3 - 1 .

xp)
2- -

i I i I i i i I I i i I
-2 0 2 4 6 8 10 ' — "

Figure P3-2.2

3-3.1 A r u l e o f t h u m b t h a t i s o f t e n u s e d i n t h e d e s i g n o f a m p l i n e r s f o r s q u a r e
w a v e s i s that t h e a m p l i f i e r should pass all h a r m o n i o s u p t o t h e tenth i n order t o
obtain g o o d reproduction o fthe w a v e f o r m .
170 FOURIER SERIES A N D TRANSFORMS

3-8.1 State w h i c h o f the f o l l o w i n g t i m e functions a r e not F o u r i e r transformable

o n the basis o fthe D i r i c h l e t conditions and give the reasons.

a. JC,(Í) = tu(-t) b. x (t)

2 = eos

c. x ( í ) = —-^
3 u{t - 2)u(t + 2 ) d. x¿t) = e"°

3-8.2 F i n d t h e equivalent duration a n d bandwidth o f t h e gaussian pulse

e x p ( - Trt ). C o m p a r e t h e b a n d w i d t h o f a g a u s s i a n p u l s e w i t h t h e b a n d w i d t h s o f
2

rectangular and triangular pulses h a v i n g the same equivalent duration.

3-8.3 U s i n g t h e F o u r i e r t r a n s f o r m , find t h e v o l t a g e a c r o s s t h e r e s i s t o r i n t h e c i r c u i t
s h o w n f o r a n i n p u t o f 1 0 0 e ~ ' ° ' u{t).5

1mH

I- Figure P3-8.3

3-9.1 W h e n a f u n c t i o n h a s o d d o r e v e n s y m m e t r y a b o u t t h e o r i g i n , i t i s p o s s i b l e
to c o m p u t e the transform o fthe complete function f r o m that portion o fthe func-
t i o n c o r r e s p o n d i n g t o p o s i t i v e t i m e o n l y , f+(t). T h e r e q u i r e d r e l a t i o n s h i p s a r e a s
follows:

/,(') = U - 0 = /+(-')«(-0 + fAt)u(t)

O 2 R e 3?{/ + (f)}

/o(0 = ~/o(-0 = -/ (-0«(-0 + /+(0M(0

+

0 2 y ' I m 9{f + {t)}

a. D e r i v e t h e a b o v e r e l a t i o n s h i p s .
b. U s e t h e a b o v e e x p r e s s i o n s t o c o m p u t e t h e F o u r i e r t r a n s f o r m s o f t h e w a v e f o r m s
s h o w n i nF i g . P3-9.1 starting f r o m the transforms o f the causal functions.
 PROBLEMS 173

3-12.1 F o r m a n y Communications p r o b l e m s i t i s d e s i r a b l e to h a v e a p u l s e s i g n a l
w i t h a large f r a c t i o n o f its energy concentrated w i t h i n a specific b a n d w i d t h .
a. C o m p a r e t h e f r a c t i o n o f t h e e n e r g y c o n t a i n e d i n t h e f r e q u e n c y b a n d | / | < ( 1 / 7 )
for the three pulses s h o w n .
b. T h e e n e r g y c o n t a i n e d i n a p a r t i c u l a r p u l s e f o r a g i v e n a m p l i t u d e i s a l s o i m p o r -
tant. C o m p u t e the relative energies o f each o f the pulses shown.
c. W h i c h pulse w o u l d y o u select f o r s i g n a l i n g purposes and w h y ?

1 1 Ztrt
2 + 2 COS —

-772 0 7 7 2 t-~- -772 0 7 7 2 t— -772 0 772 t — Figure P3-12.1

3-13.1 A t i m e f u n c t i o n x(t) h a s a t r a n s f o r m o f

X((o) =
ar — 3ja> — 2

U s i n g the results o f Sec. 3-13, write the Fourier t r a n s f o r m for each o f the f o l l o w i n g
time functions:
a. x(2t + 1) b. e- 'x(t j2 + 1)
dx
c. d. x{-2t)
dt
. x(\ 0 f. x{t) e o s t

3-13.2 U s i n g T a b l e s 3 - 3 a n d3-4, w r i t e t h et i m e f u n c t i o n corresponding t o each

o f the following Fourier transforms.
a . e'" 2 b. s i n c 2 2fe~i27rí

c.
-jü) + 1 1 + j(ü

3-14.1 F i n d the Fourier transforms o f the following time functions:

a . x(t) = A e o s (o tu(t) 0

b- x(t) = ( 1 + m e o s w í ) c o s ( w í 4 - <j>)
( 0

ce

c . x(t) = -r + 2 n a co + b s i n nco t
o s n w { n 0

2 n=\
3-14.2 F i n d the F o u r i e r transforms o f the f o l l o w i n g t i m e functions using frequency
convolution:

a. f(t) = [ 1 + m(t)] s i n (o t 0

b. e~°" s i n tu tu(t)
0

c . x(t) = c o s ct>[í s i n a> t 2