Fitts' index of difficulty predicts the 1/f structure of movement amplitude time series

Andrew B Slifkin1, Jeffrey R Eder

  • 1Department of Psychology, Cleveland State University, 2121 Euclid Avenue, Cleveland, OH, 44115, USA, a.slifkin@csuohio.edu.

Experimental Brain Research
|February 18, 2014
PubMed

Related Concept Videos

Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
1.3K
Muscle Stimulation Frequency01:22

Muscle Stimulation Frequency

The contraction strength of muscles is regulated by motor neurons, which modulate the frequency of action potentials dispatched to the motor units based on the body's requirements. This process of varying the muscle stimulation frequency allows muscles to contract with a force that is precisely tailored to the needs of the moment, whether lifting a feather or a heavy box.
Wave summation
At low firing rates, motor neurons induce individual twitch contractions in muscle fibers. These twitches...
4.7K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
1.3K