Reference Solution of DSP Test 2

Slides:



Advertisements
Similar presentations
Sampling and Pulse Code Modulation
Advertisements

ECE 4371, Fall, 2014 Introduction to Telecommunication Engineering/Telecommunication Laboratory Zhu Han Department of Electrical and Computer Engineering.
Nonrecursive Digital Filters
EE513 Audio Signals and Systems Digital Signal Processing (Synthesis) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Sampling and quantization Seminary 2. Problem 2.1 Typical errors in reconstruction: Leaking and aliasing We have a transmission system with f s =8 kHz.
OPTIMUM FILTERING.
CEN352, Dr. Ghulam Muhammad King Saud University
EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained.
Implementation of Basic Digital Filter Structures R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
IIR Filters and Equalizers R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
Frequency Response of Discrete-time LTI Systems Prof. Siripong Potisuk.
SAMPLING & ALIASING. OVERVIEW Periodic sampling, the process of representing a continuous signal with a sequence of discrete data values, pervades the.
AGC DSP AGC DSP Professor A G Constantinides 1 Digital Filter Specifications Only the magnitude approximation problem Four basic types of ideal filters.
Department of Electrical & Computer Engineering 1 ES585a - Computer Based Power System Protection Course by Dr.T.S.Sidhu - Fall 2005 Class discussion presentation.
Over-Sampling and Multi-Rate DSP Systems
Random Processes and LSI Systems What happedns when a random signal is processed by an LSI system? This is illustrated below, where x(n) and y(n) are random.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Dr Martin Hendry, Dept of Physics and Astronomy University of Glasgow, UK Astronomical Data Analysis I 11 lectures, beginning autumn 2008.
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
Computer Based Data Acquisition Basics. Outline Basics of data acquisition Analog to Digital Conversion –Quantization –Aliasing.
Sampling Theorems. Periodic Sampling Most signals are continuous in time. Example: voice, music, images ADC and DAC is needed to convert from continuous-time.
6.2 - The power Spectrum of a Digital PAM Signal A digtal PAM signal at the input to a communication channl scale factor (where 2d is the “Euclidean.
Digital Signal Processing
System Function of discrete-time systems
ECE 4710: Lecture #6 1 Bandlimited Signals  Bandlimited waveforms have non-zero spectral components only within a finite frequency range  Waveform is.
1 Z-Transform. CHAPTER 5 School of Electrical System Engineering, UniMAP School of Electrical System Engineering, UniMAP NORSHAFINASH BT SAUDIN
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Definitions Random Signal Analysis (Review) Discrete Random Signals Random.
1 Digital Signal Processing Lecture 3 – 4 By Dileep kumar
Lecture#10 Spectrum Estimation
Subband Coding Jennie Abraham 07/23/2009. Overview Previously, different compression schemes were looked into – (i)Vector Quantization Scheme (ii)Differential.
Professor A G Constantinides 1 Finite Wordlength Effects Finite register lengths and A/D converters cause errors in:- (i) Input quantisation. (ii)Coefficient.
Z Transform The z-transform of a digital signal x[n] is defined as:
Discrete-time Random Signals
EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
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.
Sub-Band Coding Multimedia Systems and Standards S2 IF Telkom University.
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Oct, 98EE421, Lecture 81 Lecture 8: Z-Transforms l ROC and Causality |z|
Learning from the Past, Looking to the Future James R. (Jim) Beaty, PhD - NASA Langley Research Center Vehicle Analysis Branch, Systems Analysis & Concepts.
ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ (22Δ802) Β΄ ΕΞΑΜΗΝΟ Καθηγητής Πέτρος Π. Γρουμπός  Ώρες Γραφείου: Τετάρτη Πέμπτη Παρασκευή 11:00- 12:00 Γραφείο: 1.
Digital Signal Processing
Chapter 2 Ideal Sampling and Nyquist Theorem
Adv DSP Spring-2015 Lecture#11 Spectrum Estimation Parametric Methods.
Real-time Digital Signal Processing Digital Filters.
Relationship between Magnitude and Phase Quote of the Day Experience is the name everyone gives to their mistakes. Oscar Wilde Content and Figures are.
Lecture 1.4. Sampling. Kotelnikov-Nyquist Theorem.
Chapter 4 Discrete-Time Signals and transform
Multirate Signal Processing* Tutorial using MATLAB**
CHAPTER 5 Z-Transform. EKT 230.
Chapter4. Sampling of Continuous-Time Signals
Figure 7.1 (p. 554) Real and imaginary parts of the signal zn.
Sampling and Aliasing Prof. Brian L. Evans
Chapter 8 Mohamed Bingabr
Chapter 3 Sampling.
SAMPLING & ALIASING.
Sampling and Quantization
Sampling rate conversion by a rational factor
EE Audio Signals and Systems
Signal conditioning.
Chapter 2 Signal Sampling and Quantization
لجنة الهندسة الكهربائية
لجنة الهندسة الكهربائية
CS3291: "Interrogation Surprise" on Section /10/04
Chapter 2 Ideal Sampling and Nyquist Theorem
Finite Wordlength Effects
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
Quadrature-Mirror Filter Bank
Analog to Digital Encoding
CEN352, Dr. Ghulam Muhammad King Saud University
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
Chapter 9 Advanced Topics in DSP
Presentation transcript:

Reference Solution of DSP Test 2 2005

Problem 1

Problem 1 - Solution (a) The Nyquist rate is 2 times the highest frequency. → T=1/(5kHz x 2) = 1/10000 sec. (b)

Problem 2

Problem 2 - Solution The output xr[n] = x[n] if no aliasing occurs as result of downsampling. That is, X(ejw) = 0 for pi/3 ≦|w|≦pi. (a) X(ejw) has impulses at w = ± pi/4, so there is no aliasing. xr[n] = x[n]. (b) X(ejw) has impulses at w = ± pi/2, so there is aliasing. xr[n] ≠ x[n].

Problem 3

Problem 3 - Solution (a) A random process that satisfies: 1) its mean is constant. 2) its autocovariance is a function that depends only on the distance in placement. (b) A random process for which time averages equal ensemble averages. (c) A function that describes the average power of a signal over a particular frequency band. (d) A random process with a flat power spectral density. (e) A bit reduction technique to minimize quantization error.

Problem 4

Problem 4 – Solution (1/2) Observation 1: The goal of the system is to sample y[n] every M data points. Apply H(z) only on the 1/M signal portions will effectively reduce the needed computational operations. Observation 2: The two systems below are equivalent. H(z) ↓M x[n] y[n] w[n] = y[nM] H(z) ↓M x[n] y[n] w[n] ↓M H(z) x[n] y’ [n] w’ [n]

Problem 4 – Solution (2/2) + + answer original Z0(zM) ↓M Z1(zM) ZM+1(zM) + x[n] y[n] z-1 Z0(zM) ↓M Z1(zM) ZM+1(zM) + x[n] y[n] z-1 answer original

Problem 5

Problem 5 - Solution (a) Yes. The poles z = ±j(0.9) are inside the unit circle so the system is stable. (b) minimum phase poles & zeros outside unit circle

Problem 6

Problem 6 - Solution x[n] y[n] z-1 1/2 5/6 z-1 1/2 1/6