Aide MEMOIRE DSP BBH 1

Other Signals and Systems References

DSP Books:
• J.G. Proakis and D.G. Manolakis, Digital Signal Processing: Principles, Algorithms, and Applications, Prentice Hall,
3rd Edition, 1996, ISBN 013373762- 4.

• S.S. Soliman and M.D. Srinath, Continuous and Discrete Signals and Systems, Prentice Hall, 1998, ISBN
013518473-8.

• A.V. Oppenheim and R.W. Schafer, Digital Signal Processing, Prentice Hall, 1975, ISBN 013214635-5.

• L.R. Rabiner, B. Gold, Theory and Application of Digital Signal Processing, Prentice Hall, 1975, ISBN 013914101-4.

• E.O. Brigham, The Fast Fourier Transform and Its Applications, Prentice Hall, 1988, ISBN 013307505-2.

• M.H. Hayes, Digital Signal Processing , Schaum’s Outline Series, McGraw Hill, 1999, ISBN 0-07-027389-8

DSP Papers (on my Website):

• R.W. Schafer and L. R. Rabiner, “A Digital Signal Processing Approach to Interpolation”, Proc. IEEE, vol.61, pp.692-
702, June 1973.

• J. W. Cooley, P. Lewis, and P. D. Welch, “Historical Notes on the Fast Fourier Transform”, IEEE Transactions on
Audio and Electroacoustics, June 1967

• J. Cooley and J. Tukey, “An Algorithm for the Machine Calculation of Complex Fourier
Series”, Mathematics of Computation, vol 19, 1965.

• Cooley, J. W.; Lewis, P. A. W.; Welch, P. D., “The Fast Fourier Transform: Programming Considerations in the
Calculation of Sine, Cosine, and Laplace Transforms”, Journal of Sound Vibration and Analysis, 12(3), July 1970.

• G.D. Bergland, “A Guided Tour of the Fast Fourier Transform”, IEEE Spectrum, July 1969.

• J. O. Smith and P. Gossett, “A Flexible Sampling-Rate Conversion Method,” by Proceedings of the IEEE
Aide MEMOIRE
International Conference on Acoustics, Speech, and Signal DSP BBH San Diego, March 1984 (ICASSP-84),2
Processing,
Volume II, pp. 19.4.1–19.4.2. New York: IEEE Press.
Practical, Inexpensive Signal Processing System

Pentium Computer
“Cool Edit”
Waveform Editor
Stereo
Record Player Amplifier
D Sound
Sound
Card Left Channel Card
S D/A
A/D
P
Tape Deck Right Channel
Multichannel (Stereo) Signals

Analog/ Digital/ Digital Signal Processing:

Continuous- Discrete- 1) Noise Reduction
Radio -Digital Filtering, etc.
Time Time
Signals Signals 2) Signal Compression
-MP3, JPEG/MPEG Image, etc.
Aide MEMOIRE3)DSP
Spectral
BBH Analysis (e.g., FFT) 3
 Electronic “Fax” via Portable Document Format
Digital Signal:
Scanned
Hard Copy
Far more Complex
Acoustic Waveforms
are often
EncounteredFar more
Complex Acoustic
Waveforms are often
EncounteredFar more
Complex Acoustic
Waveforms are often
EncounteredFar more
Complex Acoustic
Waveforms are often
Encountered

700 KB
DSP You’ve Got Mail:
Far more Complex
Acoustic Waveforms Adobe Acrobat PDF
are often
EncounteredFar more
Complex Acoustic
Waveforms are often
LZW Lossless
Far more Complex
Email via
EncounteredFar more
Complex Acoustic
Waveforms are often
EncounteredFar more
Compression Acoustic Waveforms are
Complex Acoustic often EncounteredFar
Waveforms are often
Encountered
Almost 10:1 Internet more Complex Acoustic
Waveforms are often
700 KB EncounteredFar more
Complex Acoustic
e.g. Concatenate in Waveforms are often
EncounteredFar more
Adobe Acrobat PDF Complex Acoustic
Waveforms are often
Encountered

Far more Complex

Acoustic Waveforms
are often
EncounteredFar more
~ 700 KB
Complex Acoustic
Waveforms are often
EncounteredFar more
Complex Acoustic
for Total
Waveforms are often
EncounteredFar more
Complex Acoustic
Document
Waveforms are often
Encountered

700 KB Aide MEMOIRE DSP BBH 4

