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
Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
Advertisements

Review of Frequency Domain
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.
Chapter 8: The Discrete Fourier Transform
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Mathematical Description of Continuous-Time Signals
Difference Equations Linear Systems and Signals Lecture 9 Spring 2008.
Signals and Systems Discrete Time Fourier Series.
The Discrete Fourier Series
Algebra 2-1 Rational Numbers on a Number Line
Analysis of Discrete Linear Time Invariant Systems
Digital Signals and Systems
Discrete-Time and System (A Review)
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
Sequences & Summations CS 1050 Rosen 3.2. Sequence A sequence is a discrete structure used to represent an ordered list. A sequence is a function from.
Notes Over 11.4 Infinite Geometric Sequences
DISCRETE-TIME SIGNALS and SYSTEMS
Fourier Series Summary (From Salivahanan et al, 2002)
Signal Operations. 2 Basic Operation of the Signals. Basic Operation of the Signals Time Shifting Reflection and Folding Time Scaling.
Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
BYST CPE200 - W2003: LTI System 79 CPE200 Signals and Systems Chapter 2: Linear Time-Invariant Systems.
Chapter 6: Sampled Data Systems and the z-Transform 1.
Linear Time-Invariant Systems
Chapter 5 Finite-Length Discrete Transform
Hossein Sameti Department of Computer Engineering Sharif University of Technology.
Department of Electrical and Computer Engineering Brian M. McCarthy Department of Electrical & Computer Engineering Villanova University ECE8231 Digital.
Chapter 8 Basic Algebra. Sets The Intersection of two sets X and Y is the set of elements common to X and Y. An element has to be in both sets to be in.
Dan Ellis 1 ELEN E4810: Digital Signal Processing Topic 3: Fourier domain 1.The Fourier domain 2.Discrete-Time Fourier Transform (DTFT) 3.Discrete.
8.3 Geometric Sequences and Series Objectives: -Students will recognize, write, and find the nth terms of geometric sequences. -Students will find the.
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
CHAPTER 2 Discrete-Time Signals and Systems in the Time-Domain
INTRODUCTION TO SIGNALS
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 DISCRETE SIGNALS AND SYSTEMS.
Signal and System I The representation of discrete-time signals in terms of impulse Example.
Discrete-time Signals Prof. Siripong Potisuk. Mathematical Representation x[n] represents a DT signal, i.e., a sequence of numbers defined only at integer.
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
Lecture#15 Discrete Mathematics. Summation Computing Summation Let a 0 = 2, a 1 = 3, a 2 = -2, a 3 = 1 and a 4 = 0. Compute each of the summations: =
Copyright © 2012, 2009, 2005, 2002 Pearson Education, Inc. Chapter 3 Decimals.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
3/18/20161 Linear Time Invariant Systems Definitions A linear system may be defined as one which obeys the Principle of Superposition, which may be stated.
Chapter 2. Signals and Linear Systems
Lecture 14: Generalized Linear Phase Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin Lecture 3
8.1 – Sequences and Series. Sequences Infinite sequence = a function whose domain is the set of positive integers a 1, a 2, …, a n are the terms of the.
الفريق الأكاديمي لجنة الهندسة الكهربائية 1 Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can.
Discrete Time Signal Processing Chu-Song Chen (陳祝嵩) Institute of Information Science Academia Sinica 中央研究院 資訊科學研究所.
CHAPTER 5 Z-Transform. EKT 230.
DIGITAL SIGNAL PROCESSING ELECTRONICS
CE Digital Signal Processing Fall Discrete-time Fourier Transform
CEN352 Dr. Nassim Ammour King Saud University
Linear Constant-coefficient Difference Equations
Linear Time Invariant Systems
Chapter 1. -Signals and Systems
The Discrete Fourier Transform
Changing the Sampling Rate
Discrete-Time Signals: Sequences
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
UNIT V Linear Time Invariant Discrete-Time Systems
Chapter 8 The Discrete Fourier Transform
UNIT-I SIGNALS & SYSTEMS.
Sampling the Fourier Transform
CS3291: "Interrogation Surprise" on Section /10/04
Discrete-Time Signal Description
Chapter 8 The Discrete Fourier Transform
Chapter 9 Advanced Topics in DSP
Chapter 8 The Discrete Fourier Transform
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.

Periodicity for discrete signal The period of discrete signal is measuredas 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]={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]=[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}.

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-0.5] assuming linear interpolation. 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]

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

Properties of the discrete impulses Signal representation by impulses Examples

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