IR spectrum of FHF- and FDF- revisited using a spectral method in four dimensions

Guillermo Pérez-Hernández1, Jesús González-Vázquez, Leticia González

  • 1Institut für Mathematik, Freie Universität Berlin, Arnimallee 6, 14195 Berlin, Germany.

Related Concept Videos

IR Frequency Region: Fingerprint Region01:03

IR Frequency Region: Fingerprint Region

IR spectra are divided into two main regions: the diagnostic region and the fingerprint region. The diagnostic region of the spectrum lies above 1500 cm−1. The absorptions resulting from single-bond vibrations of the N–H, C–H, and O–H stretch at higher wavenumbers and appear on the left side of the spectrum. The stretching absorptions of the C≡C and C≡N occur between 2100–2300 cm−1. In contrast, those arising from stretching absorptions of the C=O, C=N, and C=C occur between 1600–1850 cm−1.
The...
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...
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]...
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...
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

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...
2D NMR: Heteronuclear Single-Quantum Correlation Spectroscopy (HSQC)01:19

2D NMR: Heteronuclear Single-Quantum Correlation Spectroscopy (HSQC)

Heteronuclear single-quantum correlation spectroscopy (HSQC) is a 2D NMR technique that reveals one-bond correlations between hydrogen and a heteronucleus. The HSQC experiment is similar to the heteronuclear correlation experiment (HETCOR) but is more sensitive. In the HSQC spectrum, the proton chemical shift is plotted on the horizontal F2 axis, while the 13C chemical shift is plotted on the vertical F1 axis. The corresponding proton and 13C spectra are also shown. The HSQC contour plot does...