1 of 261

Prepared by�Mr.S. Arun�AP/EEE

19EEPE609 - DIGITAL SIGNAL PROCESSING

2 of 261

UNIT –I�INTRODUCTION

Classification of systems: Continuous, discrete, linear, causal, stability, dynamic, recursive, time variance; classification of signals: continuous and discrete, energy and power; mathematical representation of signals; spectral density; sampling techniques, quantization, quantization error, Nyquist rate, aliasing effect.

3 of 261

4 of 261

5 of 261

6 of 261

7 of 261

8 of 261

9 of 261

10 of 261

11 of 261

12 of 261

13 of 261

14 of 261

15 of 261

16 of 261

17 of 261

18 of 261

19 of 261

20 of 261

21 of 261

22 of 261

23 of 261

24 of 261

25 of 261

26 of 261

27 of 261

28 of 261

29 of 261

30 of 261

31 of 261

32 of 261

33 of 261

34 of 261

35 of 261

UNIT -II�DISCRETE TIME SYSTEM ANALYSIS

Z-transform and its properties, inverse z-transforms; difference equation – Solution by z- transform, application to discrete systems - Stability analysis, frequency response – Convolution – Discrete Time Fourier transform , magnitude and phase representation.

 

36 of 261

37 of 261

38 of 261

39 of 261

40 of 261

41 of 261

42 of 261

43 of 261

44 of 261

45 of 261

46 of 261

47 of 261

48 of 261

49 of 261

50 of 261

51 of 261

52 of 261

53 of 261

54 of 261

55 of 261

56 of 261

57 of 261

58 of 261

59 of 261

60 of 261

61 of 261

62 of 261

63 of 261

64 of 261

65 of 261

66 of 261

67 of 261

68 of 261

69 of 261

70 of 261

71 of 261

72 of 261

73 of 261

74 of 261

75 of 261

76 of 261

77 of 261

78 of 261

79 of 261

80 of 261

81 of 261

82 of 261

83 of 261

84 of 261

85 of 261

86 of 261

87 of 261

88 of 261

89 of 261

90 of 261

91 of 261

92 of 261

93 of 261

94 of 261

95 of 261

96 of 261

UNIT- III�DISCRETE FOURIER TRANSFORM & COMPUTATION

Discrete Fourier Transform- properties, magnitude and phase representation - Computation of DFT using FFT algorithm – DIT &DIF using radix 2 FFT – Butterfly structure.

97 of 261

98 of 261

99 of 261

100 of 261

101 of 261

102 of 261

103 of 261

104 of 261

105 of 261

106 of 261

107 of 261

108 of 261

109 of 261

110 of 261

111 of 261

112 of 261

113 of 261

114 of 261

115 of 261

116 of 261

117 of 261

118 of 261

119 of 261

120 of 261

121 of 261

122 of 261

123 of 261

124 of 261

125 of 261

126 of 261

127 of 261

128 of 261

129 of 261

130 of 261

131 of 261

132 of 261

133 of 261

134 of 261

135 of 261

136 of 261

137 of 261

138 of 261

139 of 261

140 of 261

141 of 261

142 of 261

143 of 261

144 of 261

145 of 261

146 of 261

147 of 261

UNIT IV �DESIGN OF DIGITAL FILTERS

FIR & IIR filter realization – Parallel & cascade forms. FIR design: Windowing Techniques – Need and choice of windows – Linear phase characteristics. Analog filter design – Butterworth and Chebyshev approximations; IIR Filters, digital design using impulse invariant and bilinear transformation Warping, pre warping.

148 of 261

149 of 261

150 of 261

151 of 261

152 of 261

153 of 261

154 of 261

155 of 261

156 of 261

157 of 261

158 of 261

159 of 261

160 of 261

161 of 261

162 of 261

163 of 261

164 of 261

165 of 261

166 of 261

167 of 261

168 of 261

169 of 261

170 of 261

171 of 261

172 of 261

173 of 261

174 of 261

