Related Experiment Video
Updated: Jan 29, 2026

05:57
Blood Flow Imaging with Ultrafast Doppler
Published on: October 14, 2020
8.5K
Ultrafast discrete swept source based on dual chirped combs for microscopic imaging
Optics Express
|February 9, 2019
Summary
A novel inertial-free, ultrafast frequency comb source uses two chirped optical frequency combs for stable, high-speed imaging. This discrete swept source offers enhanced sensitivity and a low-cost option for biomedical applications.
Area of Science:
- Optics and Photonics
- Biomedical Imaging
Background:
- Traditional swept sources often rely on mechanical components, limiting speed and stability.
- High-speed imaging demands sources with rapid wavelength tuning and narrow linewidths.
Purpose of the Study:
- To propose and demonstrate an inertial-free, ultrafast frequency comb source for advanced imaging.
- To achieve high-speed, high-resolution imaging with enhanced sensitivity and stability.
Main Methods:
- Utilized the Vernier effect between two chirped optical frequency combs (OFCs) for frequency sweeping, eliminating mechanical motion.
- Employed an extra-cavity frequency sweeping method to achieve a 1 MHz swept rate with a 0.03 nm instantaneous linewidth.
- Applied the discrete swept source to wavelength-encoded imaging.
Main Results:
- Achieved high linearity frequency sweeping with superior stability and reliability, requiring no recalibration.
- Demonstrated wavelength-encoded imaging with 4.4-μm spatial resolution at a 329-kHz frame rate.
- Reduced signal acquisition bandwidth from 3.8 GHz to below 90 MHz for equivalent spatial resolution compared to time-stretch microscopy.
Conclusions:
- The proposed discrete swept source offers a promising low-cost solution for high-speed biomedical imaging.
- The discrete sweeping feature allows for longer exposure times, benefiting imaging sensitivity.
- This technology enables high-accuracy spectroscopy and advanced biomedical imaging applications.
Related Concept Videos
Discrete Fourier Transform
897
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...
897
Discrete-time Fourier transform
1.1K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.1K
Basic Discrete Time Signals
709
The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
709
Discrete-Time Fourier Series
680
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]...
For a discrete-time periodic signal x[n]...
680
Convolution: Math, Graphics, and Discrete Signals
922
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
922
BIBO stability of continuous and discrete -time systems
918
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
918

