Article ID Journal Published Year Pages File Type
563788 Signal Processing 2014 8 Pages PDF
Abstract

•A procedure for obtaining TF representations under high impulsive noise is proposed.•The proposed procedure is more flexible than the fractional lower order approach.•The procedure has low complexity since it can be evaluated using the FFT algorithm.

An efficient procedure for obtaining time–frequency representations under high influence of impulsive noise is proposed in this paper. The procedure uses the fast Fourier transform based algorithm instead of sorting procedures common in the case of various robust time–frequency representations proposed recently. Concentration measure is used to select a free parameter of the transform.

Related Topics
Physical Sciences and Engineering Computer Science Signal Processing
Authors
, , ,