Sampling, Reconstruction, and Elementary Digital Filters R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.

Slides:



Advertisements
Similar presentations
Design of Digital IIR Filter
Advertisements

Digital filters: Design of FIR filters
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
EE513 Audio Signals and Systems Digital Signal Processing (Synthesis) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
Echo Generation and Simulated Reverberation R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Digital Signal Processing – Chapter 11 Introduction to the Design of Discrete Filters Prof. Yasser Mostafa Kadah
Ideal Filters One of the reasons why we design a filter is to remove disturbances Filter SIGNAL NOISE We discriminate between signal and noise in terms.
Chapter 8: The Discrete Fourier Transform
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems Spring 2005 Shreekanth Mandayam ECE Department Rowan University.
FFT-based filtering and the Short-Time Fourier Transform (STFT) R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Introduction to Fast Fourier Transform (FFT) Algorithms R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2008 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2009 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
Implementation of Basic Digital Filter Structures R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Real Time DSP and the Motorola DSP Chip R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Methods for Tone and Signal Synthesis R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
IIR Filters and Equalizers R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems Spring 2005 Shreekanth Mandayam ECE Department Rowan University.
Nonlinear and Time Variant Signal Processing R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
EEE422 Signals and Systems Laboratory Filters (FIR) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Systems: Definition Filter
Lecture 9 FIR and IIR Filter design using Matlab
Practical Signal Processing Concepts and Algorithms using MATLAB
Discrete-Time Fourier Series
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
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.
Filter Design Techniques
Processor Architecture Needed to handle FFT algoarithm M. Smith.
EE Audio Signals and Systems Digital Signal Processing (Synthesis) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Real time DSP Professors: Eng. Julian S. Bruno Eng. Jerónimo F. Atencio Sr. Lucio Martinez Garbino.
LIST OF EXPERIMENTS USING TMS320C5X Study of various addressing modes of DSP using simple programming examples Sampling of input signal and display Implementation.
Chapter 5 Finite-Length Discrete Transform
Fundamentals of Digital Signal Processing. Fourier Transform of continuous time signals with t in sec and F in Hz (1/sec). Examples:
Digital Signal Processing
Linear filtering based on the DFT
Lecture 21: Fourier Analysis Using the Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan.
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
DEPARTMENTT OF ECE TECHNICAL QUIZ-1 AY Sub Code/Name: EC6502/Principles of digital Signal Processing Topic: Unit 1 & Unit 3 Sem/year: V/III.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: FIR Filters Design of Ideal Lowpass Filters Filter Design Example.
What is filter ? A filter is a circuit that passes certain frequencies and rejects all others. The passband is the range of frequencies allowed through.
Fourier transform.
In summary If x[n] is a finite-length sequence (n  0 only when |n|
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
EEE422 Signals and Systems Laboratory
Speech Signal Processing
Digital Signal Processing Lecture 4 DTFT
FFT-based filtering and the
EE Audio Signals and Systems
2D Fourier transform is separable
Ideal Filters One of the reasons why we design a filter is to remove disturbances Filter SIGNAL NOISE We discriminate between signal and noise in terms.
Chapter 8 The Discrete Fourier Transform
Lecture 16a FIR Filter Design via Windowing
Interpolation and Pulse Shaping
Lecture 17 DFT: Discrete Fourier Transform
LECTURE 18: FOURIER ANALYSIS OF CT SYSTEMS
Chapter 7 Finite Impulse Response(FIR) Filter Design
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Chapter 7 Finite Impulse Response(FIR) Filter Design
Electrical Communication Systems ECE Spring 2019
Presentation transcript:

Sampling, Reconstruction, and Elementary Digital Filters R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher2 Sampling and Reconstruction Need to understand relationship between a continuous-time signal f(t) and a discrete- time (sampled) signal f(kT), where T is the time between samples (T=1/f s )

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher3 Sampling (cont.) After some manipulation, can show:

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher4 Sampling Effects: Frequency Domain X c (j  )  NN -N-N X S (j  )  NN -N-N SS -S-S 2S2S -2  S  SS -S-S 2S2S X S (j  )  S > 2  N  S < 2  N (aliasing) Fourier Transform of continuous function Fourier Transform of sampled function

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher5 Reconstruction Since spectrum of sampled signal consists of baseband spectrum and spectral images shifted at multiples of 2π/T, reconstruction means isolating the baseband image Concept: lowpass filter to pass baseband while removing images X S (j  )  NN -N-N SS -S-S 2S2S -2  S

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher6 Reconstruction (cont.) Multiplication by rectangular pulse in frequency domain (LPF) corresponds to convolution by sinc( ) function in time domain Because sinc( ) is non-causal and of infinite extent, practical reconstruction requires an approximation to the ideal case

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher7 Delay Lines In order to create a frequency-selective function, there must be a delay memory so that the function is able to observe and resolve the frequencies present in the signal Digital filters used tapped delay lines to create the z -1 (delay) terms in the z- transform

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher8 Delay Lines (cont.) Z -1 + h0h0 h1h1 h2h2 h3h3 x[n] x[n-1] y[n] x[n-2] x[n-3]

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher9 Delay Lines (cont.) Delay lines can be implemented easily as a one dimensional array or FIFO in DSP memory Typically use an address register to point to array, then just increment pointer instead of copying data to achieve the delay

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher10 Modulo Buffers DSP supports modulo arithmetic in the address generation unit With modulo buffer, incrementing or decrementing address register “rolls over” automatically at beginning and ending of buffer memory range Modulo buffers are useful for delay stages in filters and other FIFO queue structures

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher11 Modulo Buffers (cont.) Modulo calculations keep address pointer within a fixed range of memory locations Modulo N Buffer Memory N memory locations Base Address Base Address + N -1

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher Modulo Buffers The M registers in the AGU select the modulo size of the buffer –M = $FFFFFF implies no modulo (regular linear addressing) –M = 0 implies bit-reversed addressing (useful in FFT algorithms) –M = ‘modulo’-1 implies address range including ‘modulo’ memory locations (2  modulo  $7FFF)

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher Modulo (cont.) The base address of the modulo buffer must be a power of 2 The base address must either be zero, or a power of 2 that is greater than or equal to the modulo In other words, the base address must be 2 k, where 2 k  modulo, which implies k least significant bits must be zero

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher14 FIR Filter FIR filter coefficients are equal to the unit sample response of the filter Given filter specifications, we need to choose a unit sample response that is “close” to the desired response, yet within the implementation constraints (memory, computational complexity, etc.)

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher15 FIR Filter Design Several FIR design techniques are available Consider the Window method: –Determine ideal response function –If length of ideal function is too long, multiply ideal response by a finite length window function –Note that multiplication by window in time domain means convolution (and smearing) in the frequency domain

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher16 FIR Window Design Concept Lowpass filter: cutoff at 0.2 f s Frequency (fraction of fs) Amplitude (linear scale)

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher17 FIR Design Concept (cont.) Time domain response (Inverse DTFT) Sample Index Amplitude

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher18 FIR Design Concept Window function to limit response length Sample Index Amplitude Hamming window

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher19 FIR Design Concept (cont.) Windowed and shifted (causal) result Amplitude Sample Index

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher20 FIR Design Concept Resulting frequency response of filter Frequency (fraction of fs) Magnitude (dB)

ECEN4002 Spring 2002Delay Lines and Simple Filters R. C. Maher21 Lab Assignment #2 Due at START of class in two weeks Topics: –Sampling and reconstruction (MATLAB) –Program #1: Cycle counting –Program #2: Simple delay line –Program #3: File I/O via Debugger –Program #4: FIR filter, non-real time –Program #5: FIR filter, real time