DSP1 Raisoni

Prof. D.B.
Kshirsagar,
Computer Department,
COE,Kopargaon
June 20, 2017 Digital Signal Processing Applications 1

Contents ...
Signals, Classifications
Standard Signals in DSP: u(n) and (n)
Convolution form
Signal operations
DT systems, properties
Impulse and Step Response
Representation of DT system: Modelling
Impulse Response and Difference Equation
FIR and IIR System
DSP system, Sampling process, DT frequencies
Aliasing

Contd ...
Fourier Series and Fourier Transform (DTFT)
Properties of DTFT
FT and DFT
Significance of N, DFT Spectrum
Twiddle factors
DFT Properties
Circular Convolution
CC and LC, Linear Filtering
CC using DFT and IDFT
DFT Spectral Leakage
Analysis frequencies
FFT Algorithms
Contd ...
Z- Transform (ZT)
Significance of ROC
ZT and DTFT, DFT
Rational ZT, Pole Zero Plot
System function H(Z)
Difference Equation, Pole Zero Plot and H(Z)
Analysis of DT LTI Systems
Frequency Response
DT System as Filters
FIR and IIR Filters
Design of Filters
Filter Structures
DT Signals and Systems
Signal : A physical quantity containing some useful
information and function of one or more than one
independent variable
e.g. speech, image, video, ECG, EEG, seismic, radio etc.
Signal processing concerned with mathematical
representations of signals and algorithmic operations to
extract useful information from the signals
Signal domains : spatial (signal uses distance as an
independent parameter i.e. time) and transformed
domain like Frequency or Z-domain
DT System signal processing device

DT signals are the forms of CT signals obtained from
the process of sampling
Sampling forms a bridge between CT and DT domain
Representations:
1. Sequence Representation
2. Graphical Representation
3. Mathematical Form
4. Tabular Representation

Classifications of signals
1. 1-D, 2-D, 3-D signals
2. Even and Odd signals
3. Periodic and Aperiodic signals
4. Causal and Noncausal signals
5. Deterministic and Nondeterministic signals

Standard Signals
Unit step signal: u(n)
Unit impulse signal /Unit sample sequence : (n)
Any arbitrary DT sequence can be represented by means of

(n) (weighted, shifted version of (n) )
e.g. x(n) = {1, -2, 3, 2, -1}

= (n) 2. (n-1) + 3. (n-2)+ 2. (n-3) - (n-4)

Thus,
= x(n) * (n) Convolution form

Likewise,
u(n) = u(n) * (n)
Also, (n) = u(n) u(n-1)

Computational complexity of a linear convolution :
with x(n) and h(n) having N samples
Total multiplications = N . (2N 1)
Total additions = (N-1) . (2N 1)

Operations performed on DT signals
1. Reflection (Folding/Time Reversal) : x(-n)
2. Time Shifting:
Advancing : x(n + k)
Delaying: x(n - k)
3. Time Scaling:
Expansion: x(n/k)
Compression: x(n.k)
k: scaling factor
4. Inversion (Amplitude Scaling): - x(n)
i.e. A. x(n) where A= -1
5. Additions, Subtractions, Multiplications etc.

DT System
A discrete-time system processes a given input sequence
x(n) to generates an output sequence y(n) in a desired
manner
A Signal processing device
x(n) Discrete time y(n)

System
Input sequence Output sequence

Properties of DT System
Dynamicity:
1) static
2) dynamic
Causality:
1) causal
2) non-causal
Time Invariance (TIV)
Stability
Linearity
Invertibility

Representation Of DT System
Impulse Response: h(n)
Linear Convolution: y(n) = x(n) * h(n)
Difference equation:
System Function: H(), H(Z)

Pole Zero Plot : H(Z)
FIR and IIR systems
Design of a DT system: h(n) or H(Z)

Impulse and Step Responses
The response of a discrete-time LTI system to a unit
sample sequence (n) is called the unit sample
response or, simply, the impulse response, and is denoted
by h(n)
The response of a discrete-time LTI system to a unit step
sequence u(n) is called the unit step response or, simply,
the step response, and is denoted by s(n)
Input x(n) and output y(n) arbitrary;
h(n), s(n) : unique which defines the system

