Frequency Analysis Flashcards

(11 cards)

1
Q

Block Processing Trade-Off

A

Analysis of smaller blocks increases time resolution but decreases frequency resolution and vice versa

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Narrowband Frequency Analysis

A
  • Increasing frame N (20-30ms) leads to NB analysis
  • Decreases the spacing between the spectral components (good spectral resolution)
  • Reduces the ability to respond to changes in the signal (poor time resolution)
  • Useful for analysis of harmonics
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Wideband Frequency/Broadband Analysis

A
  • Decreasing frame N (3-5ms) leads to WB analysis
  • Increases the spacing between the spectral components (good time resolution)
  • Increases the ability to respond to changes in the signal (poor spectral resolution)
  • Useful for analysis of formants
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Frequency Resolution (through time T)

A

Δf = 1 / (NT)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Z-Transform

A

Turns messy time-domain recursion into clean algebra.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Transfer Function

Z-Transfers

A

H(z) = Y(z) / X(z)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Time Shifting Z-Transform

A

Z{ x[k-k0] } = z^-k0 * Z{x[k]}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Poles

A
  • Roots of the denominator
  • Frequencies at which a filter transfer function tends to infinity i.e. ʻresonancesʼ
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Zeros

A
  • Roots of the numerator
  • Frequencies at which a filter transfer function tends to zero i.e. ʻanti-resonancesʼ
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Geometric Series

A

sum (cr^k) = c / (1-r) for |r| < 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

DFT vs FFT

A
  • Implementation of the DFT requires the order of N^2 multiply-add operations
  • FFT exploits symmetry to require only Nlog2N multiply-add operations

e.g. for N=2048, the result is ~100x faster

  • The FFT requires that the window/frame should be a power of 2 in size
How well did you know this?
1
Not at all
2
3
4
5
Perfectly