Elsevier

Signal Processing

Volume 87, Issue 6, June 2007, Pages 1504-1522
Signal Processing

The fan-chirp transform for non-stationary harmonic signals

https://doi.org/10.1016/j.sigpro.2007.01.006Get rights and content

Abstract

This paper presents a novel transform related to the framework of warping operators when the continuous time warping mapping is a second-order polynomial. This case is proven in the paper to be the only one from the aforementioned group that marginalizes the Wigner distribution along line paths, in particular, with a fan geometry. The properties and attributes of the fan-chirp transform (FChT) along with the analytical characterization of harmonically related Gaussian chirplets bear especial relevance in the paper. This analysis shows that for chirp-periodic signals the FChT can reach the limit of the time–frequency (TF) uncertainty principle, while simultaneously keeping the cross-terms at minimum level. The formulation of the fast digital computation of the FChT is also provided in the paper. Two practical scenarios—the analysis of speech with natural intonation and bat ultrasound—validate the theoretical developments and shows manifestly the eloquent competitive performance of the new transform.

Introduction

Identifying frequency-modulated (FM) sinusoids or chirps in a signal is known to be a tough challenge for classical linear analysis. Most of the alternative solutions for this problem has come from the field of time–frequency (TF) analysis, mainly in the form of Cohen's class bilinear time–frequency distributions (TFD) [1]. However, the long debate on the relevance and meaning of the cross-terms [2] or the dilemma on the need of positive TFDs [3], [4] have moved the attention towards different approaches, such as matching pursuits [5] over redundant chirplet dictionaries [6], [7], [8], or chirp-based transforms that marginalize the Wigner–Ville distribution according to certain geometries [10], [11], [12], [13], [14]. Although the redundant dictionary remains the most popular method for chirplet decomposition so far, chirp-based transforms are especially interesting because they can provide a broader picture of the TF content of the signal.

Several signal processing transforms are related to the term “chirp”: the Chirp-Z [9] and the “Chirplet” transforms [10] contain explicitly the term, whilst the fractional Fourier transform [11], [12] and the warped-time operators [13], [14] are conceptually related to it. The Chirp-Z transform [9] is an efficient algorithm for calculating discrete Fourier transforms (DFTs) at frequencies not related to a power-of-two fraction of the sampling bandwidth. Although a discrete-time chirp signal is used in the mechanism, the usage of this algorithm is not actually related to the context of this paper.

The first relevant chirp-based transform, the chirplet transform (CT) [10], is described by the inner product between the signal and a chirplet asXβ(f)=-x(t)gϱ,τ,f,β*(t)dt,where t is time, x(t) is the analysis signal, * denotes complex conjugate, and gϱ,τ,f,β(t) is a Gaussian chirplet of unit energygϱ,τ,f,β(t)=e-(1/2)((t-τ)/ϱ)2πϱ24ej2π(f(t-τ)+(1/2)β(t-τ)2).Here ν is the instantaneous frequency (IF) at t=τ,β the frequency variation rate and ϱ the time spread. By disregarding the Gaussian term and setting τ=0 for simplicity, it is easy to deduce that the squared magnitude of the Chirp(let) transform is|Xβ(f)|2=-WDx(t,f-βt)dt,where WDx(t,f) is the Wigner–Ville distribution [2] of x(t) (henceforth Wigner distribution, WD). Thus, the CT yields the “slanted” marginal of the WD.

Another well-established chirp-based transform is the fractional Fourier transform (FrFT) [11]Xθ(u)=-x(v)Kθ(v,u)dv,where Kθ(v,u) is the transformation kernel [12]. The FrFT involves products with linear-FM chirps in such a way that it yields the marginalization of the WD along the angular direction θ, i.e.,|Xθ(u)|2=-WDx(cu-sv,su+cv)dv,where c=cosθ and s=sinθ.