Impulse Response
x(n) =(n) LTI y(n) =h(n)
Step Response
x(n) = u(n) LTI y(n) = s(n)

Impulse Response h(n) and DT System
For a static system, h(n) = 0 for n 0
For a causal system, h(n) = 0 for n < 0
For a stable system,
Invertibility
where, h1 (n) : Inverse system

Step Response:

Impulse Response
Example - The impulse response of the system
is obtained by setting x[n] = [n]
y[n] 1x[n] 2 x[n 1] 3 x[n 2] 4 x[n 3]

The impulse response is thus a finite-length sequence
of length 4 given by
h[n] 1 [n] 2 [n 1] 3 [n 2] 4 [n 3]
h[n] {1 , 2 , 3 , 4 }


For FIR system the impulse response is {bk} coeff of difference
equation
What about IIR system?
e.g. y(n) = x(n) + y(n-1)
has impulse response h(n) = (n) + h(n-1)
= u(n) Recursive system
Sim, for, y(n) = x(n) + a.y(n-1)
n
h(n) = a u (n)
Non-recursive system : FIR system

Recursive system : IIR system
DT Systems can be designed as FIR or IIR systems
CT Systems ? Analog FIR filters does not present

A DT LTI system is completely characterized by its
impulse response
Therefore, knowing the impulse response, one can
compute the output of the system for any arbitrary
input

A discrete-time LTI system is denoted as
x[n] h[n] y[n]
Any arbitrary input sequence x[n] can be expressed as a

linear combination of delayed and advanced unit sample
sequences in the form

x[n] x[k ] [n k ]
k
The response of the LTI system to an input - x[k ] [n k ]
will be x[k ] h[n k ]

Hence, the response y[n] to an input

x[n] x[k ] [n k ]
k
will be

y[n] x[k ] h[n k ]
k
which can be alternately written as

y[n] x[n k ] h[k ]
k

The summation

y[n] x[k ] h[n k ] x[n k ] h[n]
k k
is called the convolution sum of the sequences x[n] and
h[n] and represented compactly as
y[n] = x[n] * h[n]

Recursive implementation of a system:
gives, y(n) = x(n) + y(n-1) (1)

Non Recursive system viewed as Recursive:
gives, y(n) = x(n) + y(n-1) (2)

Both systems are same ?

Discrete-Time LTI Systems
DT LTI systems is characterized by a linear constant-
coefficient difference equation of the form
x(n) and y(n) are, respectively, the input and the output
of the system
{ak } and {bk } parameters: coefficients of y(n) and x(n)
The order of the system is given by max(N,M), which is
the order of the difference equation
FIR and IIR systems

DSP System
xa (t ) ADC DSP DAC ya (t )
Equivalent Analog Signal Processor
xa (t ) ASP ya (t )

ADC
1. Sampler: Conversion of CT signal into continuous
amplitude DT signal
2. Quantizer: Conversion of continuous amplitude DT
signal into discrete amplitude DT signal. Results into Q
error
3. Coder: Represent each DT sample by b-bit binary
sequence
b log2 L
L: Quantization levels

Analog and DT frequencies
CT signal:
x(t) = A. cos(2Ft + ) ------(1)
DT signal:
x(n) = x(t) | t=nT=n/Fs
= A. cos(2F.n/Fs + ) ------(2)
Also, x(n) = A. cos(2fn + ) ------(3)
Thus,
f = F/Fs ------(4)
And x(n) = A. cos(n + ) ------(5)
= 2f = 2. F/Fs
= .T -----(6)
F: Analog frequency (cycles/s) f: DT frequency (cycles/samples)
Fs: Sampling frequency (Samples/s) N = 1/f Period DT signal (samples/cycle)
_
Aliasing: Identical sampling

Mapping of analog frequency range onto finite DT
frequency range:
-1/2 <= f <= +1/2
- <= <= +
Higher frequencies taking form of lower frequencies
DT sinusoids having frequencies integer multiple of 2 are
always identical
All frequencies
are the aliases of frequency F0
Sampling Theorem
Time domain and frequency domain aliasing

