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

Discrete Fourier Transform01:15

Discrete Fourier Transform

858
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...
858
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

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

Discrete-Time Fourier Series

663
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]...
663
Fast Fourier Transform01:10

Fast Fourier Transform

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

Properties of Fourier Transform I

612
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...
612
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

747
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
747

You might also read

Related Articles

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

Sort by
Same author

[A case of recurrent convulsions caused by acute sulfuryl fluoride gas poisoning].

Zhonghua lao dong wei sheng zhi ye bing za zhi = Zhonghua laodong weisheng zhiyebing zazhi = Chinese journal of industrial hygiene and occupational diseases·2024
Same author

[A case of delayed peripheral neuropathy caused by diquat poisoning].

Zhonghua lao dong wei sheng zhi ye bing za zhi = Zhonghua laodong weisheng zhiyebing zazhi = Chinese journal of industrial hygiene and occupational diseases·2023
Same author

[Outcomes of the second pregnancy after Triple-P procedure in women complicated with placenta accreta spectrum disorders].

Zhonghua fu chan ke za zhi·2023
Same author

[Analysis of the efficacy and related influencing factors of pelvic packing in the treatment of intractable postpartum hemorrhage after emergency perinatal hysterectomy].

Zhonghua fu chan ke za zhi·2022
Same author

[Association of hyperuricemia-induced renal damage with sirtuin 1 and endothelial nitric oxide synthase in rats].

Zhonghua yi xue za zhi·2021
Same author

[Disorder of consciousness as the first symptom of severe diluent intoxication:a case report].

Zhonghua lao dong wei sheng zhi ye bing za zhi = Zhonghua laodong weisheng zhiyebing zazhi = Chinese journal of industrial hygiene and occupational diseases·2020
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: Jan 19, 2026

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

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

165

Discrete Fourier preprocessing transforms for the binary phase-only filter.

N C Hu, C H Su

    Applied Optics
    |November 2, 2010
    PubMed
    Summary
    This summary is machine-generated.

    Two discrete Fourier preprocessing transforms (DFPTs) enhance binary phase-only filters. Class-2 DFPTs offer improved pattern recognition and higher correlation peak intensity, suitable for optical and electrical systems.

    More Related Videos

    Discrete Fourier Transform
    01:15

    Discrete Fourier Transform

    858
    Discrete-time Fourier transform
    01:26

    Discrete-time Fourier transform

    1.0K

    Related Experiment Videos

    Last Updated: Jan 19, 2026

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

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    165
    Discrete Fourier Transform
    01:15

    Discrete Fourier Transform

    858
    Discrete-time Fourier transform
    01:26

    Discrete-time Fourier transform

    1.0K

    Area of Science:

    • Optics and Photonics
    • Signal Processing
    • Computer Vision

    Background:

    • Binary phase-only filters (BPOFs) are crucial in optical pattern recognition.
    • Traditional BPOFs based on the discrete Fourier transform (DFT) have limitations in recognizing partial patterns.
    • Efficient implementation of BPOFs is essential for practical applications.

    Purpose of the Study:

    • To introduce and evaluate two novel discrete Fourier preprocessing transforms (DFPTs) for BPOFs.
    • To compare the performance of DFPT-based BPOFs with traditional DFT-based BPOFs.
    • To assess the suitability of DFPTs for optical and electrical implementations.

    Main Methods:

    • Application of Class-1 and Class-2 DFPTs to BPOFs.
    • Analysis of the properties of Class-1 DFPTs in relation to DFT.
    • Investigation of the location sensitivity and pattern recognition capabilities of Class-2 DFPTs.
    • Evaluation of correlation peak intensity and characteristics.

    Main Results:

    • Class-1 DFPTs closely resemble DFT, preserving similar properties.
    • Class-2 DFPTs exhibit location sensitivity, enabling recognition of partial input patterns.
    • Class-2 DFPTs generate delta-function-like correlation peaks with higher intensity than DFT-based methods.
    • DFPT elements are simple (±1, 0), with some being sparse, facilitating implementation.

    Conclusions:

    • DFPTs offer significant advantages over traditional DFT-based BPOFs, particularly Class-2.
    • Class-2 DFPTs provide enhanced partial pattern recognition and superior correlation performance.
    • The simplicity and sparsity of DFPT elements make them highly suitable for efficient optical and electrical hardware implementations.