The last chirp-based transform considered here is the warping operator [13], [14], [15], defined asXψ(·)(f)=-x(ψ(t))|ψ(t)|e-j2πftdt,where ψ(t) is a continuous differentiable time mapping and ψ(t) its derivative. An equivalent formulation to this warped-time Fourier transform isX(f;φ(·))=-x(t)|φ(t)|e-j2πfφ(t)dt,where φ(t)=ψ-1(t).1 Eq. (7) represents the inner product of signal x(t) with a non-linear chirp, which is the basic mechanism in TF redundant dictionaries for chirp-based signal decomposition [8]. The warped-time framework has also given rise to new TF distributions, such as the generalized warped Cohen's class (GWCC) [16], which introduces new ways of interpreting the TF content.

This paper tackles the warping operator (7) constrained to the mapping φ(t) being a second-order polynomial. This case is proven here to marginalize the WD along straight line paths. Thus, it can be seamlessly compared against other linear chirp-based transforms, such as the CT and FrFT (see Fig. 1 for an introductory illustration), and studied with more detail apart from the general framework. The organization of the paper follows: Section 2 introduces the analysis and synthesis equations of the proposed fan-chirp transform (FChT); in Section 3 its main basic attributes, the marginalization geometry and representation of chirp-periodic signals are studied; Section 4 contains a discussion on previous works related to the FChT; Section 5 addresses the estimation of the only user-defined parameter of the FChT, the chirp rate, in order to better match the TF geometry of the analysis signal; Section 6 elaborates on the practical aspects of the digital implementation; Section 7 presents the performance evaluation of the FChT on synthetic and real scenarios, namely, the analysis of natural speech and sound of mammals; the conclusions close the paper.

Section snippets

The FChT

The analysis formula of the FChT of signal x(t) is defined asX(f,α)-x(t)|φα(t)|e-j2πfφα(t)dt,where t is time, f is frequency,2 and φα(t) is the second-order polynomial controlled by the so-called chirp rate αφα(t)(1+12αt)t.The FChT involves the inner product between x(t) and the complex signalsξ(t,f,α)=|1+αt|ej2πf(1+(1/2)αt)twhich are chirps whose IF, defined as the time derivative of the exponent, varies linearly over timeν(t)=

Properties

In this section we derive the most relevant property of the FChT regarding the marginalization of the WD; Parseval's theorem along with other basic properties are also derived; the TF resolution over harmonically related chirplets covers the final part of the section.

Prior related contributions

The FChT compares seamlessly against the Chirplet [10], the fractional Fourier [12], and the Fourier transforms, all yielding the marginalization of the TF plane along different straight line geometries (see Fig. 1 again for an illustrative comparison). Additionally, it is important to address here previous works [19], [20], [21], [22] related to the FChT to a larger or lesser extent.

The work [19] proposes the so-called Harmonic fractional Fourier transform (HFT)HFT(ω)-x(t)e-jω(1+At)tdtas

Chirp rate estimation

The most important aspect of the FChT in practical scenarios regards the adequacy of the law φα(t) to the actual TF characteristics of the signal. Signals with fan geometry are found in practice only in short segments, such as in case of speech [17] or the song of some mammals [18]. In that sense, two options are at hand: either to use a warping function φ(t) with more degrees of freedom than φα(t) for matching the possible non-linear geometry, or to parse the signal into short segments and

Discrete-time formulation

In analogy to the discrete-time Fourier transform, the formulation of the discrete-time FChT could be thought as the continuous-time transform of signalx(t)=n=-x[n]δ(t-nTs),where x[n] is the discrete-time signal and Ts is the sampling interval. This way of proceeding results inX(Ω,α^)=n=-x[n]|1+α^n|e-jΩ(1+(1/2)α^n)n,where n is discrete time, Ω is frequency, and the analysis chirp rate α^ is the discrete counterpart of the chirp rate α, that is,α^=αTs.Likewise, frequency Ω is related to

Results

The first experiment provides a comparison among the CT, FrFT and FChT on a toy synthetic example. The synthetic signal corresponds to a train of pulses non-equidistantly spaced, in such way that the fundamental frequency changes in a linear fashion; for the sake of clarity, the spectral envelope delineated by the harmonics is not flat. The mentioned transforms were applied over that signal, in such a way that the resolution achieved around the fourth harmonic k=+4 were the highest. The results

