High resolution time-frequency analysis by fractional domain warping
Abstract
A new algorithm is proposed to obtain very high-resolution time-frequency analysis of signal components with curved time-frequency supports. The proposed algorithm is based on the fractional Fourier domain warping concept introduced in this work. By integrating this warping concept to the recently developed directionally smoothed Wigner distribution algorithm (Ozdemir et al., 2000), the high performance of that algorithm on linear, chirp-like components is extended to signal components with curved time-frequency supports. The main advantage of the algorithm is its ability to suppress not only the cross-cross terms, but also the auto-cross terms in the Wigner distribution. For a signal with N samples duration, the computational complexity of the algorithm is O(NlogN) flops for each computed slice of the new time-frequency distribution.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The proposed GTBP optimal STFT requires three important parameters related to the time-frequency support of mono-component signals: the dimensions and the orientation of the bounding rectangle.
“The proposed GTBP optimal STFT requires three important parameters related to the time-frequency support of mono-component signals. These are the dimensions and the orientation of the bounding rectangle [37].”
From Short-time fourier transform: two fundamental properties and an optimal implementation (2003) · cites this paper as [37]
Cited by
Sorted by citations
Short-time fourier transform: two fundamental properties and an optimal implementation
Durak, L., & Arikan, O. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.810293 · Cited by 345 · see citing works
Self-citation
- Authors
- Ozdemir, A. K., Durak, L., & Arikan, O.
- Venue
- 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 6
- Pages
- 3553-3556
- ISSN
- 1520-6149 (ISSN-L)
- OpenAlex
- W1665547839
- Cited by
- 5
- References
- 0
- Citations by year
- 2022: 1
- FWCI
- 1.89
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Conference on Acoustics Speech and Signal Processing (publishedVersion)
- Bilkent University Institutional Repository (Bilkent University) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
- Physical Sciences › Engineering › Computational Mechanics › Sparse and Compressive Sensing Techniques
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Electrical Measurement Techniques
- Keywords
- time-frequency analysis, Wigner function, computational complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
