APS审核数字信号处理DigitalSignalProcessing.docx

1、APS审核数字信号处理DigitalSignalProcessingSignalSignal is any variable that carries or contains some kind of information that can be recorder，conveyed，displayed，or manipulatedExample： speech ，sound， music， image ，rader and sonar signalDSPDSP is concerned with：The digital representation of signalThe analysis

2、，modification and extraction of information from these signalsThe purpose of DSPRemove interference and noise（filtering）from signalObtain and analyze the spectrum of a signalTransform the signal into more suitable formatDigital Signal Processing (DSP) is concerned with the representation, transforma

3、tion and manipulation of signals on a computer. Digital Signal Processing begins with a discussion of the analysis and representation of discrete-time signal systems, including discrete-time convolution, difference equations, the z-transform, and the discrete-time Fourier transform. Emphasis is plac

4、ed on the similarities and distinctions between discrete-time. The course proceeds to cover digital network and non-recursive (finite impulse response) digital filters. Digital Signal Processing concludes with digital filter design and a discussion of the fast Fourier transform algorithm for computa

5、tion of the discrete Fourier transform.1.1 Discrete-Time Signals：Time-Domain RepresentationThe arrow is placed under the sample at time index n = 0 1.2 Sampling: A discrete-time sequence xn may be generated by periodically sampling a continuous-time signal at uniform intervals of time.The spacing T

6、between two consecutive samples is called the sampling period. Reciprocal of sampling interval T, denoted as FT, is called the sampling frequency (UNIT: HZ)Sampling theorem (Shannon): X a(t)can be represented uniquely by its sampled version xn if the sampling frequency is chosen to be greater than 2

7、 times the highest frequency contained in X a(t)1.3 Classification of Sequences1.3.1 xn is a real sequence, if the n-th sample xn is real for all values of n. Otherwise, xn is a complex sequenceExample ：is a real sequence; is a complex sequence1.3.2 A single-input, single-output (SISO) discrete-time

8、 system operates on a sequence, called the input sequence, according some prescribed rules and develops another sequence, called the output sequence, with more desirable properties。1.3.4 Basic Operations：AdditionMultiplicationTime-shiftingExample: 1.3.4Total energy of a sequence xn is defined byThe

9、average power of an aperiodic sequence is defined by1.4 Discrete-Time Systems: 1.4.1 Classification Linear Systems Shift-Invariant Systems Causal Systems Stable Systems Passive and Lossless Systems1.4.2 Impulse and Step Responses The response of a discrete-time LTI system to a unit sample sequence d

10、n is called the unit sample response or, simply, the impulse response, and is denoted by hn The response of a discrete-time LTI system to a unit step sequence mn is called the unit step response or, simply, the step response, and is denoted by sn Example - The impulse response of the systemis obtain

11、ed by setting xn = dn resulting inExample - The impulse response of the discrete-time accumulator is obtained by setting xn = dn resulting in1.4.3 Input-Output Relationship A consequence of the linear, time-invariance property is that a discrete-time LTI system is completely characterized by its imp

12、ulse responseExample: Compute its output yn for the input:As the system is linear, we can compute its outputs for each member of the input separately and add the individual outputs to determine yn.Since the system is time-invariantBecause of the linearity property we getHence, the response yn to an

13、inputwill be Convolution Sum1.4.4 FIR and IIRIf the impulse response hn is of finite length, i.e.,then it is known as a finite impulse response (FIR) discrete-time system.If the impulse response is of infinite length, then it is known as an infinite impulse response (IIR) discrete-time systemExample

14、 - The discrete-time accumulator defined byis an IIR system Nonrecursive System - Here the output can be calculated sequentially, knowing only the present and past input samples Recursive System - Here the output computation involves past output samples in addition to the present and past input samp

15、les1.5 Discrete-time Fourier Transform (DTFT)The discrete-time Fourier transform (DTFT) of a sequence xn is given by and are called the magnitude and phase spectra 1.6 Discrete Fourier Transform Using the notation the DFT is usually expressed as: The inverse discrete Fourier transform (IDFT) is given by1.7 Z-Transform1.8 Filter Design