Conclusions

The fan-chirp transform (FChT) is an effective method for representing signals with fan time–frequency (TF) structure. This type of signals, denoted here as chirp-periodic signals, are common in nature, such as segments of the song of mammals and human speech in natural intonation. The FChT possesses the property of marginalizing the WD along straight line paths according to a fan geometry. This geometry is entirely described by the user-defined chirp rate α, or by its inverse, the focal point

References (29)

  • M. Kepesi et al.

    Adaptive chirp-based time–frequency analysis of speech signals

    Speech Commun.

    (May 2006)
  • L. Cohen

    Time–frequency Analysis

    (1995)
  • Mecklenbräuker, Hlawatsch (Eds.), The Wigner Distribution—Theory and Applications in Signal Processing, Elsevier,...
  • L. Cohen et al.

    Positive time–frequency distribution functions

    IEEE Trans. Acoust. Speech Signal Process.

    (1985)
  • P.J. Loughlin et al.

    Construction of positive time–frequency distributions

    IEEE Trans. Signal Process.

    (October 1994)
  • S. Mallat et al.

    Matching pursuit with time–frequency dictionaries

    IEEE Trans. Signal Process.

    (December 1993)
  • A. Bultan

    A four-parameter atomic decomposition of chirplets

    IEEE Trans. Signal Process.

    (March 1999)
  • Q. Yin et al.

    A fast refinement for adaptive Gaussian chirplet decomposition

    IEEE Trans. Signal Process.

    (June 2002)
  • A. Papandreou-Suppapola et al.

    Analysis and classification of time-varying signals with multiple time–frequency structures

    IEEE Signal Process. Lett.

    (March 2002)
  • L.R. Rabiner et al.

    The Chirp-Z transform algorithm and its application

    Bell System Technical J.

    (May–June 1969)
  • S. Mann et al.

    The chirplet transform: physical considerations

    IEEE Trans. Signal Process.

    (November 1995)
  • H.M. Ozaktas et al.

    The Fractional Fourier Transform with Applications in Optics and Signal Processing

    (2001)
  • L.B. Almeida

    The fractional Fourier transform and time–frequency representations

    IEEE Trans. Signal Process.

    (November 1994)
  • R.G. Baraniuk, D.L. Jones, Warped wavelet bases: unitary equivalence and signal processing, in: Proceedings of IEEE...
  • Cited by (54)

    • An iterative approach for spectrogram reassignment of frequency modulated multicomponent signals

      2020, Mathematics and Computers in Simulation
      Citation Excerpt :

      Due to non stationarity1 of chirp-like signals, Time–frequency (TF) transforms are recommended for their analysis instead of simple Fourier Transform (FT). Linear TF/time-scale transforms and quadratic distributions have been proposed to address this issue [1,7,9,10,14,20,28,34,36]. Short Time Fourier Transform (STFT), Gabor Transform and the Wavelet Transform are some of the most popular linear transforms.

    • An improvement of time-reassigned synchrosqueezing transform algorithm and its application in mechanical fault diagnosis

      2020, Measurement: Journal of the International Measurement Confederation
      Citation Excerpt :

      In most practical applications, signals under consideration are non-stationary [1]. The non-stationary signals processed by the time–frequency (TF) analysis (TFA) method could be roughly classified into two types: harmonic-like signals [2] and impulsive-like signals [3]. For harmonic signals, the conventional synchrosqueezing transform (SST) [4] can achieve good analysis results.

    • A fast time-frequency multi-window analysis using a tuning directional kernel

      2018, Signal Processing
      Citation Excerpt :

      In fact, these signals are often non-stationary and consist of numerous components, including noise [2]. Despite many existing approaches [3–10], this paper focuses on well known tools such as the STFT and one of its variants, the chirplet transform (CT) [11,12]. This choice is motivated by results of our recent researches [13,14] which allow to directly use the STFT in order to locally estimate the CR in the TF domain.

    View all citing articles on Scopus
    View full text