Kalpana Kalpana (Editor)

Regressive discrete Fourier series

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In applied mathematics, the regressive discrete Fourier series (RDFS) is a generalization of the discrete Fourier transform where the Fourier series coefficients are computed in a least squares sense and the period is arbitrary, i.e., not necessarily equal to the length of the data. It was first proposed by Arruda (1992a,1992b). It can be used to smooth data in one or more dimensions and to compute derivatives from the smoothed curve, surface, or hypersurface.

Contents

One-dimensional regressive discrete Fourier series (RDFS)

The one-dimensional RDFS proposed by Arruda (1992a) can be formulated in a very straightforward way. Given a sampled data vector (signal) x n = x ( t n ) , one can write the algebraic expression:

x n = ∑ k = − q q X k e − i 2 π k t n T + ε n , t n  arbitrary  , n = 1 , … , N .

Typically t n = n Δ t , but this is not necessary.

The above equation can be written in matrix form as

W X = x + ε .

The least squares solution of the above linear system of equations can be written as:

X ^ = ( W H W ) − 1 W H x

and the smoothed signal is obtained from:

x ^ = W x

The first derivative of the smoothed signal x ^ can be obtained from:

d x d t ( t n ) = ∑ k = − q q − i 2 π k T X k e − i 2 π k t n T , n = 1 , … , N .

Two-dimensional regressive discrete Fourier series (RDFS)

The two-dimensional, or bidimensional RDFS proposed by Arruda (1992b) can also be formulated in a straightforward way. Here the equally spaced data case will be treated for the sake of simplicity. The general non-equally-spaced and arbitrary grid cases are given in the reference (Arruda,1992b). Given a sampled data matrix (bi dimensional signal) x m n = x ( ξ m , ν n ) , m = 1 , … , M ;   n = 1 , … , N ; one can write the algebraic expression:

x m n = ∑ k = − p p ∑ l = − q q X k l e − i 2 π k ξ m L ξ e − i 2 π l ν n L ν + ε m n , m = 1 , … , M ;   n = 1 , … , N .

The above equation can be written in matrix form for a rectangular grid. For the equally spaced sampling case : ξ m = m Δ ξ , ν n = n Δ ν we have:

x m n = ∑ k = − p p ∑ l = − q q X k l e − i 2 π k ξ m L ξ e − i 2 π l ν n L ν + ϵ m n , m = 1 , … , M ;   n = 1 , … , N .

The least squares solution may be shown to be:

X ^ = ( W L ξ H W L ξ ) − 1 W L ξ H x W L ν H ( W L ν W L ν H ) − 1

and the smoothed bidimensional surface is given by:

x ^ = W L ξ X ^ W L ν

Differentiation with respect to ξ  and  ν can be easily implemented analogously to the one-dimensional case (Arruda, 1992b).

Current applications

  • Spatially dense data condensation applications: Arruda, J.R.F. [1993] applied the RDFS to condense spatially dense spatial measurements made with a laser Doppler vibrometer prior to applying modal analysis parameter estimation methods. More recently, Vanherzeele et al. (2006,2008a) proposed a generalized and an optimized RDFS for the same kind of application. A review of optical measurement processing using the RDFS was published by Vanherzeele et al. (2009).
  • Spatial derivative applications: Batista et al. [2008b] applied RDFS to obtain spatial derivatives of bi dimensional measured vibration data to identify material properties from transverse modes of rectangular plates.
  • SHM applications: Vanherzeele et al. [2009] applied a generalized version of the RDFS to tomography reconstruction.

    • References

    Regressive discrete Fourier series Wikipedia
    (Text) CC BY-SA