Related Experiment Video
Updated: Jun 12, 2026

Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator
Published on: January 28, 2019
Optical correlator performance of binary phase-only filters using Fourier and Hartley transforms
Abstract:
Theoretical studies of the performance capabilities of binary phase-only filters (BPOFs), constructed using both Fourier and Hartley transforms, are presented. A thorough analysis of the Fourier BPOF is given. We show that, although BPOFs constructed using Fourier transforms perform well in optical correlator systems, they are also subject to additional noise sources and have the possibility of generating large false correlation signals. We then present an analysis of BPOFs constructed using the Hartley transform. We show that BPOFs made using the Hartley transform provide superior false correlation rejection and more uniformly sized correlation signals for heavily multiplexed BPOFs, compared with those made using the Fourier transform. We also present a technique for constructing Hartley BPOFs. Therefore, although it is well known that the quality of the correlation signal depends on the object, this work demonstrates that the quality of the correlation signal can also depend on the technique used in the synthesis of the BPOF.
Related Concept Videos
Properties of Fourier Transform II
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...
Properties of Fourier Transform I
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
Parseval's Theorem for Fourier transform
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a signal's...
Basic signals of Fourier Transform
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Continuous -time Fourier Transform

