Download presentation

Presentation is loading. Please wait.

1
DCSP-13 Jianfeng Feng Jianfeng.feng@warwick.ac.uk http://www.dcs.warwick.ac.uk/~feng/dsp.html

2
Applications Power spectrum estimate Compression Spectrogram Image Sampling theorem White noise FFT

3
DFT for spectral estimation One of the uses of the DFT is to estimate the frequency spectrum of a signal. The Fourier transform of a function produces a spectrum from which the original function can be reconstructed by an inverse transform. So it is reversible. (signal processing: transforms, demo)

4
In order to do that, it preserves not only the magnitude of each frequency component, but also its phase. This information can be represented as a 2- dimensional vector or a complex number, or as magnitude and phase (polar coordinates). In graphical representations, often only the magnitude (or squared magnitude) component is shown. This is also referred to as a power spectrum.

5
In particular, given a continuous time signal x(t), the goal is to determine its frequency components by taking a finite set of samples as a vector, (x(0), x(1),…, x(N-1)), and computing its DFT as in the previous section.

6
The fact that we window the signal x(n) (i.e. we take a finite set of data) will have an effect on the frequency spectrum we compute, and we have to be aware of that when we interpret the results of the DFT. This can be seen by defining a window sequence

7
and the DTFT of the windowed signal Now notice that we can relate the right-hand side of the preceding expression to the DFT of the finite sequence x(0), …,x(N-1)

8
To see the effect of the windowing operation on the frequency spectrum, let us examine the case when the signal x(n) is a complex exponential, such as x(n) = exp( j 0 n)

9
N=10, = 0.5

10
Two effects of DFT 1.Lose of resolution 1.Leakage of energy from mainlobe to sidelobes

12
As we have seen, the DFT is the basis of a number of applications, and is one of the most important tools in digital signal processing.

13
clear all close all sampling_rate=100; %Hz omega=20; %signal frequecy Hz N=50000; %total number of samples for i=1:N x_sound(i)=cos(2*pi*omega*i/sampling_rate); %signal x(i)=cos(2*pi*omega*i/sampling_rate)+2*randn(1,1); %signal+noise axis(i)=sampling_rate*i/N; % for psd time(i)=i/sampling_rate; % for time trace end subplot(1,2,1) plot(time,x); %signal + noise, time trace xlabel('time (sec)'); ylabel('signal') subplot(1,2,2) plot(axis,abs(fft(x)).^2,'r'); % power of signal xlabel('Frequency') ylabel('Power') sound(x_sound, sampling_rate); %true signal sound

14
Singnal processing demo: transformation A few words on Matlab periodogram (similar to fft) pwelch (overlapped windows)

15
Algorithm The periodogram for a sequence [ x 1,..., x N ] is given by the following formula: where is in units of radians/sample.

16
Algorithm The periodogram for a sequence [ x 1,..., x N ] is given by the following formula: where is in units of radians/sample. If you define the frequency variable in Hz, the periodogram is defined as: where Fs is the sampling frequency.

17
Fs = 1000; t = 0:1/Fs:.296; x = exp(i*2*pi*200*t)+randn(size(t)); h = spectrum.periodogram; % Create a periodogram spectral estimator. psd(h,x,'Fs',Fs); % Calculates and plots the two-sided PSD.

18
The periodogram is an estimate of the PSD of the signdefined by the sequence [x 1,..., x N ]. If you weight your signal sequence by a window [w 1,..., w N ], then the weighted or modified periodogram is defined as:

19
Fs = 1000; t = 0:1/Fs:.296; x = cos(2*pi*t*200)+randn(size(t)); h = spectrum.welch; % Create a Welch spectral estimator. psd(h,x,'Fs',Fs); % Calculate and plot the PSD.

20
Spectrogram A spectrogram is an image that shows how the power spectrum of a signal varies with time.

22
Time Frequenc y

23
t=0:0.001:20; % 2 secs @ 1kHz sample rate y=chirp(t,100,1,200,'q'); % Start @ 100Hz, cross 200Hz at t=1sec spectrogram(y,128,120,128,1E3); % Display the spectrogram title('Quadratic Chirp: start at 100Hz and cross 200Hz at t=1sec'); sound(y)

24
Compression

25
The use in MP3 is designed to greatly reduce the amount of data required to represent the audio recording and still sound like a faithful reproduction of the original uncompressed audio for most listeners.

26
An MP3 file could result in a file that is about 1/11 th the size of the file created from the original audio source.

27
The compression works by reducing accuracy of certain parts of sound that are deemed beyond the auditory resolution ability of most people.

28
This method is commonly referred to as perceptual coding.

29
The compression works by reducing accuracy of certain parts of sound that are deemed beyond the auditory resolution ability of most people. This method is commonly referred to as perceptual coding. It internally provides a representation of sound within a short-term time/frequency analysis window, by using psychoacoustic models to discard or reduce precision of components less audible to human hearing, and recording the remaining information in an efficient manner.

30
This technique is often presented as relatively conceptually similar to the principles used by JPEG, an image compression format.

31
Image processing

33
Sampling and reconstruction The question we consider here is under what conditions we can completely reconstruct the original signal x(t) from its discretely sampled signal x(n).

35
Power spectrum for white noise Noise is a stochastic process x(t), for time t (discrete or continuous) Most noisy noise should have no memory, which impliese that E x(t)x(t+s) = 0 if s is not zero E x(t)x(t) = 1 or in another words E x(t)x(t+s) = (s)

36
Therefore the psd of the white noise is flat: it has constant power for all frequencies, as confirmed in the previous matlabe example Different from all meaningful signals we encounter

37
Why white noise has a flat power spectrum? Assume that x(n) is white noise which means

Similar presentations

OK

Revision of Chapter IV Three forms of transformations z transform DTFT: a special case of ZT DFT: numerical implementation of DTFT DTFT X(w)= X (z)|Z=exp(jw)

Revision of Chapter IV Three forms of transformations z transform DTFT: a special case of ZT DFT: numerical implementation of DTFT DTFT X(w)= X (z)|Z=exp(jw)

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google