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

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

Properties of Fourier Transform II

Properties of Fourier Transform II

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

Convergence of Fourier Series

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...

Properties of Fourier Transform I

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

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

You might also read

Related Articles

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

Sort by

Same author

Financial and economic costs of healthcare-associated infections in Africa.

The Journal of hospital infection·2024

Same author

Immune thrombocytopenic purpura in a patient with multiple sclerosis treated with natalizumab.

Neurology·2011

Same author

Psychiatric treatment in D. V. A. hospitals.

Treatment services bulletin. Canada. Department of Veterans' Affairs·2010

Same author

Human herpesvirus-6 encephalitis following allogeneic hematopoietic stem cell transplantation.

Bone marrow transplantation·2007

Same author

Cost-description of a pilot parenteral vaccination campaign against rabies in dogs in N'Djaména, Chad.

Tropical medicine & international health : TM & IH·2006

Same author

Costs attributable to AIDS at household level in Chad.

AIDS care·2004

Search research articles

Related Experiment Video

Updated: Jun 20, 2026

Uncovering Hidden Dynamics of Natural Photonic Structures Using Holographic Imaging

Uncovering Hidden Dynamics of Natural Photonic Structures Using Holographic Imaging

Published on: March 31, 2022

Fast-Fourier-transform holography: recent results.

|August 18, 2009

Summary

A new numerical method generates high-quality synthetic holograms using the fast Fourier transform (FFT) algorithm. This study presents the method and demonstrates its effectiveness through high-quality holographic reconstructions and equations.

Area of Science:

Optics and Photonics
Computational Imaging
Digital Holography

Background:

Synthetic hologram generation is crucial for various applications, including optical security and display technologies.
Traditional methods often face challenges in producing high-quality, artifact-free holograms efficiently.
The fast Fourier transform (FFT) algorithm offers a computationally efficient approach for wave propagation simulation.

Purpose of the Study:

To develop and present a novel numerical method for generating high-quality synthetic holograms.
To demonstrate the efficacy of the proposed method through experimental reconstructions.
To provide the underlying mathematical framework, including FFT holographic equations.

Main Methods:

Development of a numerical algorithm for synthetic hologram generation.

More Related Videos

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization

Published on: July 5, 2016

Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy (DHM)

Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy (DHM)

Published on: November 1, 2017

Related Experiment Videos

Last Updated: Jun 20, 2026

Uncovering Hidden Dynamics of Natural Photonic Structures Using Holographic Imaging

Uncovering Hidden Dynamics of Natural Photonic Structures Using Holographic Imaging

Published on: March 31, 2022

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization

Published on: July 5, 2016

Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy (DHM)

Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy (DHM)

Published on: November 1, 2017

Implementation of the fast Fourier transform (FFT) algorithm for efficient computation.

Validation of the method using high-quality holographic reconstructions.

Main Results:

Successful generation of high-quality synthetic holograms.
Demonstration of accurate and detailed reconstructions from the generated holograms.
Presentation of the derived FFT holographic equations.

Conclusions:

The developed numerical method provides a robust and efficient approach for high-quality synthetic hologram generation.
The FFT-based technique enables accurate simulation of holographic phenomena.
This work contributes to advancements in digital holography and related fields.