scholarly journals DEVELOPMENT AND PERFORMANCE OF LILLE'S FOURIER TRANSFORM MILLIMETER-WAVE SPECTROMETER

2019 ◽  
Author(s):  
Luyao Zou ◽  
E. Alekseev ◽  
L. Margulﾏs ◽  
R. Motiyenko
Keyword(s):  
Fourier Transform ◽  
Millimeter Wave ◽  
And Performance ◽  
Wave Spectrometer

A new Fourier transform millimeter wave spectrometer

1992 ◽  
Vol 63 (9) ◽  
pp. 4108-4111 ◽  
Author(s):  
R. Schwarz ◽  
A. Guarnieri ◽  
J.‐U. Grabow ◽  
J. Doose
Keyword(s):  
Fourier Transform ◽  
Millimeter Wave ◽  
Wave Spectrometer

scholarly journals The Rotational Spectrum of Propane Centrifugal Distortion Analysis

1985 ◽  
Vol 40 (5) ◽  
pp. 508-510 ◽  
Author(s):  
G. Bestmann ◽  
H. Dreizler ◽  
J. M. Vacherand ◽  
D. Boucher ◽  
B. P. van Eijck ◽  
...  
Keyword(s):  
Fourier Transform ◽  
Millimeter Wave ◽  
Ground State ◽  
Fourier Transform Spectrometer ◽  
Rotational Spectrum ◽  
Centrifugal Distortion ◽  
Astrophysical Interest ◽  
Distortion Analysis ◽  
Wave Spectrometer

The ground state rotational spectrum of propane has been investigated between 6.4 and 26.5 GHz with a microwave Fourier transform spectrometer and between 140 and 300 GHz with a millimeter-wave spectrometer. High J transitions have been measured and fitted to a centrifugally distorted Hamiltonian including some sextic coefficients. The results of the analysis are sufficiently accurate for the prediction of all strong transitions of astrophysical interest.

scholarly journals On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1117
Author(s):  
Bin Li ◽  
Zhikang Jiang ◽  
Jie Chen
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
High Efficiency ◽  
Theory And Practice ◽  
Long Time ◽  
And Performance ◽  
Binary Tree Search ◽  
The One ◽  
Sparse Fast Fourier Transform ◽  
L1 And L2

Computing the sparse fast Fourier transform (sFFT) has emerged as a critical topic for a long time because of its high efficiency and wide practicability. More than twenty different sFFT algorithms compute discrete Fourier transform (DFT) by their unique methods so far. In order to use them properly, the urgent topic of great concern is how to analyze and evaluate the performance of these algorithms in theory and practice. This paper mainly discusses the technology and performance of sFFT algorithms using the aliasing filter. In the first part, the paper introduces the three frameworks: the one-shot framework based on the compressed sensing (CS) solver, the peeling framework based on the bipartite graph and the iterative framework based on the binary tree search. Then, we obtain the conclusion of the performance of six corresponding algorithms: the sFFT-DT1.0, sFFT-DT2.0, sFFT-DT3.0, FFAST, R-FFAST, and DSFFT algorithms in theory. In the second part, we make two categories of experiments for computing the signals of different SNRs, different lengths, and different sparsities by a standard testing platform and record the run time, the percentage of the signal sampled, and the L0, L1, and L2 errors both in the exactly sparse case and the general sparse case. The results of these performance analyses are our guide to optimize these algorithms and use them selectively.

Sign in / Sign up

Export Citation Format

Share Document