Chapter 1 -Discrete Signals A Sampled or discrete time signal x[n] is just an ordered sequence of values corresponding to the index n that embodies the.

Slides:



Advertisements
Similar presentations
Chapter 4 sampling of continous-time signals 4.5 changing the sampling rate using discrete-time processing 4.1 periodic sampling 4.2 discrete-time processing.
Advertisements

Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
CEN352, Dr. Ghulam Muhammad King Saud University
Chapter 1 -Discrete Signals A Sampled or discrete time signal x[n] is just an ordered sequence of values corresponding to the index n that embodies the.
Autumn Analog and Digital Communications Autumn
EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained.
Signals, Fourier Series
Continuous Random Variables and Probability Distributions
SAMPLING & ALIASING. OVERVIEW Periodic sampling, the process of representing a continuous signal with a sequence of discrete data values, pervades the.
First semester King Saud University College of Applied studies and Community Service 1301CT.
Digital Signals and Systems
Frequency Domain Representation of Sinusoids: Continuous Time Consider a sinusoid in continuous time: Frequency Domain Representation: magnitude phase.
FT Representation of DT Signals:
1 Today's lecture −Concept of Aliasing −Spectrum for Discrete Time Domain −Over-Sampling and Under-Sampling −Aliasing −Folding −Ideal Reconstruction −D-to-A.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Discrete-Time and System (A Review)
Fourier Analysis of Systems Ch.5 Kamen and Heck. 5.1 Fourier Analysis of Continuous- Time Systems Consider a linear time-invariant continuous-time system.
DTFT And Fourier Transform
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Chapter 2 Discrete-Time Signals and Systems
Chapter 2: Discrete time signals and systems
Motivation Music as a combination of sounds at different frequencies
Sampling Theorems. Periodic Sampling Most signals are continuous in time. Example: voice, music, images ADC and DAC is needed to convert from continuous-time.
DISCRETE-TIME SIGNALS and SYSTEMS
Fourier Series Summary (From Salivahanan et al, 2002)
Chapter 4 The Frequency Domain of Signals and Systems.
Digital Signal Processing
QBM117 Business Statistics Probability and Probability Distributions Continuous Probability Distributions 1.
1 Prof. Nizamettin AYDIN Advanced Digital Signal Processing.
The Physical Layer Lowest layer in Network Hierarchy. Physical transmission of data. –Various flavors Copper wire, fiber optic, etc... –Physical limits.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
1 Digital Signal Processing Lecture 3 – 4 By Dileep kumar
revision Transfer function. Frequency Response
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 FOURIER TRANSFORMATION.
Digital Signal Processing
INTRODUCTION TO SIGNALS
Discrete-time Signals Prof. Siripong Potisuk. Mathematical Representation x[n] represents a DT signal, i.e., a sequence of numbers defined only at integer.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
Lecture 2 Analog to digital conversion & Basic discrete signals.
Lecture 2 BME452 Biomedical Signal Processing 2013 (copyright Ali Işın, 2013)1 BME452 Biomedical Signal Processing Lecture 2  Discrete Time Signals and.
Chapter 2. READING ASSIGNMENTS This Lecture: Chapter 2, pp Appendix A: Complex Numbers Appendix B: MATLAB or Labview Chapter 1: Introduction.
Chapter 2. Signals and Linear Systems
Digital Signal Processing
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 2 Analog to Digital Conversion University of Khartoum Department of Electrical and Electronic.
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Lectures 5. Basics of Digital Signal Processing
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Chapter4. Sampling of Continuous-Time Signals
CEN352 Dr. Nassim Ammour King Saud University
SIGNALS PROCESSING AND ANALYSIS
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband.
Chapter 3 Sampling.
SAMPLING & ALIASING.
Lecture Signals with limited frequency range
Sampling rate conversion by a rational factor
EE Audio Signals and Systems
Chapter 2 Signal Sampling and Quantization
Lecture 9: Sampling & PAM 1st semester By: Elham Sunbu.
Lecture 10 Digital to Analog (D-to-A) Conversion
MECH 373 Instrumentation and Measurements
Lecture 4 Sampling & Aliasing
Sampling and the Discrete Fourier Transform
UNIT-I SIGNALS & SYSTEMS.
CEN352, Dr. Ghulam Muhammad King Saud University
Chapter 9 Advanced Topics in DSP
Chapter 3 Sampling.
Today's lecture System Implementation Discrete Time signals generation
Lec.6:Discrete Fourier Transform and Signal Spectrum
Sampling and Aliasing.
Presentation transcript:

