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.
['Antonio H. Costa', 'G.F. Boudreaux-Bartels']
An overview of aliasing errors in discrete-time formulations of time-frequency representations