Approach for fast time–frequency analysis. Issue 4 (1st June 2014)

• Record Type: Journal Article
• Authors: Cheng, Chun Hing; Pradhan, Pyari Mohan; Mitchell, Joseph Ross
• Is Part Of: IET signal processing. Volume 8:Issue 4(2014)
• Page Start: 360
• Page End: 372
• Publication Date: 2014-06-01
• Subjects: encoding -- matrix algebra -- signal representation -- time‐frequency analysis -- time series -- transforms -- compressed sensing; fast time‐frequency analysis -- S‐transform -- ST -- time‐frequency representation -- TFR -- time series -- one‐dimensional fast time‐frequency transform -- FTFT‐1D -- ST matrix -- compression technique -- ST visualisation -- ST transmission -- real‐time applications; Signal processing -- Periodicals; 621.3822
• DOI: 10.1049/iet-spr.2013.0157
• Languages: English
• ISSNs: 1751-9675

Abstract

Abstract : S ‐transform (ST) is a time–frequency representation (TFR) that is popularly used in a variety of applications, but prohibitive in both storage and computation for large time series. This study proposes a one‐dimensional fast time–frequency transform (FTFT‐1D) which generates a highly compressed form of the ST directly, without the need to compute the complete ST matrix initially and compress it subsequently. The compression technique used in the FTFT‐1D helps in storage, transmission and visualisation of the ST. The FTFT‐1D encodes the TFR information uniformly and finds the local spectrum instantaneously and accurately. It is useful for real‐time applications such as monitoring, control and filtering. In addition, the FTFT‐1D is memory efficient, robust and adaptive in nature.