Fast recursive algorithm for broadband APFs using complex cepstrums

Related Experiment Video

Updated: Jun 22, 2026

Rapid Repetition Rate Fluctuation Measurement of Soliton Crystals in a Microresonator
07:42

Rapid Repetition Rate Fluctuation Measurement of Soliton Crystals in a Microresonator

Published on: December 15, 2021

P B Phua, E Ippen

    Optics Express
    |June 2, 2009
    PubMed

    More Related Videos

    High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis13:31

    High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis

    Published on: December 22, 2015

    Related Concept Videos

    Reconstruction of Signal using Interpolation01:10

    Reconstruction of Signal using Interpolation

    Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...
    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...
    Linear Approximation in Frequency Domain01:26

    Linear Approximation in Frequency Domain

    Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
    In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
    Upsampling01:22

    Upsampling

    Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
    Bandpass Sampling01:17

    Bandpass Sampling

    In signal processing, bandpass sampling is an effective technique for sampling signals that have most of their energy concentrated within a narrow frequency band. This type of signal is known as a bandpass signal. The key principle of bandpass sampling involves sampling the signal at a rate that is greater than twice the signal's bandwidth to prevent aliasing.
    A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...
    Aliasing01:18

    Aliasing

    Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
    If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...