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

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

Parseval's Theorem for Fourier transform

Parseval's Theorem for Fourier transform

Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...

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

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

Properties of Fourier series II

Properties of Fourier series II

Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...

You might also read

Related Articles

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

Sort by

Same author

Functional connectivity of the cognitive emotion regulation network in partially sleep-deprived individuals using an emotional arrows task: potential age-dependent effects.

Brain imaging and behavior·2026

Same author

Age-Related Changes in Default Mode Network in Autism Spectrum Disorder: Insights From Effective Connectivity.

Human brain mapping·2025

Same author

Local efficiency analysis of the emotion regulation network in younger and older adults experiencing sleep deprivation: A task-based fMRI study.

Sleep medicine·2025

Same author

Neuromodulation effect of temporal interference stimulation based on network computational model.

Frontiers in human neuroscience·2024

Same author

Computational analysis of non-invasive deep brain stimulation based on interfering electric fields.

Physics in medicine and biology·2019

Same author

Nonrigid image registration in digital subtraction angiography using multilevel B-spline.

BioMed research international·2013

Search research articles

Related Experiment Video

Updated: May 1, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Calculation of Computational Complexity for Radix-2 (p) Fast Fourier Transform Algorithms for Medical Signals.

Rassoul Amirfattahi¹

¹Digital Signal processing Research Lab., Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran.

Journal of Medical Signals and Sensors

|April 4, 2014

Summary

Radix-2(p) algorithms offer a simpler approach to fast Fourier transform (FFT) implementation. New methods show Radix-2(2) and Radix-2(3) significantly reduce computational complexity compared to standard Radix-2 FFT.

Keywords:

Computational complexity fast fourier transform medical signals radix-2p

More Related Videos

A Coregistered Ultrasound and Photoacoustic Imaging Protocol for the Transvaginal Imaging of Ovarian Lesions

A Coregistered Ultrasound and Photoacoustic Imaging Protocol for the Transvaginal Imaging of Ovarian Lesions

Published on: March 3, 2023

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Related Experiment Videos

Last Updated: May 1, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

A Coregistered Ultrasound and Photoacoustic Imaging Protocol for the Transvaginal Imaging of Ovarian Lesions

A Coregistered Ultrasound and Photoacoustic Imaging Protocol for the Transvaginal Imaging of Ovarian Lesions

Published on: March 3, 2023

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Area of Science:

Digital Signal Processing
Algorithm Analysis
Computational Mathematics

Background:

The Radix-2 algorithm is widely used for fast Fourier transform (FFT) due to its implementation simplicity.
Higher radix algorithms offer comparable computational complexity but often sacrifice simplicity.
Radix-2(p) algorithms aim to combine the simplicity of Radix-2 with the efficiency of higher radices.

Purpose of the Study:

To introduce a novel concept, the 'twiddle factor template,' for precisely calculating the multiplicative complexity of Radix-2(p) algorithms.
To analyze and compare the computational complexity of Radix-2, Radix-2(2), and Radix-2(3) algorithms.

Main Methods:

Definition and application of the 'twiddle factor template' concept.
Exact calculation of multiplicative complexity for Radix-2, Radix-2(2), and Radix-2(3) algorithms.
Comparative analysis of computational costs, focusing on real and complex multiplications.

Main Results:

Radix-2(2) and Radix-2(3) algorithms demonstrate significantly lower computational complexity than the standard Radix-2 algorithm.
Radix-2(3) requires more complex multiplications than Radix-2(2) but fewer real multiplications.
The efficiency of Radix-2(3) in terms of real multiplications is attributed to its frequent use of specific twiddle factor forms.

Conclusions:

Radix-2(p) algorithms, particularly Radix-2(2) and Radix-2(3), present a more computationally efficient alternative to the traditional Radix-2 FFT.
The 'twiddle factor template' provides an effective method for assessing the multiplicative complexity of these algorithms.
Optimization of real multiplications can be achieved with Radix-2(3) due to its twiddle factor characteristics.