Multivariate curve resolution of wavelet and Fourier compressed spectra

P B Harrington1, P J Rauch, C Cai

  • 1Center for Intelligent Chemical Instrumentation, Chemistry Department, Ohio University, Athens 45701-2979, USA.

Analytical Chemistry
|July 31, 2001
PubMed

Related Concept Videos

NMR Spectrometers: Resolution and Error Correction01:14

NMR Spectrometers: Resolution and Error Correction

When magnetic nuclei in a sample achieve resonance and undergo relaxation, the signal detected in NMR is an approximately exponential free induction decay. Fourier transform of an exponential decay yields a Lorentzian peak in the frequency domain. Lorentzian peaks in an NMR spectrum are defined by their amplitude, full width at half maximum, and position, where the peak width is governed by the spin-spin relaxation time alone. In real experiments, however, the applied magnetic field is rendered...
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, 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...
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...
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...