Fourier Transform (DTFT) and DFT
Frequency analysis of signals and systems
Fourier: Any signal can be viewed as a linear combination
of basic sets of signals (decomposition) and can be
represented by means of sinusoids
Periodic signals : Fourier series
Trigonometric form
Complex exponential form
Aperiodic Signals: Fourier Transform
FT is Periodic and continuous spectrum
Periodic CT : FS, Aperiodic CT: FT
Periodic DT : DFT, Aperiodic DT: DTFT
Magnitude and Phase spectrum

Properties
Linearity
Periodicity
Time Shifting
Frequency Shifting (Modulation Property)
Time Reversal
Convolution
Multiplication of two sequences (Windowing Theorem)

DFT
Sampled version of FT
Efficiently computed by means of digital computer
N point DFT : N frequency samples obtained at discrete
set of frequencies
2k
k
N
Relationship between FT and DFT
2k
X ( K ) X ( ) k
N

DFT spectrum: plot of X (K ) v/s K
: gives magnitude for different k
K : defines a set of N discrete frequencies k
N >= L (L: length of the DT signal)
Can we compute different N point DFTs for the same DT

signal ?
Significance ?
IDFT gives periodic extended signal
Properties: Periodicity, circular symmetry
N-point CC v/s LC

Analysis Frequencies
k = 2k / N
= 2fk
=2Fk / Fs
Also,
fk = k / N
=Fk / Fs
Thus,
Fk = k. Fs / N

Problem of spectral leakage
The analysis frequencies observed
k .Fs
Fk k = 0,1, (N-1)
N
e.g. If, Fs = 4 K Samples/s, N = 8

Then Fk = {0, 0.5, 1.0, 1.5, 2.0,2.5, 3.0, 3.5}
If {Fk} are not the part of a given DT signal x(n), then
DFT spectrum is not correct giving leakage of actual
frequencies

Twiddle factor
DFT as linear transformation
CC using DFT and IDFT
DFT as linear filtering
LC using N-point CC
For LC, N = (L + M 1)

Fast Fourier Transform (FFT)
Efficient computation of DFT
Radix r FFT
Divide and conquer approach
Splitting N-pt DFT into smaller DFTs
Effective use of Periodicity and Symmetry property
Computation of N/2 butterflies in each stage and log2 N
stages
Computational complexity is reduced to
N/2 . log2 N multiplications and
N. log2 N additions

DIT FFT Algorithm

DIF FFT Algorithm

N/2 twiddle factors
In-place computation
Indexing in bit reversal
Computing basic butterflies, pairing in each step :
2**k with k = 0, 1, , (n-1) where n = log2 N
Computation of IDFT using FFT:
Reverse the direction of flow graph
Change the sign of phase (twiddle) factors
Interchange the inputs and outputs
Finally divide each output by N

In Semester Exam - I
A continuous time signal x(t) = 3cos(50t) + 10sin(200t) - cos(100t) is
sampled with sampling frequency 1000 samples/sec. Find the different
frequencies (Analog frequency F and DT frequency f).
Give the classification of DT signals as Even v/s Odd and Periodic v/s
Aperiodic signals.
Obtain the form of Nth order difference equation used to represent the DT
system and represent it for FIR and IIR system.
Define 1) Impulse Response 2) Recursive system 3) Aliasing
4) Quantization 5) Sampling
State and prove the convolution property of Fourier Transform (FT).

How the DFT computations are reduced in FFT? Draw the basic butterfly
structure for DIT FFT algorithm and hence obtain the computational
complexity of N point DFT.
Plot the magnitude spectrum of a 4 point DFT for the DT sequence
x(n) = {1, 0, 0, 1}

State the convolution property of DFT. Compare between Linear Convolution
and Circular Convolution.
Using Power series method, obtain the IZT of (right sided sequence).
Obtain ZT of unit step signal u(n) and Plot its ROC.
Derive the relationship between ZT and FT.

What is a pole zero plot of ZT? Obtain it for a system having impulse response

