Problem 1. (26 pts) For each of the statement below, mark whether it is True (T) or False (F).
You do not need to explain your reasoning.
1. The discrete-time Fourier transform (DTFT) of a discrete-ti
THE UNIVERSITY OF UTAH
DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING
ECE 3500: FUNDAMENTALS OF SIGNALS AND SYSTEMS
SOLUTIONS TO PRACTICE PROBLEMS FOR FINAL EXAM FALL 2010
These are cut and pasted
UNIVERSITY OF UTAH
DEPARTMENT OF ELECTRICAL & COMPUTER ENGINIEERING
ECE 3500
FUNDAMENTALS OF SIGNALS AND SYSTEMS September 2, 2010
Pre-Lab Assignment # 1
Due: September 10, 2010, 5:00 p.m.
The objecti
[25 points]
1.
Consider a complex-valued signal xa(t)with
continuous-time Fourier transform as
shown in the figure. What is the minimum sampling frequency you need such that
the original signal can be
UNIVERSITY OF UTAH
DEPARTMENT OF ELECTRICAL & COMPUTER ENGINIEERING
ECE 3500
FUNDAMENTALS OF SIGNALS AND SYSTEMS September 16, 2010
HOMEWORK #4
Due: 12:20 P.M. on September 23, 2010
1. Consider a disc
UNIVERSITY OF UTAH
DEPARTMENT OF ELECTRICAL & COMPUTER ENGINIEERING
ECE 3500
FUNDAMENTALS OF SIGNALS AND SYSTEMS August 24, 2010
HOMEWORK #1
Due: 12:00 noon on September 2, 2010
1. (a) Find the partia
UNIVERSITY OF UTAH
DEPARTMENT OF ELECTRICAL & COMPUTER ENGINIEERING
ECE 3500
FUNDAMENTALS OF SIGNALS AND SYSTEMS September 3, 2010
HOMEWORK #2
Due: 12:20 P.M. on September 9, 2010
1. Consider a series
ECE 3500
Title
ECE Class
Name
Lab Section #
TAs Name
Name
Lab #
Title
Date
1
ECE 3500
Title
Name
ABSTRACT
Summarize in approximately 200-250 words the purpose of the lab, methods used,
key findings, a
function [coeff]= polyproduct(noInPoly)
% Computes the product of a set of polynomials and returns the
% coefficients of their product.
%
% noInPoly: Number of input polynomials
coeff=1;
for n=1:noInP