Related Experiment Video
Updated: Feb 14, 2026
11:21
Integrated Photoacoustic Ophthalmoscopy and Spectral-domain Optical Coherence Tomography
Published on: January 15, 2013
12.0K
Group refractive index quantification using a Fourier domain short coherence Sagnac interferometer
Optics Letters
|February 15, 2018
Summary
Accurate group refractive index quantification is achieved using a Sagnac interferometer. This method simplifies length calibration for Fourier domain interferometers, reducing reliance on transfer standards.
Area of Science:
- Optics and Photonics
- Metrology
- Interferometry
Background:
- Accurate group refractive index is crucial for length calibration in Fourier domain interferometry.
- Transparent transfer standards are typically used for this calibration process.
Purpose of the Study:
- To demonstrate accurate group refractive index quantification using a Fourier domain short coherence Sagnac interferometer.
- To simplify and improve the accuracy of length calibration for interferometers.
Main Methods:
- Utilizing a Fourier domain short coherence Sagnac interferometer.
- Employing a justified linear length calibration function where calibration constants cancel out.
- Measuring two uncalibrated lengths of standard thickness coverslips.
Main Results:
- Accurate group refractive index quantification was achieved.
- Measured group indices for coverslips were 1.5426±0.0042 and 1.5434±0.0046 (95% confidence level).
- Results agreed with manufacturer dispersion data, validating the method.
Conclusions:
- The developed method provides sample-specific and accurate group refractive index quantification.
- It uses the same Fourier domain interferometer intended for length calibration.
- This significantly reduces the requirements for calibration transfer standards.
Related Concept Videos
02:26Conservation of Protein Domains Over Different Proteins
14.7K
Protein domains are small structurally independent units that are part of a single amino acid chain. Although these domains are often structurally independent, they may rely on synergistic effects to perform their functions as part of a larger protein. Protein domains may be conserved within the same organism, as well as across different organisms.
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to...
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to...
14.7K
01:17Trigonometric Fourier series
838
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...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
838
01:21Convergence of Fourier Series
439
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...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
439
01:10Fast Fourier Transform
978
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
978
01:24Exponential Fourier series
784
In audio signal processing, the exponential Fourier series plays a crucial role in sound synthesis, allowing complex sounds to be broken down into simpler sinusoidal components. This decomposition process is fundamental in analyzing and reconstructing musical notes and other audio signals. The exponential Fourier series expresses periodic signals as the sum of complex exponentials at both positive and negative harmonic frequencies, providing a powerful tool for signal analysis.
Euler's identity...
Euler's identity...
784
01:20Properties of Fourier series I
806
The Fourier series is a powerful tool in signal processing and communications, allowing periodic signals to be expressed as sums of sine and cosine functions. A foundational property of the Fourier series is linearity. If we consider two periodic signals, their linear combination results in a new signal whose Fourier coefficients are simply the corresponding linear combinations of the original signals' coefficients. This property is crucial in applications like frequency modulation (FM) radio,...
806