相关实验视频

Updated: May 14, 2025

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
06:25

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

8.4K

低复杂性快速融合载体辅助相位检索与自适应加权因子

Pengfei Li, Chenglin Bai, Yuting Wu

    Optics express
    |April 12, 2025
    PubMed
    概括

    一种新的自适应加权因子方法改善了光通信系统的载体辅助相位检索 (CA-PR). 这种技术提高了信号重建的准确性,并减少了计算复杂性,使光学接收器更高效.

    更多相关视频

    Retrospective Cardiac Gating with A Prototype Small-Animal X-ray Computed Tomograph05:31

    Retrospective Cardiac Gating with A Prototype Small-Animal X-ray Computed Tomograph

    Published on: February 21, 2025

    179
    Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator08:39

    Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator

    Published on: January 28, 2019

    9.7K

    相关概念视频

    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...
    151
    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...
    103
    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...
    226
    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...
    171