This is a Basic DSP course designed for freshers interested in fundamentals of Digital Signal Processing.
It deals with concepts of DFT leakage, Scalloping loss, FFT, Z transform, DCT, MDCT and various digital filter structures...
This is a basic course, one must read before starting the DSP Course. A very different approach to DSP, lesser taught at UG level. It deals with the concepts of vector space, linear independence, orthogonality and sinusoidal fidelity...
This is a basic course, one must read before starting the DSP Course. A very different approach to DSP, lesser taught at UG level. It deals with the concepts of vector space, linear independence, orthogonality and sinusoidal fidelity...
Optimizing the Graphics Pipeline with Compute, GDC 2016Graham Wihlidal
With further advancement in the current console cycle, new tricks are being learned to squeeze the maximum performance out of the hardware. This talk will present how the compute power of the console and PC GPUs can be used to improve the triangle throughput beyond the limits of the fixed function hardware. The discussed method shows a way to perform efficient "just-in-time" optimization of geometry, and opens the way for per-primitive filtering kernels and procedural geometry processing.
Takeaway:
Attendees will learn how to preprocess geometry on-the-fly per frame to improve rendering performance and efficiency.
Intended Audience:
This presentation is targeting seasoned graphics developers. Experience with DirectX 12 and GCN is recommended, but not required.
COntents:
Signals & Systems, Classification of Continuous and Discrete Time signals, Standard Continuous and Discrete Time Signals
Block Diagram Representation of System, Properties of System
Linear Time Invariant Systems (LTI)
Convolution, Properties of Convolution, Performing Convolution
Differential and Difference Equation Representation of LTI Systems
Fourier Series, Dirichlit Condition, Determination of Fourier Coefficeints, Wave Symmetry, Exponential Form of Fourier Series
Fourier Transform, Discrete Time Fourier Transform
Laplace Transform, Inverse Laplace Transform, Properties of Laplace Transform
Z-Transform, Properties of Z-Transform, Inverse Z- Transform
Text Book
Signal & Systems (2nd Edition) By A. V. Oppenheim, A. S. Willsky & S. H. Nawa
Signal & Systems
By Prentice Hall
Reference Book
Signal & Systems (2nd Edition)
By S. Haykin & B.V. Veen
Signals & Systems
By Smarajit Gosh
Jeff Johnson, Research Engineer, Facebook at MLconf NYCMLconf
Hacking GPUs for Deep Learning: GPUs have revolutionized machine learning in recent years, and have made both massive and deep multi-layer neural networks feasible. However, misunderstandings on why they seem to be winning persist. Many of deep learning’s workloads are in fact “too small” for GPUs, and require significantly different approaches to take full advantage of their power. There are many differences between traditional high-performance computing workloads, long the domain of GPUs, and those used in deep learning. This talk will cover these issues by looking into various quirks of GPUs, how they are exploited (or not) in current model architectures, and how Facebook AI Research is approaching deep learning programming through our recent work.
Optimizing the Graphics Pipeline with Compute, GDC 2016Graham Wihlidal
With further advancement in the current console cycle, new tricks are being learned to squeeze the maximum performance out of the hardware. This talk will present how the compute power of the console and PC GPUs can be used to improve the triangle throughput beyond the limits of the fixed function hardware. The discussed method shows a way to perform efficient "just-in-time" optimization of geometry, and opens the way for per-primitive filtering kernels and procedural geometry processing.
Takeaway:
Attendees will learn how to preprocess geometry on-the-fly per frame to improve rendering performance and efficiency.
Intended Audience:
This presentation is targeting seasoned graphics developers. Experience with DirectX 12 and GCN is recommended, but not required.
COntents:
Signals & Systems, Classification of Continuous and Discrete Time signals, Standard Continuous and Discrete Time Signals
Block Diagram Representation of System, Properties of System
Linear Time Invariant Systems (LTI)
Convolution, Properties of Convolution, Performing Convolution
Differential and Difference Equation Representation of LTI Systems
Fourier Series, Dirichlit Condition, Determination of Fourier Coefficeints, Wave Symmetry, Exponential Form of Fourier Series
Fourier Transform, Discrete Time Fourier Transform
Laplace Transform, Inverse Laplace Transform, Properties of Laplace Transform
Z-Transform, Properties of Z-Transform, Inverse Z- Transform
Text Book
Signal & Systems (2nd Edition) By A. V. Oppenheim, A. S. Willsky & S. H. Nawa
Signal & Systems
By Prentice Hall
Reference Book
Signal & Systems (2nd Edition)
By S. Haykin & B.V. Veen
Signals & Systems
By Smarajit Gosh
Jeff Johnson, Research Engineer, Facebook at MLconf NYCMLconf
Hacking GPUs for Deep Learning: GPUs have revolutionized machine learning in recent years, and have made both massive and deep multi-layer neural networks feasible. However, misunderstandings on why they seem to be winning persist. Many of deep learning’s workloads are in fact “too small” for GPUs, and require significantly different approaches to take full advantage of their power. There are many differences between traditional high-performance computing workloads, long the domain of GPUs, and those used in deep learning. This talk will cover these issues by looking into various quirks of GPUs, how they are exploited (or not) in current model architectures, and how Facebook AI Research is approaching deep learning programming through our recent work.
Digital Signal Processing[ECEG-3171]-Ch1_L06Rediet Moges
This Digital Signal Processing Lecture material is the property of the author (Rediet M.) . It is not for publication,nor is it to be sold or reproduced.
#Africa#Ethiopia
Fortinet Firewall Integration - User to IP Mapping and Distributed Threat Response
oAccurate User ID to IP mapping eliminates potential attacks and provides reliable, out of the box User Information to firewalls
oImproves security by blocking/limiting user access at the point of entry without impacting other users
oMore accurate network mapping for dynamic policy enforcement and reporting
In an industry that’s already defined, Extreme Network’s recent announcement of The Automated Branch is a significant advance in networking. For the first time, all the essential technologies, products, procedures and support are gathered together and integrated. All too often, the piecemeal/piecewise growth strategy typically historically applied in organizational network evolution results in too many tools, procedures, and techniques at work, precluding fast responsiveness, optimal operations staff productivity, and the degree of accuracy and efficiency required to keep end-users productive as well.
Big data analytics Big data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analyticsBig data analytics
Configuring the communication on FlexRay: the case of the static segmentNicolas Navet
N. Navet, M. Grenier, L. Havet, "Configuring the communication on FlexRay: the case of the static segment", Proc. of the 4th European Congress Embedded Real Time Software (ERTS 2008), Toulouse, France, January 29 - February 1, 2008.
Describes Radar Tracking Loops in Range, Doppler and Angles.
For comments please contact me at solo.hermelin@gmail.com.
For more presentations on different subjects visit my website at http://solohermelin.com.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptxEduSkills OECD
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
1. Digital Signal Processing
Fundamentals
DSP Ksharing: Rajesh Sharma
www.rajeshsharma.co.in sharma.rajesh@gmail.com
DSP is Mathematics, Algorithms & Techniques
Applied to Digital Signals on DSP
6. 18/11/2008 6
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Motivation
We cannot take all possible values of t, x(t)
Memory is limited -> countably finite no. of states
Computers:
– Flexibility: Software does the digital signal processing
– Take advantage of the full depth & breadth of processing
tools available for this platform
– Processing performance does not vary with temperature or
time
Reproducibility
– No degradation when copying signal
14. 18/11/2008 14
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Frequency Domain Aliasing (FDA)
Discrete time sinusoids whose frequencies are separated by
an integer multiple of are identical i.e. Aliases
14
re uniqueπ, which a|ω|frequencyusoid withingcorrespond
f aan alias oπ arencying frequeusoids havAll those
<
>
sin
||sin ω
π2
}
therrom each ouishable fIndistinguences aresoidal SeqThese Sinu
knACosn
kff
k
kFFF
k
k
k
Sok
,....2,1..).....()(x...2 k
0
0 ±±=+=
+=
+=
+=
θωπωω
All Spectra are Aliases
Except One
19. 18/11/2008 19
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Sampling Frequency (details)
The way for signal reconstruction is to filter the
signal with the frequency less than half of the
sampling rate.
All aliasing components, except original, are outside this
range, and hence correct signal reconstruction is possible
Sampling Theorem:
An analog signal of bandwidth B can be fully reconstructed
from its samples if Sampling Frequency > 2B
50. 18/11/2008 50
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Discrete Fourier Series (DFS)
N consecutive samples of s[n]N consecutive samples of s[n]
completely describe s in time orcompletely describe s in time or
frequency domains.frequency domains.
DFS generate periodic ck
with same signal period
∑
−
=
⋅=
1N
0k
N
nk2π
j
ekcs[n] ~
Synthesis: finite sum ⇐ band-limited s[n]
Band-limited signal s[n], period = N.
mk,δ
1N
0n
N
-m)n(k2π
j
e
N
1
=
−
=
∑
Kronecker’s delta
Orthogonality in DFS:
synthesis
synthesis
∑
−
=
−
⋅=
1N
0n
N
nk2π
j
es[n]
N
1
kc~
Note:Note: ck+N = ck ⇔⇔⇔⇔ same period N
i.e. time periodicity propagates to frequencies!i.e. time periodicity propagates to frequencies!
DFS defined as:DFS defined as:
~~~~
analysis
analysis
51. 18/11/2008 51
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFS analysis
DFS of periodic discreteDFS of periodic discrete
11--Volt squareVolt square--wavewave
⋅
−
−
±+=
=
otherwise,
N
kπ
sin
N
kLπ
sin
N
N
1)(Lkπ
j
e
2N,...N,0,k,
N
L
kc~
0.6
0 1 2 3 4 5 6 7 8 9 10 k
1
0 2 4 5 6 7 8 9 10 n
θk
-0.4π
0.2
0.24 0.24
0.6 0.6
0.24
1
0.24
-0.2π
0.4π
0.2π
-0.4π
-0.2π
0.4π
0.2π
0.6 ck
~
am
plitude
am
plitude
phase
phase
Discrete signalsDiscrete signals ⇒⇒⇒⇒⇒⇒⇒⇒ periodic frequency spectra.periodic frequency spectra.
Compare to continuous rectangular function
-5 0 1 2 3 4 5 6 7 8 9 10 n
0 L N
s[n]
1
s[n]: period NN, duty factor L/NL/N
54. 18/11/2008 54
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DTFT - Convolution
Digital Linear Time Invariant systemDigital Linear Time Invariant system: obeys superposition principle.
∑
∞
=
⋅−=∗=
0m
h[m]m]x[nh[n]x[n]y[n]x[n] h[n]
ConvolutionConvolution
X(f) H(f) Y(f) = X(f) · H(f)
DIGITAL LTI
SYSTEM
h[n]
x[n] y[n]
h[t] = impulse response
DIGITAL
LTI
SYSTEM
0 n
δ[n]
1
0 n
h[n]
0 f
DTFT(δ[n])
1
56. 18/11/2008 56
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Discrete FT (DFT)
∑
−
=
⋅=
1N
0k
N
nk2π
j
ekcs[n] ~synthesis
synthesis
DFT defined as:DFT defined as:
Note:Note: ck+N = ck ⇔⇔⇔⇔ spectrum has period N
~~~~
∑
−
=
−
⋅=
1N
0n
N
nk2π
j
es[n]
N
1
kc~analysis
analysis
Applies to discrete time and frequency signals.
Same form of DFS but for aperiodic signals:
signal treated as periodic for computational purpose only.
DFT bins located @ analysis frequencies fm
DFT ~ bandpass filters centred @ fm
Frequency resolution
Analysis frequencies fAnalysis frequencies fmm
1N...20,m,
N
fm
f S
m −=
⋅
=
62. 18/11/2008 62
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Time Domain Aliasing
If we take N point DFT, i.e. frequency domain sampling, of
a signal X(n) with periodicity L then x(n) can be recovered
only if N >= L otherwise if N<L then there will be time
domain aliasing.
Another reason of Time Domain aliasing is Filtering in
frequency domain or circular convolution in time domain,
without sufficient zero padding in time domain
62
Under Sampling in any Domain will Cause
Aliasing in another domain
65. 18/11/2008 65
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFT – leakage
Spectral components belonging to frequencies between twoSpectral components belonging to frequencies between two
successive frequency bins propagate to all bins.successive frequency bins propagate to all bins.
LeakageLeakage
Ex: 32-bins DFT of 1 VP sinusoid sampled @ 32kHz. 1 kHz frequency resolution.
(b)
(b) 8.5 kHz sinusoid
(c)(c) 8.75 kHz sinusoid
(a)
(a) 8 kHz sinusoid
* N·Magnitude
*
68. 18/11/2008 68
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Significance of F/Fs: Harmonic Signals
Coherent sampling of harmonically related signals
– Find F, the fundamental frequency of signal
– Sample at Nyquist rate Fs, considering maximum harmonic
– DFT of integer number of cycles only
Significance of f = F/Fs = k/N
For coherent sampling: Take N point DFT
k signifies the number of integer periods of waves
N signifies the number of samples in those periods of waves
For N point DFT
k signifies the bin number of fundamental
N signifies the minimum point DFT to avoid leakage
69. 18/11/2008 69
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFT – leakage notes
1. Affects Real & Imaginary DFT parts magnitude & phase.
2. Has same effect on harmonics as on fundamental frequency.
3. Affects differently harmonically un-related frequency components of
same signal (ex: vibration studies).
4. Leakage depends on the form of the window (so far only rectangular
window).
LeakageLeakage
70. 18/11/2008 70
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFT – Window characteristics
• Finite discrete sequence ⇒⇒⇒⇒⇒⇒⇒⇒ spectrum convoluted with rectangular window spectrum.
• Leakage amount depends on chosen window & on how signal fits into the window.
Resolution: capability to distinguish different tones. Inversely proportional to main-lobe
width. Wish: as high as possible.Wish: as high as possible.
(1)
(1)
Several windows used (Several windows used (applicationapplication--
dependentdependent): Hamming, Hanning,): Hamming, Hanning,
Blackman, Kaiser ...Blackman, Kaiser ...
Rectangular window
Peak-sidelobe level: maximum response outside the main lobe. Determines if
small signals are hidden by nearby stronger ones.
Wish: as low as possible.Wish: as low as possible.
(2)
(2)
Sidelobe roll-off: sidelobe decay
per decade. Trade-off with (2).
(3)
(3)
72. 18/11/2008 72
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFT - Window choice
Window type -3 dB Main-
lobe width
[bins]
-6 dB Main-
lobe width
[bins]
Max sidelobe
level
[dB]
Sidelobe roll-off
[dB/decade]
Rectangular 0.89 1.21 -13.2 20
Hamming 1.3 1.81 - 41.9 20
Hanning 1.44 2 - 31.6 60
Blackman 1.68 2.35 -58 60
Common windows characteristics
NB: Strong DC component can shadow nearby small signals. RemoveNB: Strong DC component can shadow nearby small signals. Remove it!it!
Far & strong interfering components ⇒⇒⇒⇒⇒⇒⇒⇒ high roll-off rate.
Near & strong interfering components ⇒⇒⇒⇒⇒⇒⇒⇒ small max sidelobe level.
Accuracy measure of single tone ⇒⇒⇒⇒⇒⇒⇒⇒ wide main-lobe
Observed signalObserved signal Window wish listWindow wish list
73. 18/11/2008 73
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFT - Window loss remedial
Smooth dataSmooth data--tapering windows cause information loss near edges.tapering windows cause information loss near edges.
• Attenuated inputs get next
window’s full gain & leakage
reduced.
• Usually 50% or 75% overlap
(depends on main lobe width).
Drawback: increased total
processing time.
Solution:
sliding (overlapping) DFTs.
2 x N samples (input signal)
DFT #1
DFT #2
DFT #3
DFT AVERAGING
74. 18/11/2008 74
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
-1
-0.5
0
0.5
1
0 3 6 9 12 15 18 21 24 27 30
time
0
2
4
6
8
0 3 6 9 12bin
Zero padding
Improves DFT frequency inter-sampling spacing (“resolution”).
-1
-0.5
0
0.5
1
0 4 8 12 16
time
0
2
4
6
8
0 1 2 3 4 5 6bin
0
2
4
6
8
0 12 24 36 48bin
-1
-0.5
0
0.5
1
0 10 20 30 40 50 60 70 80 90 100 110 120
time
After padding bins @ frequencies NS = original samples, L = padded.
LN
fm
f
S
S
m
+
⋅
=
75. 18/11/2008 75
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Zero padding -2
• Additional reason for zero-padding: to reach a power-of-two input samples
number (see FFT).
• Zero-padding in frequency domain increases sampling rate in time domain. Note: it
works only if sampling theorem satisfied!
DFT spectral resolutionDFT spectral resolution
Capability to distinguish two closely-
spaced frequencies: not improvednot improved by zero-
padding!.
Frequency inter-sampling spacing:
increasedincreased by zero-padding (DFT
“frequency span” unchanged due to
same sampling frequency)
Apply zero-padding afterafter windowing (if any)! Otherwise
stuffed zeros will partially distort window function.
NOTE
76. 18/11/2008 76
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFT - scalloping loss (SL)
Worst case when f0 falls
exactly midway between 2
successive bins (|r|=½)
SL
bin, k
Note:Note: Non-rectangular windows broaden
DFT main lobe ⇒⇒⇒⇒ SL less severeSL less severe
Correction depends on window used.Correction depends on window used.
f0
Frequency error: εf = r fS/N,
relative error: εR=εf / f0 = r/[(kmax+r)] εR
≤≤≤≤ 1/(1+2 kmax)
kmax
kmax
bin, k
We’re lucky here!
May impact on data
interpretation (wrong f0!)
Input frequency f0 btwn. bin
centres causes magnitude loss
SL = 20 Log10(|cr+kmax /ckmax|)
~~~~
|r| ≤ ½f0 = (kmax + r) fS/N
83. 18/11/2008 83
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
FFT philosophy
General philosophy (to be applied recursively): divide & conquerdivide & conquer.
Σcost(subsub--problemsproblems) + cost(mappingmapping) < cost(original problemoriginal problem)
Different algorithms balance costs differently.
Example: Decimation-in-time algorithm
time frequency
Step 3: Frequency-domain synthesis.
N spectra synthesised into one.
Step 2: 1-point input spectra calculation. (Nothing to
do!)
Step 1: Time-domain decomposition. N-points signal →
N, 1-point signals (interlace decomposition).
Shuffled input data (bit-reversal). log2N
stages.
(*)(*): only first decomposition shown.
(**)
84. 18/11/2008 84
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
FFT family tree
Divide & conquerDivide & conquer
N : GCD(N1,N2) <> 1
Ex: N = 2n
Cost: MAPPINGMAPPING.
• Twiddle-factors calculations.
• Easier sub-problems.
• Some algorithms:
Cooley-Tukey,
Decimation-in-time / in-frequency
Radix-2, Radix-4,
Split radix.
N : GCD(*)(N1,N2) = 1
N1, N2 co-prime. Ex: 240 = 16·3·5
Cost: SUBSUB--PROBLEMSPROBLEMS.
• No twiddle-factors calculations.
• Easier mapping (permutations).
• Some algorithms:
Good-Thomas, Kolba,
Parks, Winograd.
(
*)
GCD= Greatest Common Divisor
85. 18/11/2008 85
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
(Some) FFT concepts
Butterfly: basic FFT calculation element.
s[k+N/2]
s[k]
WN
N/2
WN
0
1. Decimation-in-time ⇒⇒⇒⇒⇒⇒⇒⇒ time data shuffling.
2. Decimation-in-frequency ⇒⇒⇒⇒⇒⇒⇒⇒ frequency data shuffling.
3. In-place computation: no auxiliary storage needed, allowed by most algorithms.
4. DFT pruning: only few bins needed or different from zero ⇒⇒⇒⇒⇒⇒⇒⇒ only they get calculated
(ex: Goertzel algorithm).
5. Real-data case: Mirroring effect in DFT coeffs. ⇒⇒⇒⇒⇒⇒⇒⇒ only half of them calculated.
6. N power-of-two: Many common FFT algorithms work with power-of-two number of
inputs. When they are not ⇒⇒⇒⇒⇒⇒⇒⇒ pad inputs with zeroes.
Dual approach: data to be reordered in
time or in frequency!
86. 18/11/2008 86
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Systems spectral analysis (hints)
System analysis: measure inputSystem analysis: measure input--output relationshipoutput relationship..
DIGITAL LTI
SYSTEM
h[n]
x[n] y[n]
H(f) : LTI transfer functionH(f) : LTI transfer function
∑
∞
=
⋅−=∗=
0m
h[m]m]x[nh[n]x[n]y[n]x[n] h[n]
X(f) H(f) Y(f) = X(f) · H(f)
DIGITAL
LTI
SYSTEM
0 n
δδδδ[n]
1
0 n
h[n]
h[t] = impulse response
Linear Time InvariantLinear Time Invariant
y[n] predicted from { x[n], h[t] }
Transfer function can be estimated by Y(f) / X(f)
87. 18/11/2008 87
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Estimating H(f) (hints)
(f)XX(f)(f)G *
xx ⋅= Power Spectral Density of x[t] (FT
of autocorrelation).
(f)XY(f)(f)G *
yx ⋅= Cross Power Spectrum of x[t] & y[t] (FT
of cross-correlation).
It is a check on
H(f) validity!
(f)G(f)G
(f)G
(f)C
yyxx
2
yx
xy
⋅
=
Coherence function
- values in [0,1]
- assess degree of linear relationship
between x[t] & y[t].
xx
yx
*
*
G
G
(f)XX(f)
(f)XY(f)
X(f)
Y(f)
H(f) =
⋅
⋅
== Transfer Function
(ex: beam !)
88. 18/11/2008 88
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Notes on DFT
The DFT transform is an exact one-to-one transform
The DFT can only approximate the continuous Fourier Transform
The DFT components correspond to N frequencies that are fs/N apart
The DFT of a real-valued signal gives symmetric frequency components
A fast algorithm, the FFT, is available for implementing the DFT
Frequency Resolution of DFT
The frequency resolution of the N-point DFT is
– fr = fs / N
•The DFT can resolve exactly only the frequencies falling exactly at: k * fs/N.
– There is spectral leakage for components falling between the DFT bins
•Zero-padding is often use to provide more resolution in the frequency
components
97. 18/11/2008 97
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
(1) in general
(2) absolutely converges
(3) cannot contain a pole
(4) FIR sequence entire z plane, may be except for 0 or
(5) Right-sided sequence outward of the outermost pole
(6) Left-sided sequence inward from the innermost pole
(7) Two-sided sequence a ring in between two adjacent rings
(8) is a connected region
ROC
ROC
)( jw
eX ROCUC ⊂↔
→
→
→
→
∞
ROC properties
∞≤<<≤ LR rROCr0
111. 18/11/2008 111
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DT LTI Systems
CT LTI systems are described by ODEs
∑∑ ==
+=
M
k
k
k
k
N
k
k
k
k tx
dt
d
bty
dt
d
aty
01
)()()(
DT LTI systems are described by Difference Equations
s
ss
T
nTxTnx
dt
tdx )())1(()( −+
≈ • normalised wrt Ts ][]1[
)(
nxnx
dt
tdx
−+≈
Typical DT LTI system Difference Equations are
∑∑ ==
−+−=
M
k
k
N
k
k knxbknyany
01
][][][
114. 18/11/2008 114
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DT System Response
Cz
za
zb
zX
zY
zH N
k
k
k
M
k
k
k
∈∀
−
==
∑
∑
=
−
=
−
1
0
1
)(
)(
)(
∑∑ ==
−+−=
N
i
i
N
i
i inhainbnh
10
][][][ δ
•z = r.ej2πf are the eigenvectors of the Difference Equation
•The Magnitude of the system response at each z is given by the
•System Transfer Function
•We resolve the i/p sequence x[n] on these eigenvectors z (ZT)
•Find the response at each Z (apply xfer func)
•Sum the responses back to get o/p (IZT)
z3
z1
z2
z4
a1
a2b1
b2
System i/p
System o/p?
b20
b1o
a2o
a1o
119. 18/11/2008 119
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Discrete Cosine Transform
DCT uses Cosines as its basis (N point sequence)
Each Left/Right Boundary can be Even or Odd.
– 2 choices per boundary
Symmetry about a data point or the point halfway between
two data points.
– 2 choices per boundary.
Total of 16 possibilities
Sequences with Even left boundary, form 8 types of DCTs.
Sequences with Odd left boundary, form 8 types of DSTs.
119
121. 18/11/2008 121
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Energy Compaction
The boundary conditions are responsible for the Energy
Compaction Property of the DCT.
Boundaries affect the Rate of Convergence.
Any discontinuity in function reduce the rate of convergence
Which leads to more sinusoids in the function representation
The Rate of Convergence is that
– how fast a sequence converges to its limit point.
Single Principle for Signal Compression
– Smoother the function, the faster will be the convergence
– Lesser the terms required for representing the function
– Higher is the compression achieved
121
123. 18/11/2008 123
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DFT has discontinuties at the boundaries,
– means reduced rate of convergence.
DCTs have smooth boundaries
N point DFT has N bins over a span of Fs
N point DCT has N bins over a span of Fs/2.
The odd left boundary in DST implies a discontinuity
Hence DCT gives better compression than DFT and DST
For non-stationary, high transients signals such as
– percussion sounds in audio
– high frequency components in images
– DCT is not that much efficient
DWT gives better compression for such signals
DCT DST DFT DWT
131. 18/11/2008 131
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Modified DCT: MDCT
The main idea is to create a lapped transform
– To avoid the artifacts arising due to block boundaries
– To obtain a good Energy compression like DCTs.
Artifacts like Ringing, Pre-echo, drop-outs, warbling, metallic
ringing, hissing etc. may arise due to Copression Schemes.
MDCT is employed in MP3, AC3, Ogg Vorbis, AAC, WMA for
audio Compression.
131
133. 18/11/2008 133
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
DCT-IV,MDCT and TDA
For an MDCT of a 2N point sequence (a,b,c,d), where each
block is of size N/2.
– +N/2 phase term in MDCT signifies a shift of N/2 in the input
The MDCT of 2N inputs (a,b,c,d) is exactly equivalent to
DCT-IV of N inputs
The inverse DCT-IV will simply give back the sequence
It is clearly Time Domain Aliasing: TDA
133
),( RR
badc −−−
),( RR
badc −−−
OrderReversedinputbeenhasthat xmeansxR
137. 18/11/2008 137
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
MDCT as Filter Bank
Window is the prototype FIR filter
Different windows can be designed.
The N output coeff. of a single 2N->N point transform
can be assumed to be output of N Sub band filter
banks.
Transform of the continuous 2N data point frames
with N point overlap can be interpreted as convolution
with output decimated by N.
More on this in the next topic.
154. 18/11/2008 154
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Lattice Filter Structure
The lattice filter is extensively used in digital speech
processing and in implementation of adaptive filter.
It is a preferred form of realization over other FIR or
IIR filter structures because in speech analysis and
in speech synthesis the small number of coefficients
allows a large number of formants to be modeled in
real-time.
– All-zeros lattice is the FIR filter representation of the lattice filter.
– The lattice ladder is the IIR filter representation.
161. 18/11/2008 161
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Basic 2nd Order IIR Structures
Direct form I realization
5 Multiply 4 Additions per y(n)
4 registers storing x(n-1), x(n-2),
y(n-1), y(n-2)
Direct form II realization aka BiQuad
5 multiply, 4 additions per y(n)
2 registers storing w(n-1), w(n-2)
b(0)
b(1)
b(2)
x(n)
−a(1)
−a(2)
u(n) y(n) x(n)
−a(1)
−a(2)
w(n) y(n)b(0)
b(1)
b(2)
z-1
z-1
z-1
z-1
z-1
z-1
x(n-1)
x(n-2)
y(n-1)
y(n-2)
w(n-1)
w(n-2)
2
2
1
1
2
2
1
10
1
)( −−
−−
−−
++
=
zaza
zbzbb
zH
162. 18/11/2008 162
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Applications of Biquad Digital Filters
The general comb+biquad structure can be used to implement numerous digital signal
processing functions:
Moving average, differentiater, integrator, leaky-integrator, 1st and 2nd order delay network,
Goertzel network, sliding DFT, real oscillator, quadrature oscillator, comb filter
Bandpass filter, equalizer, real frequency sampling filter, DC bias removal, etc.
z-1
z-1
z-N
y(n)x(n)
c1
a2 b2
b1
b0
a1
a0
Comb 2nd-order recursive network (biquad)
-+
2
2
1
1
2
2
1
10
1
1
)1()( −−
−−
−
−−
++
−=
zaza
zbzbb
zczH N
163. 18/11/2008 163
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Effects of pole-clustering
∑
∑
=
−
=
−
−
= N
k
k
k
M
k
k
k
za
zb
zH
0
0
1
)(
- after quantization
)(ˆ)(
ˆ
ˆ
zHzH
bbbb
aaaa
kkkk
kkkk
→
∆+=→
∆+=→
- sensitivity of (in denominator) on H(z) is larger
than that of :
kaˆ
kbˆ
Change poles changed denominator of H(z) changedka
Coefficient Quantization
Finite Word Length issues:
1) Coefficient Quantization effects
2) Round Off Noise in multiplication
3) Overflow in addition
4) Limit Cycles
164. 18/11/2008 164
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Let ∑ Π=
−
=
−
−=−=
N
k
k
N
k
k
k zpzazP
1
1
1
)1(1)(
kk aa ˆ→ kkkk pppp ∆+=→ ˆ
Then
k
i
pizipizk a
p
p
zP
a
zP
∂
∂
⋅
∂
∂
=
∂
∂
==
)()(
k
i
iik
N
ik
k
k
i
a
p
pppp
∂
∂
⋅−−=− −−
≠
=
−
Π
11
1
)1(
)()1(
1
1
1
1
ki
N
ik
k
kN
i
ik
N
ik
k
k
i
k
i
pp
p
pp
p
a
p
−
=
−
=
∂
∂
ΠΠ
≠
=
−
−
≠
=
+−
Therefore, a small change in could cause a large change in
when is close to , (or when poles are clustered), causing
a large change in H(z) or its frequency spectrum,
Even it can destabilize an IIR filter having pole near unit circle
ka ip
kpip
To reduce the coefficient
quantization effects
higher order filters should
be implemented as cascade
or parallel structures of
second order filter sections
Called Biquads
Moreover pole zero pairing of
each biquad section
can be done to reduce
Output round-off noise power
Harmonics distortion due to
round-off effects in
multiplications can be reduced
by dithering
166. 18/11/2008 166
www.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.inwww.rajeshsharma.co.in
Comparison
Linear Phase design possible
– Constant group delay
Always stable
Robust to quantization errors
– e.g. rounding error
Large number of taps required
– High computational load
Non linear phase
– Delay varies with frequency
Can be unstable
Sensitive to quantization errors
– e.g. limit cycle
– Harmonic distortion
Small number of taps required
– Low computational load
Direct Form-II requires less memory elements
Cascade Form IIR filter structure is one of least sensitive to quantization
Lattice & Parallel Direct Form-II show small sensitivity to coefficient quantization
Cascade and parallel Direct Form-I require minimum intermediate word length
Comparison of various structures
FIR filters IIR filters