ece431notesCoverTOC_2007_09_04

Ece431notesCoverTOC_ - Introduction to Discrete-Time Signal Processing Contents John A Gubner September 4 2007 1 Does Sampling Always Lose

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Introduction to Discrete-Time Signal Processing Contents John A. Gubner September 4, 2007 1 Does Sampling Always Lose Information? 1.1 Introduction 1.2 Review of Fourier Analysis 1.2.1 Continuous-Time Periodic Signals 1.2.2 Discrete-Time Aperiodic Signals 1.2.3 Continuous-Time Aperiodic Signals 1.3 The Poisson Summation Formula 1.4 The Sampling Theorem 1.4.1 The Sinc Reconstruction Formula 1.4.2 Aliasing 1.4.3 Filtering Interpretation of Sinc Reconstruction 1.5 Bandlimited Waveforms and Systems Problems 2 Approximation of the DTFT and Discrete Convolution Using the DFT 2.1 The Discrete Fourier Transform (DFT) 2.1.1 Computation of the DFT in M ATLAB 2.1.2 The Geometric Series 2.1.3 Derivation of the IDFT 2.2 Circular Convolution 2.2.1 The Operation Count 2.3 Linear Convolution Using Circular Convolution 2.3.1 The Operation Count 2.4 Application to Inputs of Unspecified Length 2.5 Windowing Techniques Problems 3 Analog Filter Design 3.1 Introduction 3.2 Butterworth Filters 3.3 Chebyshev Filters of the First Kind 3.3.1 The Chebyshev Polynomials 3.3.2 Chebyshev-I Filters 3.4 Chebyshev Filters of the Second Kind Problems Bibliography Index 1 1 2 2 3 3 4 5 6 6 7 8 9 12 12 13 13 14 14 15 15 17 17 17 21 22 22 22 24 24 26 28 29 31 32 i ...
View Full Document

This note was uploaded on 04/15/2008 for the course ECE 431 taught by Professor Gubner during the Spring '08 term at Wisconsin.

Ask a homework question - tutors are online