All-optical retrieval of the global phase for two-dimensional Fourier-transform spectroscopy

Alan D Bristow1, Denis Karaiskaj, Xingcan Dai

  • 1JILA, University of Colorado and National Institute of Standards and Technology, Boulder, Colorado 80309-0440 USA.

Optics Express
|October 30, 2008
PubMed

Related Concept Videos

IR Spectrometers01:25

IR Spectrometers

There are two main infrared (IR) spectrophotometers: dispersive IR spectrometers and Fourier transform infrared (FTIR) spectrometers. In a dispersive IR spectrometer, a beam of infrared radiation produced by a hot wire is divided into two parallel equal-intensity beams using mirrors. One beam passes through the sample, while another is a reference beam. The beams then move through the monochromator, which separates the radiations into a continuous spectrum of different frequencies. The...
Two-Dimensional (2D) NMR: Overview01:12

Two-Dimensional (2D) NMR: Overview

The 1D NMR spectrum of large and complex molecules like natural products has complicated splitting patterns and overlapping signals, which can be easily interpreted using 2-dimensional (2D) NMR. Unlike 1D NMR, 2D NMR has two frequency axes that provide the coupling information between the nucleus A and nucleus B in a molecule. The process from which 2D spectra are obtained has four steps.
The first step is the preparation period, during which nucleus A is excited with a radiofrequency pulse.
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...
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...