Lyons R.G. — Understanding Digital Signal Processing :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Lyons R.G. — Understanding Digital Signal Processing

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Understanding Digital Signal Processing

Автор: Lyons R.G.

Аннотация:

Digital Signal Processing (DSP) is the process of taking any kind of analog signal (such as voice) and converting it into digital form so that it can be sent over a telephone line, the Internet, a wireless network, or other communication vehicle. Understanding Digital Signal Processing presents both the theory and application of DSP in an approachable manner.

Язык:

Рубрика: Математика/Численные методы/Вейвлеты, обработка сигналов/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2001

Количество страниц: 517

Добавлена в каталог: 04.03.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

$\alpha Max+\beta Min$ algorithm      400—404
2N-point real FFTs algorithm      420—425
5-tap finite impulse response filters      162—163
A/D converters      see “Analog-to-digital (A/D) converters”
Absolute value      9
Addition process      10
Addition process for complex numbers      446—447
Addition process in finite impulse response filters      158—163
Aliased sine function      101
Aliasing      23—29
Aliasing in infinite impulse response filters      255—256
All ones rectangular function      108—111 113—115
Allpass filter      494
Amplitude response, discrete Fourier transform, complex input      119—123
Amplitude response, discrete Fourier transform, real cosine input      125
Amplitude, defined      8—9
Analog filters, use of term      253
Analog signal processing, examples of      2
Analog, use of term      2
Analog-to-digital (A/D) converters, coherent sampling      297n 433
Analog-to-digital (A/D) converters, crest factor      364n
Analog-to-digital (A/D) converters, quantization errors      357—365
Analog-to-digital (A/D) converters, testing technique      432—435
Anti-aliasing filters      32
Argand diagram      444n
attenuation, defined      495
Attenuation, relative      503
Attenuation, stopband      189
Averaging in finite impulse response filters      158—163
Averaging, applications      319
Averaging, coherent      320—327
Averaging, exponential      341—348
Averaging, filtering aspects of time-domain      340—341
Averaging, incoherent      327—330
Averaging, multiple fast Fourier transforms      133 330—340 429—430
Band reject filter      495
Band-limited signal      29
Bandpass design for finite impulse response filters      191—193
Bandpass filter      495
Bandpass sampling      32—42
Bandpass sampling, spectral inversion in      43—46
Bandpass sampling, summary of      46
Bandwidth      495—496
Bartlett windows      82
Bessel functions      189 496
Bias      356
Bilinear transform design of infinite impulse response filters      223 272—284
Binary data formats, defined      349
Binary data formats, fixed-point      349—356
Binary data formats, fixed-point effects on word length      357—375
Binary data formats, floating-point      375—382
Binary data formats, fractional      352—353
Binary data formats, hexadecimal      351
Binary data formats, octal      351
Binary data formats, offset      356
Binary data formats, place value system for      350
Binary data formats, precision and dynamic range      356—357
Binary data formats, sign-magnitude      353
Binary data formats, two’s complement      356 366—368
Bit reversal, fast Fourier transform input/output data index      145—146
bits, defined      349—350
Bits, effective number of      365
Blackman windows      184—187 409
Blackman — Harris windows      409
Block floating-point      381—382
Block, diagrams, use of      10 161
Boxcar windows      82
Butterfly structures, radix-2 FFT      146—154
Butterworth function      496
Carrier frequency      34
Cascade filters      290—292 496
Cauer filters      497
Causal systems      225
Center frequency      496
Central limit theorem      438—439
Chebyshev function      496
Chebyshev windows      87 187—191
Coefficient quantization      286—287
Coefficients for finite impulse response filters      166
Coefficients for finite impulse response filters, constant      173 498
Coherent averaging      320—327
Coherent sampling      297n 433
Commutative property      20
Complex conjugate      63—64
Complex demodulation      297n
Complex down-conversion      297n
Complex frequency      225
Complex frequency for Mth-order infinite impulse response filter      245—246
Complex input, discrete Fourier transform frequency response to      119—123
Complex numbers, addition and subtraction of      446—447
Complex numbers, applications of      453—454
Complex numbers, arithmetic representation of      444—446
Complex numbers, conjugation of      427 448
Complex numbers, division of      448—449
Complex numbers, fast multiplication of      411—412
Complex numbers, graphical representation of      443—444
Complex numbers, inverse of      449
Complex numbers, logarithm to the base 10 of      451—452
Complex numbers, multiplication of      411—412 447—448
Complex numbers, natural logarithms of      451
Complex numbers, negative frequency and      458—474
Complex numbers, raised to a power      450
Complex numbers, roots of      450—451
Complex plane      460—461
Complex signals, quadrature mixing and      471—474
Complex signals, without multiplication      385—400
Conditional stability      236
Conjugate/conjugation      63—64
Conjugate/conjugation of complex numbers      427 448
Constant-coefficient transversal finite impulse response filters      173
Constant-geometry algorithm      154
Continuous signal processing, frequency in      5—6
Continuous signal processing, use of term      2
Convolution      20
Convolution in finite impulse response filters      163—174
Convolution in time-domain      206—209
Convolution, discrete      204—216
Convolution, equation      165
Convolution, fast      435—436
Convolution, theorem      209—216
Cooley, J.      129
Cosines of consecutive angles, calculation of      436—438
Crest factor      364n
Critical Nyquist      28
Cutoff frequency      496
Data formats, binary precision/dynamic range      356—357
Data formats, defined      349
Data formats, fixed-point binary      349—356
Data formats, floating-point      375—382
DB      see “Decibels”
dbm      see “Decibels”
Deadband effects      288
DEC floating-point      378
Decibels, absolute power using      493
Decibels, defined      486 497
Decibels, magnitude and power ratios      492—493
Decibels, signal power determined by logarithms      486—491
Decimation, combined with interpolation      314—316
Decimation, filters      306 497
Decimation, resampling by      304—309
Decimation, use of term      304
Decimation-in-frequency algorithm      148—153 154
Decimation-in-time      145 149—153
Demodulation, I/Q or Weaver      299—301
Difference equation      221 222
Digital filters      see “Finite impulse response filters” “Infinite
Digital mixing, quadrature sampling and      301—303 389—393
Direct Form I structure      244
Direct Form II structure      252
Dirichlet kernel      100—103

