Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Trigonometric Fourier series

Trigonometric Fourier series

Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...

Discrete-Time Fourier Series

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]...

Continuous -time Fourier Transform

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...

Basic signals of Fourier Transform

Basic signals of Fourier Transform

The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...

Discrete Fourier Transform

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...

Fast Fourier Transform

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...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Effects of multiple stimuli on ocular orientation by cats.

Journal of cognitive neuroscience·2013

Same author

HIV Nef-mediated cellular phenotypes are differentially expressed as a function of intracellular Nef concentrations.

The Journal of biological chemistry·2001

Same author

A positive-feedback model for the loss of acetylcholine in Alzheimer's disease.

Annals of the New York Academy of Sciences·2000

Same author

Activity-dependent modulation of glutamate receptors by polyamines.

The Journal of neuroscience : the official journal of the Society for Neuroscience·1998

Same author

High density distribution of endoplasmic reticulum proteins and mitochondria at specialized Ca2+ release sites in oligodendrocyte processes.

The Journal of biological chemistry·1997

Same author

The choline-leakage hypothesis for the loss of acetylcholine in Alzheimer's disease.

Biophysical journal·1997

Search research articles

Related Experiment Video

Updated: May 1, 2026

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

Published on: March 25, 2014

Fourier analysis of spike train data.

G D Lange, P H Hartline

Biological Cybernetics

|September 1, 1979

Summary

This study introduces a novel method for analyzing nerve spike trains using rectangular functions. The technique enables precise spike-by-spike analysis and smooth signal reconstruction, improving neural data processing.

Area of Science:

Neuroscience
Signal Processing
Computational Biology

Background:

Nerve spike trains are fundamental to neural communication.
Analyzing spike train dynamics requires robust mathematical frameworks.
Existing methods may lack precision or be sensitive to mean firing rates.

Purpose of the Study:

To propose a formal mathematical representation for nerve spike trains.
To develop an algorithm for analyzing spike train frequency.
To enable spike-by-spike calculations and smooth signal reconstruction.

Main Methods:

Representing spike trains as a sum of rectangular functions.
Applying Fourier analysis to the formal instantaneous frequency function.
Developing an algorithm based on this representation.

More Related Videos

Author Spotlight: Advancements in Multichannel Extracellular Recording for Studying Neuronal Activity in Freely Moving Mice

Author Spotlight: Advancements in Multichannel Extracellular Recording for Studying Neuronal Activity in Freely Moving Mice

Published on: May 26, 2023

Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology

Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology

Published on: March 8, 2024

Related Experiment Videos

Last Updated: May 1, 2026

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

Published on: March 25, 2014

Author Spotlight: Advancements in Multichannel Extracellular Recording for Studying Neuronal Activity in Freely Moving Mice

Author Spotlight: Advancements in Multichannel Extracellular Recording for Studying Neuronal Activity in Freely Moving Mice

Published on: May 26, 2023

Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology

Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology

Published on: March 8, 2024

Main Results:

The proposed method allows for Fourier analysis of spike train frequency.
The algorithm performs accurate spike-by-spike calculations.
The technique is insensitive to the mean spike rate.
A smooth, filtered reconstruction of the spike train is achievable.

Conclusions:

The formal representation offers a powerful tool for analyzing neural signals.
This approach enhances the precision of spike train analysis.
The method provides a reliable way to reconstruct filtered neural activity.