### Abstract

This letter presents a method of adaptively adjusting the window length used in short-time Fourier analysis, related to our earlier work in which we developed a means of adaptively optimizing the performance of the cone kernel distribution (CKD). The optimal CKD cone length is, by definition, a measure of the interval over which the signal has constant or slowly changing frequency structure. This letter shows that this length can also be used to compute a time-varying short-time Fourier transform (STFT). The resulting adaptive STFT shares many desirable properties with the adaptive CKD, such as the ability to adapt to transient as well as long-term signal components. The optimization requires O( N) operations per step, less than the fast Fourier transform (FFT) used in computing each time slice, making it competitive in complexity with nonadaptive time-frequency algorithms.

Original language | English (US) |
---|---|

Pages (from-to) | 42-45 |

Number of pages | 4 |

Journal | IEEE Signal Processing Letters |

Volume | 4 |

Issue number | 2 |

DOIs | |

State | Published - Dec 1 1997 |

### Fingerprint

### ASJC Scopus subject areas

- Signal Processing
- Electrical and Electronic Engineering
- Applied Mathematics

### Cite this

*IEEE Signal Processing Letters*,

*4*(2), 42-45. https://doi.org/10.1109/97.554468

**Adaptive short-time Fourier analysis.** / Czerwinski, Richard N.; Jones, Douglas L.

Research output: Contribution to journal › Article

*IEEE Signal Processing Letters*, vol. 4, no. 2, pp. 42-45. https://doi.org/10.1109/97.554468

}

TY - JOUR

T1 - Adaptive short-time Fourier analysis

AU - Czerwinski, Richard N.

AU - Jones, Douglas L.

PY - 1997/12/1

Y1 - 1997/12/1

N2 - This letter presents a method of adaptively adjusting the window length used in short-time Fourier analysis, related to our earlier work in which we developed a means of adaptively optimizing the performance of the cone kernel distribution (CKD). The optimal CKD cone length is, by definition, a measure of the interval over which the signal has constant or slowly changing frequency structure. This letter shows that this length can also be used to compute a time-varying short-time Fourier transform (STFT). The resulting adaptive STFT shares many desirable properties with the adaptive CKD, such as the ability to adapt to transient as well as long-term signal components. The optimization requires O( N) operations per step, less than the fast Fourier transform (FFT) used in computing each time slice, making it competitive in complexity with nonadaptive time-frequency algorithms.

AB - This letter presents a method of adaptively adjusting the window length used in short-time Fourier analysis, related to our earlier work in which we developed a means of adaptively optimizing the performance of the cone kernel distribution (CKD). The optimal CKD cone length is, by definition, a measure of the interval over which the signal has constant or slowly changing frequency structure. This letter shows that this length can also be used to compute a time-varying short-time Fourier transform (STFT). The resulting adaptive STFT shares many desirable properties with the adaptive CKD, such as the ability to adapt to transient as well as long-term signal components. The optimization requires O( N) operations per step, less than the fast Fourier transform (FFT) used in computing each time slice, making it competitive in complexity with nonadaptive time-frequency algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0031079502&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031079502&partnerID=8YFLogxK

U2 - 10.1109/97.554468

DO - 10.1109/97.554468

M3 - Article

AN - SCOPUS:0031079502

VL - 4

SP - 42

EP - 45

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

SN - 1070-9908

IS - 2

ER -