関連する実験動画

Updated: Aug 16, 2026

High-definition Fourier Transform Infrared (FT-IR) Spectroscopic Imaging of Human Tissue Sections towards Improving Pathology
11:05

High-definition Fourier Transform Infrared (FT-IR) Spectroscopic Imaging of Human Tissue Sections towards Improving Pathology

Published on: January 21, 2015

フーリエ変換スペクトロスコピー

E D Becker, T C Farrar

    Science (New York, N.Y.)
    |October 27, 1972
    PubMed
    まとめ

    フーリエ変換 (FT) 方法は,データを迅速に取得することにより,光譜学に革命を起こしています. これにより,一時的な種の研究が可能になり,特に炭素13 (13C) のような低感度核の信号対ノイズ比が改善されます.

    さらに関連する動画

    Ensemble Force Spectroscopy by Shear Forces07:30

    Ensemble Force Spectroscopy by Shear Forces

    Published on: July 26, 2022

    A Multimodal Wide-Field Fourier-Transform Raman Microscope06:48

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    関連する概念動画

    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...
    Discrete-Time Fourier Series01:20

    Discrete-Time Fourier Series

    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]...
    Basic signals of Fourier Transform01:07

    Basic signals of Fourier Transform

    The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
    The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
    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...
    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...
    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...