The Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform (DFT) and requires less number of computations than that of direct evaluation of DFT. It has several applications in signal processing. Because of the complexity of the processing algorithm of FFT, recently various FFT algorithms have been proposed to meet real-time processing requirements an...

BACKGROUND Primary bowing tremor (PBT) occurs in violinists in the right bowing-arm and is a highly nonlinear and non-stationary signal. However, Fourier-transform based methods (FFT) make the a priori assumption of linearity and stationarity. We present an interesting case of a violinist with PBT and apply a novel method for nonlinear and non-stationary signals for tremor analysis: the empiric...