Reassignment method: Difference between revisions

Revision as of 18:05, 9 August 2012

Revision as of 15:12, 10 August 2012

Line 329:

these algorithms operate only on short-time spectral

data evaluated at a single time and frequency, and do not

explicitly compute any derivatives, thethis reassignedgives an efficient

time-frequency coordinates <math>\hat{\omega}

(t_{n},\omega_{k})</math> and

<math>\hat{t}(t_{n},\omega_{k})</math> can be computed from

three discrete short-time Fourier transforms evaluated at

<math>t_{n},\omega_{k}</math>. This gives an efficient

method of computing the reassigned discrete short-time

Fourier transform provided only that the <math>| X(t,\omega).

|^2</math> is non-zero. This is not much of a restriction,

One constraint in this method of computation is that the <math>| X(t,\omega) |^2</math> must be non-zero. This is not much of a restriction,

since the reassignment operation itself implies that there

is some energy to reassign, and has no meaning when the