Solution
x(t) = 3cos(50t) + 10sin(200t) - cos(100t) , Fs = 1000 s/s
Analog frequency F : F1 = 25 Hz, F2 = 100 Hz, F3 = 50Hz
DT frequency f = F/Fs : f1 = 25/1000 = 1/40, f2 = 1/10, f3 = 1/20
Classification of DT signals:
Even v/s Odd: Even x(n) = x(-n), Odd x(-n) = -x(n)
Periodic v/s Aperiodic signals: Periodic x(n) = x(n+N)
Obtain the form of Nth order difference equation as:
FIR system :
IIR system: equation itself OR
Statement: x(n) * h(n) =

Proof for the convolution property of Fourier Transform (FT)
Computational efficiency is improved due to divide and conquer; effective use
of periodicity and symmetry property
Basic butterfly structure for DIT FFT algorithm
The computational complexity of N point DFT:
x(n) = {1, 0, 0, 1}
N point DFT:
Magnitude spectrum: Plot of X(K) v/s K
N point DFT: gives N frequency samples located at
Linear Convolution and Circular Convolution comparison
(right sided sequence)
Take straight forward long division to get IZT
ROC:
ZT of unit step signal u(n): ROC:
Relationship between ZT and FT:
Pole Zero plot of ZT : Graphical representation of poles and zeros in complex Z
Plane. For a system, it is for H(Z)
Taking ZT Zero at Z = 0 and Pole at Z = 0.5
Digital Signal Processing Applications 43
.
In Semester Exam- II
State the mathematical models used to represent a DT system. Define these
models with mathematical form.
Define the Impulse Response of a DT system and show that for a causal
system
A CT signal having frequency 50 Hz is sampled at a rate of 1200 samples/sec.
Obtain -
Number of samples per cycle.
Digital/Discrete frequency f and .
Minimum sampling rate to avoid aliasing effect.
Period of a DT signal
State and prove the time reversal property of Fourier Transform (FT)
What do you understand by Indexing in Bit-Reversal in FFT? Draw the basic
butterfly structure for DIF FFT algorithm and hence obtain the computational
complexity of N point DFT.
Perform following circular shifting operations on a given DT signal .

What is the significance of N in N point DFT? Define N point DFT by means
of twiddle factor W and compute twiddle factors for N = 4.
Define ROC of ZT. How many possible ROCs a single ZT may have? Give one
example.
B] Obtain ZT of a DT signal using ZT properties where,
Specify the ROC.

Draw a Pole Zero plot for a system described as -
Define the term system function H(Z). Express it in the form of pole zero
system and define it for FIR and IIR system.

Solution
Mathematical models used to represent a DT system:
Impulse Response: h(n)
Convolution: y(n) = x(n) * h(n)
Difference equation:
System function H(Z)
Impulse response of a DT system: h(n) Definition
Proof:
Analog frequency F = 50 Hz, Fs = 1200 samples/sec.
Number of samples per cycle N = 1200/50 = 24
Digital/Discrete frequency f and : f = F/Fs= 1/24 cycles/samples,
Minimum sampling rate to avoid aliasing effect Fs = 2.F = 100Hz
Period of a DT signal N = 1/f = 24 samples/cycle
Time reversal property of Fourier Transform (FT):
Proof
Indexing in Bit-Reversal: Input data sequence is bit reversal with DFT Output
sequence or vice versa. Basic butterfly structure for DIF FFT algorithm
computational complexity of N point DFT:

Take for N = 5 and then perform circular shifting
N point DFT: gives N frequency samples located at

N point DFT by means of twiddle factor W:
Compute twiddle factors for N = 4: values

ROC of ZT
possible ROCs a single ZT may have : 3 ROCs
Give one example: has ROCs
B] ZT of a DT signal using ZT properties

Time shifting and time scaling property
ROC:

Pole Zero plot for a system
Taking ZT we get,
Zero at Z = 1, Poles at Z = 0.5 and Z = -0.3. Pole zero plot
System function H(Z):
Roots of N Polynomial: Zeros All Zero system (FIR system)

Roots of D Polynomial: Poles All Pole system (IIR system)
Equation itself: Pole-Zero System (IIR system)

