An overview of aliasing errors in discrete-time formulations of time-frequency representations

An overview of aliasing errors in discrete-time formulations of time-frequency representations

Discrete-time time-frequency representation (TFR) algorithms claim to provide alias-free approximations to their continuous-time TFR counterparts without requiring oversampling of the signal By counterexamples, we demonstrate that some of these claims are invalid. We give new necessary conditions fo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing 1999-05, Vol.47 (5), p.1463-1474
Hauptverfasser: Costa, A.H., Boudreaux-Bartels, G.F.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Aliasing
Applied sciences
Approximation
Computer errors
Data analysis
Detection, estimation, filtering, equalization, prediction
Distributed computing
Errors
Exact sciences and technology
Formulations
Fourier transforms
Frequency
Information, signal and communications theory
Kernel
Oversampling
Representations
Signal analysis
Signal and communications theory
Signal processing
Signal sampling
Signal, noise
Smoothing methods
Telecommunications and information theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Discrete-time time-frequency representation (TFR) algorithms claim to provide alias-free approximations to their continuous-time TFR counterparts without requiring oversampling of the signal By counterexamples, we demonstrate that some of these claims are invalid. We give new necessary conditions for reducing aliasing errors in these discrete-time TFR algorithms.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.757245