DocumentCode
3268843
Title
Reassignment methods for robust time-frequency representations
Author
Li, Xiumei ; Bi, Guoan
Author_Institution
Sch. of EEE, NTU, Singapore, Singapore
fYear
2009
fDate
8-10 Dec. 2009
Firstpage
1
Lastpage
5
Abstract
In this paper, the reassignment method is extended to the robust local polynomial periodogram to process the nonstationary signals corrupted by impulse noise. Performance comparisons between robust spectrogram, the reassigned robust spectrogram, the robust local polynomial periodogram and the reassigned robust local polynomial periodogram (RrLPP) are presented. During computation of the local polynomial Fourier transforms, the length of overlap between the adjacent data segments is reduced to minimize the computational complexity. It shows that under the environment of impulse noise, with reduced overlap, the RrLPP and the reassigned robust local polynomial periodogram along frequency direction (RfrLPP) achieve much better signal concentrations than their counterparts without reassignment. It is also observed that the RfrLPP can achieve comparable results as the RrLPP, with reduced computational time.
Keywords
Fourier transforms; computational complexity; impulse noise; polynomials; signal processing; time-frequency analysis; computational complexity; impulse noise; local polynomial Fourier transforms; nonstationary signal processing; reassigned robust local polynomial periodogram; reassigned robust spectrogram; robust time-frequency representations; Bismuth; Communication standards; Computational complexity; Fourier transforms; Noise robustness; Polynomials; Signal processing; Spectrogram; Time frequency analysis; Working environment noise;
fLanguage
English
Publisher
ieee
Conference_Titel
Information, Communications and Signal Processing, 2009. ICICS 2009. 7th International Conference on
Conference_Location
Macau
Print_ISBN
978-1-4244-4656-8
Electronic_ISBN
978-1-4244-4657-5
Type
conf
DOI
10.1109/ICICS.2009.5397517
Filename
5397517
Link To Document