Analysis & Synthesis Formulas

Aide MEMOIRE DSP BBH 5

Analytical discrete signal

Aide MEMOIRE DSP BBH 6

 Discrete-Time Fourier Transform

X (e j )   x[ n ]e  j n
n  
DTFT: analysis equation

time
x[n] j frequency
domain X (e ) domain

IDTFT: synthesis equation

1  j j n
x[n]   X (e )e d
2Aide MEMOIRE
 DSP BBH 7
 Commonly Used DTFT Pairs
Table 3.1
Sequence DTFT
[n]  1

1   2(  2 k)
k  

jo n
e   2(  o  2 k)
k  
1 
[n]      (   2  k)
1  e j k 
1
[n], (   1)   j
1  e
Aide MEMOIRE DSP BBH 8
Table 3.2:General Properties of DTFT

Aide MEMOIRE DSP BBH 9

Table 3.3: DTFT Properties:
Symmetry Relations

x[n]: Aide MEMOIREsequence

A complex DSP BBH 10
Table 3.4: DTFT Properties:
Symmetry Relations

AideA
x[n]: MEMOIRE DSP BBH
real sequence 11
Aide MEMOIRE DSP BBH 12
Aide MEMOIRE DSP BBH 13
Aide MEMOIRE DSP BBH 14
Aide MEMOIRE DSP BBH 15
Aide MEMOIRE DSP BBH 16
Aide MEMOIRE DSP BBH 17
Aide MEMOIRE DSP BBH 18
Aide MEMOIRE DSP BBH 19
Aide MEMOIRE DSP BBH 20
Aide MEMOIRE DSP BBH 21
Aide MEMOIRE DSP BBH 22
 z-Transform

X ( z)   x[n] z n

n 
z-Transform: analysis equation

time
domain
x[n] X ( z) z-domain

Inverse z-Transform: synthesis equation

1
x[n]   X ( z ) z n 1dz
2  j C  DSP BBH
Aide MEMOIRE 23
Aide MEMOIRE DSP BBH 24
Aide MEMOIRE DSP BBH 25
 Transformasi Z
• Beberapa deret terkenal

1
 1  x  x  x  x ...   ( x) n ,
2 3 4
x 1
1 x n 0

1
 1  x  x  x  x ...   x n ,
2 3 4
x 1
1 x n 0

e  1  x  12 x  31! x  41! x ...   n1! x n ,
x 2 3 4
x 
n 0
 2n
x
Cos x  1  12 x  41! x ...   (1)
2 4 n
x 
n 0 (2n)!
 2 n 1
x
Sin x  x  31! x  51! x ...   (1)
3 5 n
x 
n 0 (2n  1)!
Aide MEMOIRE DSP BBH 26
Table 3.8: Commonly Used z-
Transform Pairs

Aide MEMOIRE DSP BBH 27

Table 3.9: z-Transform Properties

Aide MEMOIRE DSP BBH 28

Aide MEMOIRE DSP BBH 29
Aide MEMOIRE DSP BBH 30
Aide MEMOIRE DSP BBH 31
Aide MEMOIRE DSP BBH 32
Aide MEMOIRE DSP BBH 33
Aide MEMOIRE DSP BBH 34
Aide MEMOIRE DSP BBH 35
Aide MEMOIRE DSP BBH 36
Aide MEMOIRE DSP BBH 37
Aide MEMOIRE DSP BBH 38
Aide MEMOIRE DSP BBH 39
Aide MEMOIRE DSP BBH 40
Aide MEMOIRE DSP BBH 41
Aide MEMOIRE DSP BBH 42
Aide MEMOIRE DSP BBH 43
Aide MEMOIRE DSP BBH 44
Aide MEMOIRE DSP BBH 45
Hubungan antara Ck, ak, bk

Aide MEMOIRE DSP BBH 46

Aide MEMOIRE DSP BBH 47
f (t ) pour t  0 F ( p )  L[ f (t )] ~ f ( kT ) pour k  0
f ( z )  Z [ f ( kT )]

1 z
1 1
p z 1

t 1 Tz
kT
p2 ( z  1) 2

1 z
e  at pa [ ou
z
] e  akT (  e  aT ) k
[ ou ]
z  e  aT z  e  aT

 at
1 Tze  aT
te ( z  e a ) 2 kTe akT
( p  a) 2

a z (1  e  aT )
 at
1 e p( p  a ) ( z  1)( z  e  aT ) 1  e  akT

 at