Chapter 1 -Discrete Signals A Sampled or discrete time signal x[n] is just an ordered sequence of values corresponding to the index n that embodies the time history of the signal A discrete signal is represented by a sequence of values x[n] ={1,2,3,4,5,….} The bar under 3 indicate that 3 is the center the origin where n=0; … denote infinite extant on that side. Discrete signal can be the left sided, right sided causal or anti causal.

Discrete pulse signal -rectangle Rect(n/2N) N-N

Periodicity for discrete signal The period of discrete signal is measured as the number of sample per period. x[n]=x[n±kN] k=0,1,2,3,4,…. The period N is the smallest number of sample s that repeats. N: always an Integer For combination of 2 or 3 or more signals N is the LCM (Least Common Multiple) of individual periods.

Fractional delays : Fractional delay of x[n] requires Interpolation, Shift and decimation each operation involve integers. In general for fractional delay we have the form of x[n-M/N]=x[(Nn-M)/N] we should do the following in order to get the answer of this delay first interpolate by N then delay by M and finally decimate by N. Example : x[n]={ 2,4,6,8 } find y[n]=x[n-0.5] assuming linear interpolation. y[n]=x[(2n-1)/2]. We first interpolate by 2 then shift by 1 and finally decimate by 2. After interpolation we get x[n/2]={2,3,4,5, 6,7,8,4}. Shift by 1 we obtain x2[n]={2,3,4, 5,6,7,8,4}; after decimation we get y[n]=x[(2n-1)/2]={3, 5,7,4};

Common discrete signal Dirac or delta Step function Ramp function r[n]=nu[n]

Step function …………………….. U[n] dirac  [n] Ramp function …………………..

Rect(n/2N) -N N

Tri(n/N) n Discrete Sinc Sinc(n/N)=sin(nπ/N)/ (nπ/N) Discrete Exponential : -N

Periodicity for discrete signal The period of discrete signal is measured as the number of sample per period. x[n]=x[n±kN] k=0,1,2,3,4,…. The period N is the smallest number of sample s that repeats. N: always an Integer For combination of 2 or 3 or more signals N is the LCM (Least Common Multiple) of individual periods.

Signal Measures : Summation of discrete signal discrete Sum Absolute sum Average of D.S Energy of D.S.

Power of periodic signal Operation on discrete Signals Time Shift : Y[n]=x[n-  ] if  >0, delay of the signal by . The signal is shifted toward the right (shift right). If  <0 advance of the signal by  and the shift is toward the left. Folding : y[n]=x[-n]; Example : x[n]=[1,2,3,4]; y[n]= [4,3,2,1]

y[n]=x[-n-  ] could be obtained by 2 methods 1- first make delay by  we get x[n-  ] then fold we get y[n]. 2- first fold x[n] we get x[-n] then shift left by  we get x[-n-  ]. Symmetry of Discrete Signals -Even symmetry: xe[n]=xe[-n] -Odd Symmetry Xo[n]=-xo[-n] X[n]=xe[n]+xo[n] ; xe[n]=0.5x[n]+0.5x[-n] xo[n]=0.5x[n]-0.5x[-n]