In Semester Exam - III
Why the problem of aliasing is observed during the sampling process? Derive
the relationship between analog frequency F and DT frequency f.
State the advantages of Digital Signal Processing and give the classification of
DT signals
Define the impulse response of a system and obtain it for a system described as
y(n) = x(n) + 0.5 y(n-1)
Represent a DT sequence x(n) using convolution. Obtain the computational
complexity of linear convolution of two DT signals having N samples each.
State and prove (i) time reversal and (ii) time shifting property of a FT.
State the necessary condition for the existence of FT. Explain how the
magnitude response of a FT is obtained? Obtain DT frequencies {k} for 8-
point DFT.
Obtain 4 point DFT for a sequence x(n)= {1,-2,2,1} and plot the magnitude
spectrum
Discuss the periodicity and circular shifting property of N point DFT. How
convolution property of DFT is different than FT?

Obtain ZT of a DT signal using ZT properties where,
x(n) = 2n.u(n-1)
Derive the relationship between ZT and FT.
Obtain ZT of two standard signals u(n) and (n). Plot its ROCs.
Define a system function H(Z). How it describes the properties of DT system?

What is pole zero plot?

End Sem Exam
State the sampling theorem and explain in brief the coding process of ADC.
Obtain the Z Transform (ZT) of a DT signal -

Sketch the ROC.
Obtain -Number of samples per cycle, Digital/Discrete frequency f and ,
Minimum sampling rate to avoid aliasing effect, Period of a DT signal
State and prove the time shifting property of Fourier Transform (FT). Define it
for DFT.
Compare Linear Convolution with Circular Convolution
Define N point DFT by means of twiddle factor and obtain the twiddle factors
for 4 point DFT.
Obtain the computational complexity of Radix-2 DIF FFT Algorithm

Define the system function and obtain it for the given system described as

State the mathematical models used to represent a DT system. Define the
Impulse response of the system.
State the necessary condition for the existence of Fourier Transform. State and
prove the convolution property of FT
State the following properties of DT system and describe it by means of
difference equation:
1) Time Invariant 2) Dynamicity 3) Causality
Draw a pole zero plot for a system described as -
Draw the basic butterfly structures for DIT and DIF FFT algorithms and hence
obtain the computational complexity of FFT algorithm
Use ZT properties to obtain ZT of a DT sequence
What is convolution property of DFT? Compare Linear Convolution with


Sampling theorem statement. Coding process: representing DT
sample by n-bit sequence L: Quantization levels
Sketch the ROC.

Number of samples per cycle N = 1200/50 = 24
Digital/Discrete frequency f and : f = 1/N = 1/24 cycles/samples
= 2f = /12 rad/samples, Minimum sampling rate Fs = 2 F = 2 x 50 = 100 Hz
Period of a DT signal N = 1/f = 24 samples/cycles
Time Shifting property of Fourier Transform (FT):
, Proof
Time Shifting property of DFT (Circular time shifting)
Linear Convolution with Circular Convolution comparison
N point DFT by means of twiddle factor:
Twiddle factors for 4 point DFT


Mathematical models used to represent a DT system:
Impulse Response, System function, convolution, difference equation
Impulse response of the system
Dirichlets condition for the existence of Fourier Transform

convolution property of FT, Proof
Properties of DT system and example of difference equation
Obtain H(Z) and draw a pole zero plot for a system
Basic butterfly structures for DIT and DIF FFT algorithms (2 point DFT)
obtain the computational complexity of FFT algorithm from the same
Use ZT properties to get
Convolution property of DFT: CC results into multiplication of DFTS

Compare Linear Convolution with Circular Convolution

References
Proakis and Manolakis , Digital signal Processing, Principles,
Algorithms and Applications, Pearson Prentice Hall, 4th Ed.
Sanjit K. Mitra , Digital signal Processing : A computer based approach,
3rd Ed. TMH
Steven W. Smith , The Scientist and Engineer's Guide to Digital Signal
Processing , California Technical Publishing, 2nd Edition
Oppenheium A., Schafer R., and Buck J., Discrete time signal
processing, 2nd Edition, Prentice Hall, 2003, ISBN-81-7808-244-6
A. Nagar Kani , Digital signal Processing, McGraw Hill, Second Edition
Ifeachor and Jervis, Digital signal Processing : A practical approach,
Pearson Education, 2002
Poornachandra and Sasikala, Digital signal Processing , McGraw Hill,
Third Edition

