A note on time-frequency analysis of finger tapping

Related Experiment Video

Updated: Aug 13, 2026

Uncovering Beat Deafness: Detecting Rhythm Disorders with Synchronized Finger Tapping and Perceptual Timing Tasks
09:04

Uncovering Beat Deafness: Detecting Rhythm Disorders with Synchronized Finger Tapping and Perceptual Timing Tasks

Published on: March 16, 2015

Wei Liu1, Larry Forrester, Jill Whitall

  • 1Department of Physical Therapy and Rehabilitation Science, School of Medicine, University of Maryland, 100 Penn Street, Baltimore, MD 21201, USA. wliu@som.umaryland.edu

Journal of Motor Behavior
|January 27, 2006
PubMed

More Related Videos

A Tactile Automated Passive-Finger Stimulator (TAPS)19:44

A Tactile Automated Passive-Finger Stimulator (TAPS)

Published on: June 3, 2009

Bouncing Ball with a Uniformly Varying Velocity in a Metronome Synchronization Task05:04

Bouncing Ball with a Uniformly Varying Velocity in a Metronome Synchronization Task

Published on: September 21, 2017

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...
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
Properties of DTFT I01:24

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
Properties of Laplace Transform-II01:16

Properties of Laplace Transform-II

Time differentiation, convolution, integration, and periodicity are fundamental concepts in analyzing functions and signals over time. Each concept provides a unique perspective on how functions evolve, interact, and repeat, offering essential tools for various scientific and engineering applications.
Time differentiation involves analyzing the rate of change of a function over time. Mathematically, it is the derivative of a function with respect to time. This concept can be likened to tracking...
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...