Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

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...
Continuous -time Fourier Transform01:11

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...
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...
Properties of Fourier Transform I01:21

Properties of Fourier Transform I

The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
Trigonometric Fourier series01:17

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

You might also read

Related Articles

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

Sort by
Same author

Surgical and functional outcomes of cochlear implantation in post-lingual and cross-over patients: First 5-year review of the National Ministry of Health Malaysia cochlear implant programme.

The Medical journal of Malaysia·2019
Same author

Author's reply.

Medicina intensiva·2016
Same author

Infections in critically ill burn patients.

Medicina intensiva·2016
Same author

Vibration frequency measurement using a local multithreshold technique.

Optics express·2013
Same author

Three dimensional analysis of chromatic aberration in diffractive elements with extended depth of focus.

Optics express·2009
Same author

Three-dimensional object recognition by fourier transform profilometry.

Applied optics·2008
Same journal

Multifunctional reconfigurable terahertz metasurface based on vanadium dioxide phase transition: achieving broadband absorption and efficient polarization conversion.

Applied optics·2026
Same journal

High-Q-factor electromagnetically induced transparency utilizing quasi-bound states in the continuum in an all-dielectric terahertz metasurface.

Applied optics·2026
Same journal

Automated stitching interferometry for high-precision metrology of X-ray mirrors.

Applied optics·2026
Same journal

Experimental demonstration of an approach to designing a metal-dielectric DBR resonant cavity structure.

Applied optics·2026
Same journal

High-precision wavefront reconstruction from a single-shot interferogram using a physics-driven hybrid feature calibration network.

Applied optics·2026
Same journal

Ultra-high-Q Fano resonance based on coupled topological corner states in Kagome photonic crystals.

Applied optics·2026
See all related articles

Related Experiment Video

Updated: Jun 6, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.

J García, D Mas, R G Dorsch

    Applied Optics
    |December 15, 2010
    PubMed
    Summary
    This summary is machine-generated.

    A novel method efficiently calculates the fractional Fourier transform (FRT) using the fast Fourier transform (FFT) algorithm. This approach offers computational efficiency comparable to the FFT for various fractional orders.

    More Related Videos

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

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

    Published on: August 30, 2013

    Related Experiment Videos

    Last Updated: Jun 6, 2026

    A Multimodal Wide-Field Fourier-Transform Raman Microscope
    06:48

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

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

    Published on: August 30, 2013

    Area of Science:

    • Signal Processing
    • Applied Mathematics
    • Optics

    Background:

    • The fractional Fourier transform (FRT) is a generalization of the Fourier transform with applications in signal processing and optics.
    • Efficient computation of the FRT is crucial for its practical implementation.

    Purpose of the Study:

    • To present a novel method for calculating the fractional Fourier transform (FRT).
    • To leverage the fast Fourier transform (FFT) algorithm for efficient FRT computation.
    • To analyze the validity and complexity of the proposed FRT calculation method.

    Main Methods:

    • The proposed method utilizes a cascade of two fast Fourier transform (FFT) algorithms.
    • The computational complexity of the method is analyzed and compared to the standard FFT.
    • The method's validity is established for fractional orders ranging from -1 to 1.

    Main Results:

    • A computationally efficient method for calculating the FRT is demonstrated.
    • The method exhibits the same computational complexity as the fast Fourier transform (FFT) algorithm.
    • Scaling factors relevant to FRT and Fresnel diffraction calculations using FFT are discussed.

    Conclusions:

    • The presented method provides an efficient way to compute the fractional Fourier transform (FRT) using readily available fast Fourier transform (FFT) algorithms.
    • The technique is applicable across a wide range of fractional orders, enhancing its utility in various scientific domains.
    • Understanding scaling factors is essential for accurate FRT and Fresnel diffraction analysis via FFT.