Professional Documents
Culture Documents
Backgrounds1
Classification of Signals
Multi-channel and Multi-dimensional Signals Continuous-Time versus Discrete-Time Signals Continuous-Valued versus Discrete-Valued Signals
Concepts of Frequency
Physical Interpretation of Signal Frequency Continuous-Time Sinusoidal Signals Discrete-Time Sinusoidal Signals
Backgrounds2
Definition Basic Elements of DSP Advantages of Digital over Analog Signal Processing
Definition
Signals
Any physical quantity that varies with time, space or any other independent variable. Communication beween humans and machines.
Backgrounds3
Systems
mathematically a transformation or an operator that maps an input signal into an output signal. can be either hardware or software. such operations are usually referred as signal processing.
Backgrounds4
D/A Converter
Converts a sequence of digits into an analog signal
Backgrounds5
Backgrounds6
Signals may be generated by multiple sources or multiple sensors. Such signals are multi-channel signals. A signal which is a function of M independent variables is called multidimensional signals.
Examples
A picture is a two-dimensional signal
I(x,y) is a function of two variables.
Backgrounds7
Backgrounds8
Backgrounds9
Backgrounds10
Backgrounds11
An Observation
Fourier Transform
Frequency-Domain Representation
NCTU/CSIE/DSP LAB Audio Processing Group
Backgrounds12
Signal can be represented either through time- or frequency-domain. Frequency-domain representation of signals provides another viewpoint benefitial to signal analysis, human sensitivity, system design, and phenomenon interpretation. Frequency Transform: the tool to decompose a timedomain signal into frequency components. The "frequency" can be considered as the varying rate of the signal f(x) in x-domain.
f(t)
f(F) Time
Spectrum Frequency
Backgrounds13
-*<t<*
A is the amplitude of the sinusoid
is the frequency in radians per second
Time
Backgrounds15
Continuous-time sinusoidal signals with distinct frequencies are themselves distinct Increasing the frequency F results in an increase in the rate of oscillation
Backgrounds16
Backgrounds17
X(n) = A cos( n+ )
Discrete-time sinusoidal signals where frequencies are separated by an integer multiple of 2 are identical
X1(n) = A cos( 0 n) X2(n) = A cos( (0 +2) n)
The highest rate of oscillation in a discrete-time sinusoidal is attained when = or (=-), or equivalently f=1/2.
X(n) = A cos(( 0+)n) = -A cos((0+)n
Backgrounds18
Backgrounds19
Sampling Frequency Fs
Sampler Sampler
{3, 5, 4, 6 ...}
Interpolator Interpolator
Backgrounds20
Backgrounds21
Quantizer
Converts a discrete-time continuous-valued signal into a discrete-time, discrete-valued signal
Sampler Sampler
Fc
Fs
t
Backgrounds22
Smoothing Filter
Deletes the frequency components above a threshold frequency to avoid the image signal.
t t
{3, 5, 4, 6 ...}
t
Interpolator Interpolator
Backgrounds23
Sampling Frequency Fs
Sampler Sampler
t t
{3, 5, 4, 6 ...}
Interpolator Interpolator
Backgrounds24
The conversion of a continuous-time signal into a discrete-time signal obtained by taking "samples" of the continuous-time signal at discrete-time instants Xa(nT) = X(n) where T is the sampling interval
f = F/Fs or = T
f
X(n) = A cos( n+ )
Continuous-Time Frequency -<F< -*<< Discrete-Time Frequency - 1/2 < f < 1/2 -<< Relation and Restriction - Fs/2 < F < Fs/2 - Fs < < Fs
Many-to-one Mapping Fk = F0 + kFs are indistinguishable from the frequency F0 after resampling and hence they are aliased of F0.
Backgrounds28
sin 2 Bt g(t ) = 2 Bt
n Xa ( n / Fs ) g( t ) x a (t ) = n Fs =
where Xa(n/Fs) = Xa(nT) = X(n) are the sample of Xa(t)
Backgrounds29
Cauchy, French, 1841 Functions could be nonuniformly sampled and averaged over a long period. Whittaker, Scottish, 1915 A bandlimited function can be completely reconstructed from samples. (first mathematical proof of a general sampling theorem) K. Ogura, Japanese, 1920 If a function is sampled at a frequency at least twice the highest function frequency, the samples contain all the information in the function, and can reconstruct the function. Carson, American, 1920 Unpublished proof that related the same result to communication.
Backgrounds30
Nyquist, Sweden, 1928 For complete signal reconstruction, the required frequency bandwidth is proportional to the signalling speed. The minimum bandwidth is equal to half the number of code elements per second. Expressed the theorem in terms that are familiar to communication engineers. Kotelnikov, Russian, 1933 A proof of sampling theorem Shannon, American, 1949 Unified many aspects of sampling and founded the larger science of information theory.
Backgrounds31
-Fs -Fs/2
Backgrounds32
Purpose: Delete the frequency components that will be aliased to low frequency components.
Fc
2.4 Quantization
z Quantization
Express each sample value as a finite number of digits.
Backgrounds33
Output of Sampler
z Quantization Error
The error introduced in representing the continuous-value signal by a discrete value levels. Output of Quantization
Backgrounds34
S rms =
Q 2 b 1
21 / 2
1 = Q
e 2de
1/ 2
Q 2 = 12
1/ 2
Q
( 12 )1 / 2
Backgrounds35
Dither
Decorrelates the errors from the signals. Allows the digital system to encode amplitude smaller than the LSB.
Backgrounds36
Rectangular pdf
Contributes to Q2/12
Triangular pdf
Contributes to Q2/6
Backgrounds37
Optimal Interpolator
2.5 Interpolator
Optimal Interpolator:
from Sampling Theorems
Zero-order Interpolator
Backgrounds38
First-order Interpolator
no distortion for the frequency components below Fs/2 no frequency components above Fs/2 exist and smoothing filtering is not necessary
n Xa (n / Fs)g(t ) xa (t ) = n Fs =
Suboptimal Interpolator
Signal Mangitude Spectrum F Fs 2Fs
distortion exists for the frequency components below Fs/2 result in passing frequencies above the folding frequency and smoothing filtering is necessary
NCTU/CSIE/DSP LAB Audio Processing Group
Backgrounds39
Delete the frequency components above a threshold frequency to avoid the image signal introduced by suboptimal filters
Low-pass filtering 1 Low-Pass Filter Smoothing Smoothing Filter Filter
t t
Fc'
2Fs
Fs
2Fs
Backgrounds40
Backgrounds41
Sampling Frequency Fs
Sampler Sampler
{3, 5, 4, 6 ...}
Interpolator Interpolator
Experiment 1
WinAmp Architectures
Backgrounds42
Describe the functionality of Input Plugin, Output Plugin, DSP Plugin, and VIS Plugin.
Find the Input Plugin for Wave File. Change the decoded results for Stereo Channels as
Experiment 2
Sampling Rates Change Problem.
Backgrounds43
1. Change the sampling rates from 44.1kHz to 22.05 kHz by eliminate the odd samples of stereo channels. L[n] = L[2n] R[n] = R[2n] Listen to the resulted music and describe the artifacts. Compare the spectrum through COOL editor to find the spectrum artifact. 2. Change again the sampling rates from 44.1 kHz to 11.025 kHz by three samples every four samples. L[n] = L[4n] R[n] = R[4n] Listen to the resulted music and describe the artifacts. Compare the spectrum through COOL editor to find the spectrum artifact.
Experiments
Analog Input Signal
Cut-off Frequency Fc Antialiasing Antialiasing Filte r Filter
t 0
Backgrounds44
Sampling Frequency Fs
Sampler Sampler
Interpolator Interpolator
t
Fc=Fc' and is below 1.5 k ==> Lowpass filtering effects Fc > Fs/2 ==> Aliasing effects Quantization effects Fs' > Fs or Fs' < Fs ==> Frequency mismatching Fc' > Fs/2 ==> Image effects
1. Blind Deconvolution for the first music 2. Piano Music a. Original One b. Low-pass One c. Image Distortation (too many high frequency) d. Aliasing effects Quantization Noise is independent of the Original Signals ?