Schuler C. and Chugani M, Digital Signal Processing- A
hands on Approach,Tata McGraw-Hill, ISBN 0-07-058966-6
Babu R., Digital Signal Processing, 2nd Edition, Scitech
Publications, ISBN SI-873- 2852-5
Vallavraj A., Digital Signal Processing, Tata McGraw-Hill
Education, 2001 , ISBN 0-07-463996-X
White S., Digital Signal Processing, Thomson Learning,
ISBN -981 -240-620-4
Lyon Richard, Understanding DSP, 3d Edition, PHI
Gonzalez and Woods, Digital Image Processing, McGraw
Hill, Second Edition
S. D. Apate , Speech and Audio Processing,Willey India,
ISBN 978-81-265-3408-1

Thank You

DSP1 Raisoni

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

DSP1 Raisoni

Transféré par

Droits d'auteur :

Formats disponibles

Prof. D.B.

June 20, 2017 Digital Signal Processing Applications 1

June 20, 2017 Digital Signal Processing Applications 2

June 20, 2017 Digital Signal Processing Applications 5

June 20, 2017 Digital Signal Processing Applications 6

June 20, 2017 Digital Signal Processing Applications 7

Any arbitrary DT sequence can be represented by means of

e.g. x(n) = {1, -2, 3, 2, -1}

June 20, 2017 Digital Signal Processing Applications 8

= x(n) * (n) Convolution form

Also, (n) = u(n) u(n-1)

June 20, 2017 Digital Signal Processing Applications 9

June 20, 2017 Digital Signal Processing Applications 10

x(n) Discrete time y(n)

June 20, 2017 Digital Signal Processing Applications 11

June 20, 2017 Digital Signal Processing Applications 12

System Function: H(), H(Z)

June 20, 2017 Digital Signal Processing Applications 13

June 20, 2017 Digital Signal Processing Applications 14

x(n) =(n) LTI y(n) =h(n)

x(n) = u(n) LTI y(n) = s(n)

June 20, 2017 Digital Signal Processing Applications 15

where, h1 (n) : Inverse system

June 20, 2017 Digital Signal Processing Applications 16

y[n] 1x[n] 2 x[n 1] 3 x[n 2] 4 x[n 3]

June 20, 2017 Digital Signal Processing Applications 17

Non-recursive system : FIR system

June 20, 2017 Digital Signal Processing Applications 18

June 20, 2017 Digital Signal Processing Applications 19

x[n] h[n] y[n]

Any arbitrary input sequence x[n] can be expressed as a

June 20, 2017 Digital Signal Processing Applications 20

June 20, 2017 Digital Signal Processing Applications 21

y[n] = x[n] * h[n]

June 20, 2017 Digital Signal Processing Applications 22

gives, y(n) = x(n) + y(n-1) (1)

gives, y(n) = x(n) + y(n-1) (2)

June 20, 2017 Digital Signal Processing Applications 23

June 20, 2017 Digital Signal Processing Applications 24

xa (t ) ADC DSP DAC ya (t )

Equivalent Analog Signal Processor

June 20, 2017 Digital Signal Processing Applications 25

June 20, 2017 Digital Signal Processing Applications 26

Aliasing: Identical sampling

Time domain and frequency domain aliasing

June 20, 2017 Digital Signal Processing Applications 28

June 20, 2017 Digital Signal Processing Applications 29

June 20, 2017 Digital Signal Processing Applications 30

June 20, 2017 Digital Signal Processing Applications 31

Can we compute different N point DFTs for the same DT

June 20, 2017 Digital Signal Processing Applications 32

June 20, 2017 Digital Signal Processing Applications 33

e.g. If, Fs = 4 K Samples/s, N = 8

June 20, 2017 Digital Signal Processing Applications 34

June 20, 2017 Digital Signal Processing Applications 35

June 20, 2017 Digital Signal Processing Applications 36

June 20, 2017 Digital Signal Processing Applications 37

June 20, 2017 Digital Signal Processing Applications 38

June 20, 2017 Digital Signal Processing Applications 39

State and prove the convolution property of Fourier Transform (FT).

June 20, 2017 Digital Signal Processing Applications 40

Obtain ZT of unit step signal u(n) and Plot its ROC.

Derive the relationship between ZT and FT.