175 of 261

176 of 261

177 of 261

178 of 261

179 of 261

180 of 261

181 of 261

182 of 261

183 of 261

184 of 261

185 of 261

186 of 261

187 of 261

188 of 261

189 of 261

190 of 261

191 of 261

192 of 261

193 of 261

194 of 261

195 of 261

196 of 261

197 of 261

198 of 261

199 of 261

200 of 261

201 of 261

202 of 261

203 of 261

204 of 261

205 of 261

206 of 261

207 of 261

208 of 261

209 of 261

210 of 261

211 of 261

212 of 261

213 of 261

214 of 261

215 of 261

216 of 261

217 of 261

218 of 261

219 of 261

220 of 261

221 of 261

222 of 261

223 of 261

224 of 261

225 of 261

226 of 261

227 of 261

228 of 261

229 of 261

230 of 261

231 of 261

232 of 261

233 of 261

234 of 261

235 of 261

236 of 261

237 of 261

238 of 261

239 of 261

240 of 261

241 of 261

242 of 261

243 of 261

244 of 261

245 of 261

246 of 261

247 of 261

UNIT V�DIGITAL SIGNAL PROCESSORS

Introduction – Architecture – Features – Addressing Formats – Functional modes - Introduction to Commercial DS Processors.

248 of 261

What is a DSP?

A specialized microprocessor for real-time DSP applications

Digital filtering (FIR and IIR)

FFT

Convolution, Matrix Multiplication etc

248

249 of 261

Hardware used in DSP

249

ASIC

FPGA

GPP

DSP

Performance

Very High

High

Medium

Medium High

Flexibility

Very low

High

High

High

Power consumption

Very low

low

Medium

Low Medium

Development Time

Long

Medium

Short

Short

250 of 261

Common DSP features

Harvard architecture

Dedicated single-cycle Multiply-Accumulate (MAC) instruction (hardware MAC units)

Single-Instruction Multiple Data (SIMD) Very Large Instruction Word (VLIW) architecture

Pipelining

Saturation arithmetic

Zero overhead looping

Hardware circular addressing

Cache

DMA

250

251 of 261

Harvard Architecture

Physically separate memories and paths for instruction and data

251

252 of 261

252

253 of 261

Single-Cycle MAC unit

253

Can compute a sum of n-products in n cycles

254 of 261

Single Instruction - Multiple Data (SIMD)

A technique for data-level parallelism by employing a number of processing elements working in parallel

254

255 of 261

Very Long Instruction Word (VLIW)

A technique for instruction-level parallelism by executing instructions without dependencies (known at compile-time) in parallel

Example of a single VLIW instruction:

F=a+b; c=e/g; d=x&y; w=z*h;

255

256 of 261

CISC vs. RISC vs. VLIW

256

257 of 261

Pipelining

DSPs commonly feature deep pipelines

TMS320C6x processors have 3 pipeline stages with a number of phases (cycles):

Fetch

Program Address Generate (PG)

Program Address Send (PS)

Program ready wait (PW)

Program receive (PR)

Decode

Dispatch (DP)

Decode (DC)

Execute

6 to 10 phases

257

258 of 261

Direct Memory Access (DMA)

The feature that allows peripherals to access main memory without the intervention of the CPU

Typically, the CPU initiates DMA transfer, does other operations while the transfer is in progress, and receives an interrupt from the DMA controller once the operation is complete.

Can create cache coherency problems (the data in the cache may be different from the data in the external memory after DMA)

Requires a DMA controller

258

259 of 261

Cache memory

Separate instruction and data L1 caches (Harvard architecture)

Cache coherence protocols required, since most systems use DMA

259

260 of 261

DSP vs. Microcontroller

DSP

Harvard Architecture

VLIW/SIMD (parallel execution units)

No bit level operations

Hardware MACs

DSP applications

Microcontroller

Mostly von Neumann Architecture

Single execution unit

Flexible bit-level operations

No hardware MACs

Control applications

260

261 of 261

261