a2 
z (1  e  aT )(1  z )  aT ( z  e  aT ) 
at  1  e p 2 ( p  a) ( z  1) 2 ( z  e  aT ) akT  1  e  akT

ba z ( e  aT  e  bT )
 at  bt
e e ( p  a )( p  b) ( z  e  aT )( z  e  bT ) e  akT  e  bkT

e  at cos( bt ) pa z ( z  e  aT cos bT ) e  akT cos( bkT )

( p  a) 2  b 2 z 2  2 ze  aT cos bT  e  2 aT

e  at sin( bt ) ze  aT sin bT e  akT sin( bkT )

b
( p  a) 2  b 2 z 2  2 ze  aT cos bT  e  2 aT

Tables de correspondance entre transformée

Aide MEMOIRE DSP BBH en z et de Laplace 48
Aide MEMOIRE DSP BBH 49
Aide MEMOIRE DSP BBH 50
 Example #1
• Transfer function 1/(s+2) and input e -t u(t)
By Fourier Transform By Laplace Transform
F    F s  
1 1
Transform the input
j  1 s 1
H    H s  s  j  H s  
1 1
Transform h(t)
j  2 s2
Y    H  F   Y s   H s F s 
1 1 1 1
Calculate output  
j   1 j  2 s 1 s  2
1 1 1 1
   
j   1 j  2 s 1 s  2
Inverse Transform y t   e t  e  2t  u t  y t   e t  e  2t  u t 

• Either way takes about the same amount of work

Aide MEMOIRE DSP BBH 51
Example #2: Laplace is Easier
• Transfer function 1/(s+2) and input u(t)
By Fourier Transform By Laplace Transform
F        F s  
1 1
Transform the input
j s
H    H s  s  j  H s  
1 1
Transform h(t)
j  2 s2
Y    H  F  
 1  1

    
   Y s   H s F s 
 j  j  2
1 1
Calculate output    1 
  s s2
j   2 j   j  2 
11 1 
    
    
1 1 1 1 2 s s2

2 2 j  2 j  2
Inverse Transform
1
2
 
y t   1  e  2t u t  y t  same
Aide MEMOIRE DSP BBH 52
 Example #3: Laplace Cannot
Work
• Transfer function 1/(s+2) and input et u(-t)
By Fourier Transform By Laplace Transform
F       
1
Transform the input
j
H    H s  s  j 
1
Transform h(t)
j  2
Y    H  F  
Since the input is noncausal
1 1
Calculate output  unilateral Laplace transform
j  1 j   2
cannot be used
1 1 1 1
 
3 j  1 3 j   2
Inverse Transform 1
2

y t   1  e  2t u t 
Aide MEMOIRE DSP BBH 53
 Signal Distortion
• Total distortion
Y() = F() H()
H() is the frequency response
• Magnitude distortion
|Y()| = |F()| |H()|
• Phase distortion
Y() = (F() H()) =  F() +  H()
• All-pass filter: magnitude response of 1
Example: Phase shifting by 90° to convert
cos(2fct) into sin(2fct) known as a Hilbert
transformer
Aide MEMOIRE DSP BBH 54
 Distortionless Transmission
• Want distortionless transmission: input and output
signals have identical shapes, differ by a multiplicative
constant, and may be delayed
y(t) = k f(t - t) Y() = k e - j  t F()
H() = Y()/F() = k e - j  t
Magnitude response: |H()| = k
Phase response (linear):  H() = –  t
Time delay is the negative of the derivative of 
H() w/r to 
• Channels have distortion
Receiver needs to know the channel distortion
Receiver uses an equalizer.
Aide MEMOIRE DSP BBH 55
 Importance of Linear phase
• Speech signals • Linear phase crucial
– Use phase differences – Audio
to locate a speaker
– Images
– Once locked onto a
speaker, our ears are – Communication
relatively insensitive to systems
phase distortion in • Linear phase response
speech from that – Need FIR filters
speaker (underlies – Realizable IIR filters
speech compression cannot achieve linear
systems, e.g. digital cell phase response
phones.)
Aide MEMOIRE DSP BBH 56
Aide MEMOIRE DSP BBH 57
Aide MEMOIRE DSP BBH 58
Integration by parts:
General equation:

b b
t b
 u(t )dv(t )  u(t )v(t )
a
t a
  v(t )du(t )
a

Aide MEMOIRE DSP BBH 59