1,192
edits
2622: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
| Line 19: | Line 19: | ||
'''[[wikipedia:Fast_Fourier_transform|Fast Fourier transform]]''' is an algorithm that computes the [[wikipedia:Discrete_Fourier_transform|descrete Fourier transform]] (DFT) of a sequence, or its inverse (IDFT). [[Wikipedia:Fourier_analysis|Fourier analysis]] converts a signal from its original domain (often time or space) to a representation in the [[Wikipedia:Frequency_domain|frequency domain]] and vice versa.. | '''[[wikipedia:Fast_Fourier_transform|Fast Fourier transform]]''' is an algorithm that computes the [[wikipedia:Discrete_Fourier_transform|descrete Fourier transform]] (DFT) of a sequence, or its inverse (IDFT). [[Wikipedia:Fourier_analysis|Fourier analysis]] converts a signal from its original domain (often time or space) to a representation in the [[Wikipedia:Frequency_domain|frequency domain]] and vice versa.. | ||
[[File:FFT_of_Cosine_Summation_Function.png|200px|Fourier analysis]] | |||
Front panel inputs/outputs are: CH1 and CH2 each with a [[BNC connector]] (1 MΩ; 200 pF; ±30 V); OUTPUT [[BNC connector]] (50Ω; ±10 V; signal general output capable of a variety of pre-defined, as well as user-defined, signals.) | Front panel inputs/outputs are: CH1 and CH2 each with a [[BNC connector]] (1 MΩ; 200 pF; ±30 V); OUTPUT [[BNC connector]] (50Ω; ±10 V; signal general output capable of a variety of pre-defined, as well as user-defined, signals.) | ||