Documentation for GFTT classes and functions

Author

J. Giovinazzo (giovi.nosp@m.naz@.nosp@m.cenbg.nosp@m..in2.nosp@m.p3.fr)

This collection of classes and functions provide some base tools for samples processing using Fourier transforms for (de)convolution.

The GFFT package

• see Danielson-Lanczos algorithm for FFT for the FFT algorithm
• GBaseSampleFFT is an abstract base class to handle the sampling of a signal (either real or complex) and it's FFT.
• GRealSampleFFT is the class to use for samples with real samples values.

Setting a time scale

A time scale can be defined (instead of point number). This can be done specifying a time interval, that can be interpreted in 2 ways:

• the limits correspond to the first and last points exactly (N-1 intervals)
• the limits correspond to an equivalent binning of the samples, each point being the center of the bin (N intervals) This is specified in the functions setting the time scale (constructors or setting functions). By default (default argument or false), the first mode is set (not centered).

Releases

• version 1.2 (10/2017)
  • included in the GCpp (base classes) and GRootTools (ROOT classe) packages
• version 1.1 (04/2016)
  • modified samples limits setting for bin mode / center point mode in GBaseSampleFFT::SetTimeRange function
  • added mean and RMS functions for real samples