Home

This document is a cache from http://notes.ump.edu.my/fkee/e-Books/C%20Programming%20&%20PC%20interfacing/(ebook-pdf)%20DSP%20-%20Real%20Time%20Digital%20Signal%20Processing.pdf


Real-time digital signal processing: implementations, ... changes in the input signal is limited by its internal clock rate, so that it may be slow to

Document source : notes.ump.edu.my

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 All Pages

DTMF receivers are required to detect frequencies with a tolerance of Æ1:5 percent as
valid tones. Tones that are offset by Æ3:5 percent or greater must not be detected. This
requirement is necessary to prevent the detector from falsely detecting speech and other
signals as valid DTMF digits. The receiver is required to work with a worst-case signal-
to-noise ratio of 15 dB and with a dynamic range of 26 dB.
Another requirement of the receiver is the ability to detect DTMF signals when two
tones are received at different levels. The high-frequency tone may be received at a lower
level than the low-frequency tone due to the magnitude response of the communication
channel. This level difference is called twist, and the situation described above is called a
forward (or standard) twist. Reverse twist occurs when the low-frequency tone is
received at a lower level than the high-frequency tone. The receiver must operate with
a maximum of 8 dB normal twist and 4 dB reverse twist. A final requirement for the
receiver is that it operates in the presence of speech without incorrectly identifying the
speech signal as valid DTMF tones. This is referred to as talk-off performance.
9.3.2 Goertzel Algorithm
The principle of DTMF detection is to examine the energy of the received signal at the
DTMF frequencies (defined in Figure 9.1) to determine whether a valid DTMF tone
pair has been received. The detection algorithm can be a DFT implementation using an
FFT algorithm or a filter-bank implementation. An FFT can be used to calculate the
energies of N evenly spaced frequencies. To achieve the frequency resolution required to
detect the eight DTMF frequencies within Æ1:5 percent frequency deviation, a 256-
point FFT is needed for an 8 kHz sample rate. For the relatively small number of tones
to be detected, the filter-bank implementation is more efficient.
Since only eight frequencies are of interest, it is more efficient to use the DFT directly
to compute
Xk
X
NÀ1
n0
xnW
kn
N
9:3:1
for eight different values of k that correspond to the DTMF frequencies defined in
Figure 9.1. The DFT coefficients can be more efficiently calculated by using the Goertzel
algorithm, which can be interpreted as a matched filter for each frequency k as illustrated
in Figure 9.5. In this figure, x(n) is the input signal of the system, H
k
z is the transfer
function of the filter at kth frequency bin, and X(k) is the corresponding filter output.
x(n)
H
0
(z)
H
k
(z)
H
N
-1
(z)
X(0)
X(k)
X(N
-1)
Figure 9.5 Flow graph of Goertzel filters
DTMF TONE DETECTION
411

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 All Pages






Summary :

DTMF receivers are required to detect frequencies with a tolerance of Æ1:5 percent as valid tones. 9.3.2 Goertzel Algorithm The principle of DTMF detection is to examine the energy of the received signal at the DTMF frequencies (defined in Figure 9.1) to determine whether a valid DTMF tone pair has been received. x(n) H 0 (z) H k (z) H N -1 (z) X(0) X(k) X(N -1) Figure 9.5 Flow graph of Goertzel filters DTMF TONE DETECTION 411


Tags : tone,frequencies,tones,twist,receied,figure,algorithm,frequency,signal,receier,alid,speech,dft





Terms    |    Link pdf-search-files.com    |    Site Map
   |    Content Removal Notice   
   |    Contact   

All books are the property of their respective owners.
Please respect the publisher and the author for their creations if their books copyrighted