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

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

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

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

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

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

You might also read

Related Articles

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

Sort by

Same author

Reduced side-lobe Airy beams.

Optics letters·2011

Same author

Catastrophes in wavefront-coding spatial-domain design.

Applied optics·2010

Same author

Accelerating regular polygon beams.

Optics letters·2010

Same author

Performance comparison between Shack-Hartmann and astigmatic hybrid wavefront sensors.

Applied optics·2009

Same author

Detecting higher-order wavefront errors with an astigmatic hybrid wavefront sensor.

Optics letters·2009

Same author

Defocus sensitivity optimization using the defocus Taylor expansion of the optical transfer function.

Applied optics·2009

Search research articles

Related Experiment Video

Updated: Jun 26, 2026

Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping

Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping

Published on: March 20, 2017

Joint fractional Fourier analysis of wavefront-coding systems.

Shane Barwick¹, Jerome S Finnigan

¹Rocky Mound Engineering, Macon, Gerogia 31216, USA. dsbarwick@cox.net

|January 17, 2009

Summary

Wavefront-coding systems are analyzed using the joint fractional Fourier signal representation (JFF) of the pupil function. This method reveals key properties related to system defocus response, illustrated with numerical examples.

More Related Videos

Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator

Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator

Published on: January 28, 2019

Related Experiment Videos

Last Updated: Jun 26, 2026

Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping

Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping

Published on: March 20, 2017

Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator

Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator

Published on: January 28, 2019

Area of Science:

Optical Engineering
Signal Processing

Background:

Wavefront-coding systems are crucial for extending the depth of field in optical imaging.
Analyzing system performance, especially response to defocus, is essential for optical design.

Purpose of the Study:

To explore the analysis of wavefront-coding systems.
To utilize the joint fractional Fourier signal representation (JFF) for pupil function analysis.
To reveal system response to defocus using JFF properties.

Main Methods:

Analysis of wavefront-coding systems.
Application of the joint fractional Fourier signal representation (JFF) to the pupil function.
Presentation of JFF properties relevant to defocus.

Main Results:

The joint fractional Fourier signal representation (JFF) of the pupil function provides insights into wavefront-coding systems.
Specific properties of the JFF are identified and demonstrated to be indicative of the system's response to defocus.
Numerical examples validate the theoretical findings.

Conclusions:

The JFF is a powerful tool for analyzing wavefront-coding systems.
Understanding JFF properties aids in predicting and managing defocus effects in optical systems.
This analysis contributes to the design and optimization of imaging systems with extended depth of field.