短时傅里叶变换及其逆变换(Short-Time Fourier Transform and Its Inverse).pdfVIP

Short-Time Fourier Transform and Its Inverse Ivan W. Selesnick April 14, 2009 1 Introduction The short-time Fourier transform (STFT) of a signal consists of the Fourier transform of overlapping windowed blocks of the signal. In this note, we assume the overlapping is by 50% and we derive the perfect reconstruction condition for the window function, denoted w (n). The window w (n) is assumed to be supported (non-zero) for n = 0, . . . , N − 1. For example, Figure 1 shows a window of length N = 10. In this example, the window is a symmetric half-cycle sine window. The N-point half-cycle sine window is given by w (n) = sin π (n + 0.5) , n = 0, . . . , N − 1. (1) N The figure shows several shifted windows. The shifted windows are shifted by half the length of the window. (In practice, the window is much longer than 10 samples. A short window is used here for illustration.) The m-th windowed block of the signal x(n) is given by x(n) · w (n − m · N/2). For example, Figure 2 shows several windowed blocks. The m-th windowed block is denoted as s(m, n): s(m, n) := x(n) · w (n − m · N/2) (2) For example, Figure 2 shows the m-th windowed block for m = 0, . . . , 4. The short-time Fourier transform is obtained by taking the DTFT of each windowed block: S (m, ω) := DTFT{x(n) · w (n − m · N/2)} (3) The short-time Fourier transform of a discrete-time signal x(n) is denoted by S (m, ω) = STFT{x(n)}. In practice, the DTFT is computed using the DFT or a zero-padded DFT. 2 Inverse STFT The inverse STFT begins with the inverse DTFT of S (m, ω) to recover s(m, n). s(m, n) = DTFT−1{S (m, ω)}