Dirichlet kernel, all ones      108—111 114
Dirichlet kernel, symmetrical      105—108
Dirichlet, Peter      101
Discrete convolution      204—216
Discrete Fourier transform (DFT)      21
Discrete Fourier transform (DFT), defined      50
Discrete Fourier transform (DFT), equation, description of      50—63
Discrete Fourier transform (DFT), example using      54r—63
Discrete Fourier transform (DFT), frequency axis      67—68
Discrete Fourier transform (DFT), frequency response to complex input      119—123
Discrete Fourier transform (DFT), frequency response to real cosine input      123—125
Discrete Fourier transform (DFT), inverse      70—71
Discrete Fourier transform (DFT), leakage      71—80
Discrete Fourier transform (DFT), linearity      65
Discrete Fourier transform (DFT), magnitudes      66—67
Discrete Fourier transform (DFT), processing gain      93—97
Discrete Fourier transform (DFT), purpose of      49
Discrete Fourier transform (DFT), rectangular functions      97—119
Discrete Fourier transform (DFT), relationship of fast Fourier transform to      130—131
Discrete Fourier transform (DFT), scalloping loss      88—89
Discrete Fourier transform (DFT), shifting theorem      68—70
Discrete Fourier transform (DFT), single-bin frequency response to real cosine input      125—127
Discrete Fourier transform (DFT), symmetry      63—65
Discrete Fourier transform (DFT), windows      80—87
Discrete Fourier transform (DFT), zero stuffing      89—93
Discrete linear systems      13—18
Discrete-time expression      4
Discrete-time Fourier transform (DTFT), defined      93
Discrete-time signal, connecting dots in, problem with      3
Discrete-time signal, example of      2—3
Discrete-time signal, frequency in      6
Discrete-time signal, input and output shown      5
Discrete-time signal, use of term      2
Discrete-time waveform, methods for describing      8
Dither sequence      288
Division of complex numbers      448—449
Dolph — Chebyshev windows      187
Double-memory algorithm      153—154
Down-conversion, complex      297n
Downsampling, resampling by      304r—9
Dynamic range, fixed-point binary data format      356—357
Dynamic range, floating-point      379—381
Effective number of bits (ENOB)      365
Elliptic function      497
Envelope delay      202 204 498
Euler, Leonhard      460
Euler’s equation      50 100 249 267 275 298 463 464
Even symmetry      64
Exponential averaging      341—348
Fast convolution      435—436
Fast Fourier transform (FFT), averaging multiple      133 330—340 429—430
Fast Fourier transform (FFT), calculating the inverse of, using the forward      425—429
Fast Fourier transform (FFT), constant-geometry algorithm      154
Fast Fourier transform (FFT), decimation-in-frequency      148—153 154
Fast Fourier transform (FFT), decimation-in-time      145 149—153
Fast Fourier transform (FFT), development of      129
Fast Fourier transform (FFT), double-memory algorithm      153—154
Fast Fourier transform (FFT), fast finite impulse response filtering using      435—436
Fast Fourier transform (FFT), hints for using      131—136
Fast Fourier transform (FFT), in-place algorithm      153
Fast Fourier transform (FFT), input/output data index bit reversal      145—146
Fast Fourier transform (FFT), interpreting results      134r—36
Fast Fourier transform (FFT), overflow errors      369—370
Fast Fourier transform (FFT), performing 2N-point real      420—425
Fast Fourier transform (FFT), performing two N-point real      412—420
Fast Fourier transform (FFT), radix-2 FFT algorithm      136—145
Fast Fourier transform (FFT), radix-2 FFT butterfly structures      146—154
Fast Fourier transform (FFT), relationship to discrete Fourier transform      130—131
Fast Fourier transform (FFT), software programs      136
fibonacci      459
Filtering/filters      see “Finite impulse response (FIR) filters” “Infinite
Filtering/filters, allpass      494
Filtering/filters, aspects of time-domain averaging      340—341
Filtering/filters, background of      157
Filtering/filters, band reject      495
Filtering/filters, bandpass      495
Filtering/filters, cascade      290—292 496
Filtering/filters, Cauer      497
Filtering/filters, coefficients      498
Filtering/filters, decimation      306 497
Filtering/filters, description of process      157—158
Filtering/filters, interpolation      310 314
Filtering/filters, multirate      314
Filtering/filters, noniecursive      158 253
Filtering/filters, notch      495
Filtering/filters, order      498
Filtering/filters, parallel      290—292
Filtering/filters, polyphase      313
Filtering/filters, prototype      254
Filtering/filters, recursive      253
Filtering/filters, structure      161
Filtering/filters, time-varying      313
Filtering/filters, transversal      162
Finite impulse response (FIR) filters, 5-tap      162—163
Finite impulse response (FIR) filters, averaging with      158—163
Finite impulse response (FIR) filters, bandpass design      191—193
Finite impulse response (FIR) filters, coefficients      166
Finite impulse response (FIR) filters, convolution in      163—174
Finite impulse response (FIR) filters, defined      498
Finite impulse response (FIR) filters, fast Fourier transform used for fast      435—436
Finite impulse response (FIR) filters, Fourier series design of      175—191
Finite impulse response (FIR) filters, frequency response in      163 181
Finite impulse response (FIR) filters, half-band      197—198
Finite impulse response (FIR) filters, highpass design      193—194
Finite impulse response (FIR) filters, impulse response      165—166
Finite impulse response (FIR) filters, infinite impulse response filters compared to      292—293
Finite impulse response (FIR) filters, low-pass design      174—191
Finite impulse response (FIR) filters, nonrecursive filters      158 253
Finite impulse response (FIR) filters, nonzero input values in      158
Finite impulse response (FIR) filters, optimal design method      194
Finite impulse response (FIR) filters, other names for      158
Finite impulse response (FIR) filters, Parks — McClellan design      194
Finite impulse response (FIR) filters, phase response in      199—204
Finite impulse response (FIR) filters, Remez Exchange design      194—197
Finite impulse response (FIR) filters, structure simplified      430—432
Finite impulse response (FIR) filters, window design of      175—191
First-order sampling      35
Fixed-point binary data formats, defined      349
Fixed-point binary data formats, effects on word length      357—375
Fixed-point binary data formats, fractional      352—353
Fixed-point binary data formats, hexadecimal      351
Fixed-point binary data formats, octal      351
Fixed-point binary data formats, offset      356
Fixed-point binary data formats, place value system for      350
Fixed-point binary data formats, precision and dynamic range      356—357
Fixed-point binary data formats, sign-magnitude      353
Fixed-point binary data formats, two’s complement      356
Floating-point binary data format, block      381—382
Floating-point binary data format, DEC      378
Floating-point binary data format, description of      375—382
Floating-point binary data format, dynamic range      379—381
Floating-point binary data format, fraction of      376
Floating-point binary data format, hidden bit      376
Floating-point binary data format, IBM      378
Floating-point binary data format, IEEE P754      378
Floating-point binary data format, MIL-STD 1750A      378
Floating-point binary data format, overflow oscillations/limit cycles and      289
Folding frequency      28 30
Fourier series design of finite impulse response filters      175—191
Fractional binary data format      352—353
Frequency axis      67—68
Frequency axis in Hz      112
Frequency axis in radians/seconds      113
Frequency axis, normalized angle variable and      113
Frequency axis, rectangular function and      111—113
Frequency domain, defined      6
Frequency domain, listing of sequences      8
Frequency domain, windowing in      407—409
Frequency response      21
Frequency response for Mth-order infinite impulse response filter      245—246

1 2 3

О проекте