Decimation and interpolation of D.S. Decimation by N : Keep every Nth sample, this lead to potential loss of information. Example of decimation by 2: X[n]={1,2,6,4,8} after decimation xd[n]=x[2n]={1,6,8} Interpolation of the D.S. by N: Insert N-1 new values after each sample. The new value may be zero or the previous value or we calculate it using alinear interpolation. Example : x[n]={1,6,8}; using zero interpolation we get xi[n]=x[n/2]=[1,0,6,0,8,0}; by using step interpolation (previous value) we get xi[n]=[1,1,6,6,8,8}; And finally by using linear interpolation we get xi[n]={1,3.5,6,7,8,4}. Ex: linear interpolation by 3 of the following signal : x[n]=[1,7,13] XI[n]=[1,3,5,7,9,11,13,8.6,4.3]

Fractional delays : Fractional delay of x[n] requires Interpolation, Shift and decimation each operation involve integers. In general for fractional delay we have the form of x[n-M/N]=x[(Nn-M)/N] we should do the following in order to get the answer of this delay first interpolate by N then delay by M and finally decimate by N. Example : x[n]={ 2,4,6,8 } find y[n]=x[n-0.5] assuming linear interpolation. y[n]=x[(2n-1)/2]. We first interpolate by 2 then shift by 1 and finally decimate by 2. After interpolation we get x[n/2]={2,3,4,5, 6,7,8,4}. Shift by 1 we obtain x2[n]={2,3,4, 5,6,7,8,4}; after decimation we get y[n]=x[(2n-1)/2]={3, 5,7,4};

Discrete time Harmonic and sinusoids If we sample an analog sinusoid x(t)=cos(2  f 0 t + θ) at interval ts The sampling rate S=1/ts sample/s we obtain the following signal : X[n]=cos(2  f nts + θ ) = cos(2  nf /S + θ ) = cos(2  nF + θ ) ; With f: analog frequency and F : Digital frequency (cycles/sample)  F  (digital radian frequency); Digital frequency is an analog frequency normalized by sampling Rate S. F (cycles/Sample) = f (cycles/second) / S (sample/second) Discrete time (DT) harmonic are not always periodic in time It is periodic if it digital frequency F can be expressed as ratio of integers F=K/N ; the period of the signal is N if K/N does not have common factor.

one period of the DT harmonic is obtained from K period of analog sinusoid. DT harmonics are always periodic in Frequency DT harmonic is always periodic in frequency but not always unique its frequency F and F±M are identical for integer M. F is unique only if it lies in the principal period If F >0.5 the unique frequency is Fa=F-M where M is chosen to unsure

Aliasing and Sampling Theorem How to sample an analog signal without loss of information ? For an analog signal band limited to fmax Hz. The sampling rate S must exceed 2 fmax S=2fmax defines the Nyquist rate; ts=1/2fmax defines the Nyquist interval. For an analog sinusoid : The Nyquist rate correspond to taking 2 samples per period. The Highest frequency cannot exceed half of the sampling or reconstruction rate. Upon sampling or reconstruction all frequencies must be brought into the principal period. Aliasing Occurs if the analog signal is sampled below the Nyquist rate. If S <2fmax, the reconstructed analog signal is aliased to a lower frequency fa. We find fa as fa=f0-MS, where M is the integer that places fa in the principal period :

Reconstruction using different sampling rate Aliased or reconstructed frequencies are always identified by their principal period. Sampling : unique digital frequencies always lies in the principal period Reconstruction at SR : Analog frequencies lie in the principal period The reconstructed frequency is fr=Sr.Fa fr=Sr. fa/S

Random signals Measures for random variable: Variance Example of probability density for random variables Uniform density : Gaussian Density :

Statistical estimation of discrete signal Average : Variance : Signal to Noise Ratio SNR :for a noisy signal x(t)=S(t)+A n(t) S(t): signal; An(t): noise with amplitude A For a noisy signal averaging different realization of the signal reduce the noise and then increase the signal to noise ratio