Home
last modified time | relevance | path

Searched refs:FFT (Results 1 – 25 of 2461) sorted by relevance

12345678910>>...99

/dports/astro/gpstk/GPSTk-8.0.0/data/
H A Drstats_27.exp6 FFT 0 0.00000000 0.06359907 0.00000000 0.00000000 345600.00000000 0.00000000
7 FFT 1 0.00347220 0.06209907 0.33333547 0.01102914 345900.00000000 2.99998080
8 FFT 2 0.00694440 0.06019907 0.66667093 0.00278248 346200.00000000 1.49999040
9 FFT 3 0.01041660 0.05759907 1.00000640 0.03543319 346500.00000000 0.99999360
10 FFT 4 0.01388880 0.05539907 1.33334187 0.00804867 346800.00000000 0.74999520
11 FFT 5 0.01736100 0.05209907 1.66667733 0.00039647 347100.00000000 0.59999616
12 FFT 6 0.02083320 0.04849907 2.00001280 0.01644086 347400.00000000 0.49999680
13 FFT 7 0.02430540 0.04529907 2.33334827 0.01558325 347700.00000000 0.42856869
14 FFT 8 0.02777760 0.04169907 2.66668373 0.00193160 348000.00000000 0.37499760
15 FFT 9 0.03124980 0.03839907 3.00001920 0.02424504 348300.00000000 0.33333120
[all …]
/dports/math/openturns/openturns-1.18/lib/src/Base/Algo/
H A DFFT.cxx27 CLASSNAMEINIT(FFT) in CLASSNAMEINIT() argument
30 FFT::FFT() in CLASSNAMEINIT()
37 FFT::FFT(const FFTImplementation & implementation) in FFT() function in FFT
44 FFT::FFT(const Implementation & p_implementation) in FFT() function in FFT
51 FFT::FFT(FFTImplementation * p_implementation) in FFT() function in FFT
59 FFT::ComplexCollection FFT::transform(const ScalarCollection & collection) const in transform()
65 FFT::ComplexCollection FFT::transform(const ScalarCollection & collection, in transform()
73 FFT::ComplexCollection FFT::transform(const ScalarCollection & collection, in transform()
82 FFT::ComplexCollection FFT::transform(const ComplexCollection & collection) const in transform()
88 FFT::ComplexCollection FFT::transform(const ComplexCollection & collection, in transform()
[all …]
/dports/comms/liquid-dsp/liquid-dsp-1.3.2/src/fft/src/
H A Dfft_common.c31 struct FFT(plan_s) in FFT() function
43 FFT(_execute_t) * execute; in FFT()
109 FFT(plan) FFT(_create_plan)(unsigned int _nfft, in FFT() function
151 void FFT(_destroy_plan)(FFT(plan) _q) in FFT() function
194 void FFT(_print_plan)(FFT(plan) _q) in FFT() function
242 void FFT(_print_plan_recursive)(FFT(plan) _q, in FFT() function
285 void FFT(_execute)(FFT(plan) _q) in FFT() function
304 FFT(plan) plan = FFT(_create_plan)(_nfft, _x, _y, _dir, _flags); in FFT()
307 FFT(_execute)(plan); in FFT()
326 FFT(plan) plan = FFT(_create_plan_r2r_1d)(_nfft, _x, _y, _type, _flags); in FFT()
[all …]
H A Dfft_r2r_1d.c45 FFT(plan) q = (FFT(plan)) malloc(sizeof(struct FFT(plan_s))); in FFT()
75 void FFT(_destroy_plan_r2r_1d)(FFT(plan) _q) in FFT() function
82 void FFT(_print_plan_r2r_1d)(FFT(plan) _q) in FFT() function
93 void FFT(_execute_REDFT00)(FFT(plan) _q) in FFT() function
114 void FFT(_execute_REDFT10)(FFT(plan) _q) in FFT() function
133 void FFT(_execute_REDFT01)(FFT(plan) _q) in FFT() function
152 void FFT(_execute_REDFT11)(FFT(plan) _q) in FFT() function
175 void FFT(_execute_RODFT00)(FFT(plan) _q) in FFT() function
194 void FFT(_execute_RODFT10)(FFT(plan) _q) in FFT() function
213 void FFT(_execute_RODFT01)(FFT(plan) _q) in FFT() function
[all …]
H A Dfft_rader.c47 FFT(plan) FFT(_create_plan_rader)(unsigned int _nfft, in FFT() function
54 FFT(plan) q = (FFT(plan)) malloc(sizeof(struct FFT(plan_s))); in FFT()
64 q->execute = FFT(_execute_rader); in FFT()
71 q->data.rader.fft = FFT(_create_plan)(q->nfft-1, in FFT()
99 FFT(_execute)(q->data.rader.fft); in FFT()
110 void FFT(_destroy_plan_rader)(FFT(plan) _q) in FFT() function
118 FFT(_destroy_plan)(_q->data.rader.fft); in FFT()
119 FFT(_destroy_plan)(_q->data.rader.ifft); in FFT()
126 void FFT(_execute_rader)(FFT(plan) _q) in FFT() function
138 FFT(_execute)(_q->data.rader.fft); in FFT()
[all …]
H A Dfft_mixed_radix.c42 FFT(plan) FFT(_create_plan_mixed_radix)(unsigned int _nfft, in FFT() function
49 FFT(plan) q = (FFT(plan)) malloc(sizeof(struct FFT(plan_s))); in FFT()
59 q->execute = FFT(_execute_mixed_radix); in FFT()
63 unsigned int Q = FFT(_estimate_mixed_radix)(_nfft); in FFT()
111 void FFT(_destroy_plan_mixed_radix)(FFT(plan) _q) in FFT() function
114 FFT(_destroy_plan)(_q->data.mixedradix.fft_P); in FFT()
115 FFT(_destroy_plan)(_q->data.mixedradix.fft_Q); in FFT()
128 void FFT(_execute_mixed_radix)(FFT(plan) _q) in FFT() function
156 FFT(_execute)(_q->data.mixedradix.fft_P); in FFT()
179 FFT(_execute)(_q->data.mixedradix.fft_Q); in FFT()
[all …]
H A Dfft_rader2.c46 FFT(plan) FFT(_create_plan_rader2)(unsigned int _nfft, in FFT() function
53 FFT(plan) q = (FFT(plan)) malloc(sizeof(struct FFT(plan_s))); in FFT()
63 q->execute = FFT(_execute_rader2); in FFT()
136 q->data.rader2.fft = FFT(_create_plan)(q->data.rader2.nfft_prime, in FFT()
155 FFT(_execute)(q->data.rader2.fft); in FFT()
166 void FFT(_destroy_plan_rader2)(FFT(plan) _q) in FFT() function
175 FFT(_destroy_plan)(_q->data.rader2.fft); in FFT()
176 FFT(_destroy_plan)(_q->data.rader2.ifft); in FFT()
183 void FFT(_execute_rader2)(FFT(plan) _q) in FFT() function
207 FFT(_execute)(_q->data.rader2.fft); in FFT()
[all …]
/dports/audio/spectmorph/spectmorph-0.5.2/tests/
H A Dtestfft.cc56 float *in = FFT::new_array_float (block_size); in main()
58 float *out = FFT::new_array_float (block_size); in main()
72 FFT::use_gsl_fft (false); in main()
73 FFT::fftar_float (block_size, in, out); in main()
74 FFT::fftsr_float (block_size, out, back); in main()
81 FFT::fftac_float (block_size, in_x, out_x); in main()
84 FFT::use_gsl_fft (true); in main()
85 FFT::fftar_float (block_size, in, out_gsl); in main()
101 FFT::use_gsl_fft (false); in main()
102 FFT::fftac_float (block_size / 2, in, out); in main()
[all …]
H A Dtestfftperf.cc19 FFT::fftar_float (block_size, in, out); in time_fftar()
25 FFT::fftsr_float (block_size, in, out); in time_fftsr()
31 FFT::fftac_float (block_size / 2, in, out); in time_fftac()
37 FFT::fftsc_float (block_size / 2, in, out); in time_fftsc()
62 FFT::use_gsl_fft (false); in compare()
65 FFT::use_gsl_fft (true); in compare()
79 in = FFT::new_array_float (block_size); in main()
80 out = FFT::new_array_float (block_size); in main()
94 FFT::free_array_float (in); in main()
95 FFT::free_array_float (out); in main()
/dports/comms/liquid-dsp/liquid-dsp-1.3.2/include/
H A Dliquid.internal.h684 void FFT(_print_plan_recursive)(FFT(plan) _q, \
688 typedef FFT(plan)(FFT(_create_t)) (unsigned int _nfft, \
693 typedef void (FFT(_destroy_t))(FFT(plan) _q); \
694 typedef void (FFT(_execute_t))(FFT(plan) _q); \
697 FFT(_create_t) FFT(_create_plan_dft); \
698 FFT(_create_t) FFT(_create_plan_radix2); \
699 FFT(_create_t) FFT(_create_plan_mixed_radix); \
700 FFT(_create_t) FFT(_create_plan_rader); \
701 FFT(_create_t) FFT(_create_plan_rader2); \
704 FFT(_destroy_t) FFT(_destroy_plan_dft); \
[all …]
/dports/audio/supercollider/SuperCollider-3.11.0-Source/HelpSource/Classes/
H A DFFT.schelp1 class:: FFT
3 related:: Classes/IFFT, Guides/FFT-Overview
4 categories:: UGens>FFT
27 See also link::Guides/FFT-Overview#Multichannel Expansion with FFT UGens::.
59 The FFT chain
76 chain = FFT(LocalBuf(2048), in);
77 IFFT(chain) // inverse FFT
86 chain = FFT(LocalBuf(2048), in);
88 IFFT(chain) // inverse FFT
96 chain = FFT(LocalBuf(2048), in);
[all …]
H A DIFFT.schelp3 related:: Classes/FFT, Guides/FFT-Overview
4 categories:: UGens>FFT
11 …often this is used as the end of a process which begins with link::Classes/FFT::, followed by freq…
16 returns a time domain signal from converting the FFT frequency domain signal chain. The *new method…
20 The FFT "chain" signal coming originally from an FFT UGen, perhaps via other PV UGens.
31 Can be used to account for zero-padding, in the same way as the link::Classes/FFT:: UGen.
37 The IFFT UGen converts the FFT data in-place (in the original FFT buffer) and overlap-adds the resu…
43 // without any modification, convert FFT chain (frequency domain signal) back to audio (time domain…
47 chain = FFT(LocalBuf(2048), in);
48 IFFT.ar(chain) * -20.dbamp // inverse FFT
/dports/lang/oo2c/oo2c_64-2.1.11/tests/benchmark/src/
H A DFFTDriver.Mod7 FFT, FFTC;
20 (* Complex array for FFT *)
46 | 0 : (* FFT *)
49 FFT.FFT(a, TRUE); (* forward *)
50 FFT.FFT(a, FALSE); (* reverse *)
56 FFTC.FFT(a, LEN(a), TRUE); (* forward *)
57 FFTC.FFT(a, LEN(a), FALSE); (* reverse *)
63 FFT.FFT2(a, TRUE); (* forward *)
64 FFT.FFT2(a, FALSE); (* reverse *)
85 info[0].name := "FFT";
[all …]
/dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/rustfft-3.0.1/src/
H A Dplan.rs7 use FFT;
51 algorithm_cache: HashMap<usize, Arc<FFT<T>>>,
69 pub fn plan_fft(&mut self, len: usize) -> Arc<FFT<T>> { in plan_fft()
71 Arc::new(DFT::new(len, self.inverse)) as Arc<FFT<T>> in plan_fft()
97 fn plan_fft_with_factors(&mut self, len: usize, factors: &[usize]) -> Arc<FFT<T>> { in plan_fft_with_factors()
167 -> Arc<FFT<T>> { in plan_mixed_radix()
188 Arc::new(MixedRadix::new(left_fft, right_fft)) as Arc<FFT<T>> in plan_mixed_radix()
193 fn plan_fft_single_factor(&mut self, len: usize) -> Arc<FFT<T>> { in plan_fft_single_factor()
195 0|1 => Arc::new(DFT::new(len, self.inverse)) as Arc<FFT<T>>, in plan_fft_single_factor()
209 fn plan_prime(&mut self, len: usize) -> Arc<FFT<T>> { in plan_prime()
[all …]
/dports/audio/supercollider/SuperCollider-3.11.0-Source/HelpSource/Guides/
H A DFFT-Overview.schelp1 title:: FFT Overview
3 categories:: UGens>FFT
4 related:: Classes/FFT, Classes/IFFT
6 section:: FFT and IFFT
10 chain = FFT(buffer, input)
37 // it is the FFT buffer number
129 subsection::Copying FFT chains
183 chain = FFT(c, in);
250 chain = FFT(LocalBuf([2048, 2048]), in); // each FFT has a different buffer
266 chain = FFT(bufnum, in); // each FFT has a different buffer
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/cmake/Modules/Packages/
H A DKSPACE.cmake9 set(FFT "FFTW3" CACHE STRING "FFT library for KSPACE package") variable
11 set(FFT "KISS" CACHE STRING "FFT library for KSPACE package") variable
14 set_property(CACHE FFT PROPERTY STRINGS ${FFT_VALUES})
15 validate_option(FFT FFT_VALUES)
16 string(TOUPPER ${FFT} FFT)
18 if(FFT STREQUAL "FFTW3")
25 option(FFT_FFTW_THREADS "Use threaded FFT library" OFF)
36 elseif(FFT STREQUAL "MKL")
39 option(FFT_MKL_THREADS "Use threaded MKL FFT" ON)
49 set(FFT_PACK "array" CACHE STRING "Optimization for FFT")
/dports/net-mgmt/librenms/librenms-21.5.1/mibs/arris/
H A DARRIS-CMTS-FFT-MIB1 ARRIS-CMTS-FFT-MIB DEFINITIONS ::= BEGIN
28 "This MIB manages the FFT software on the Arris CMTS"
40 that supports FFT collection and reporting."
49 "Arris FFT upstream channel entry."
93 "FFT sample rate based on the input source to the FFT. The input to the FFT
136 time-domain I/Q format ii. FFT data in I/Q format iii. FFT
210 zero to trigger FFT continuously."
250 "Number of FFT triggers since the last FFT process was
259 "A buffer that contains upstream FFT payload data."
267 "Arris CMTS FFT upstream channel payload table."
[all …]
/dports/net-mgmt/observium/observium/mibs/arris/
H A DARRIS-CMTS-FFT-MIB1 ARRIS-CMTS-FFT-MIB DEFINITIONS ::= BEGIN
28 "This MIB manages the FFT software on the Arris CMTS"
40 that supports FFT collection and reporting."
49 "Arris FFT upstream channel entry."
93 "FFT sample rate based on the input source to the FFT. The input to the FFT
136 time-domain I/Q format ii. FFT data in I/Q format iii. FFT
210 zero to trigger FFT continuously."
250 "Number of FFT triggers since the last FFT process was
259 "A buffer that contains upstream FFT payload data."
267 "Arris CMTS FFT upstream channel payload table."
[all …]
/dports/audio/sc3-plugins/sc3-plugins-Version-3.9.0/source/MCLDUGens/sc/
H A DMCLDFFTUGens.sc2 * Lots of FFT-based ugens for SC
30 *categories { ^ #["UGens>Analysis", "UGens>FFT"] }
38 *categories { ^ #["UGens>Analysis", "UGens>FFT"] }
47 *categories { ^ #["UGens>Analysis", "UGens>FFT"] }
55 *categories { ^ #["UGens>Analysis", "UGens>FFT"] }
72 *categories { ^ #["UGens>Analysis", "UGens>FFT"] }
89 *categories { ^ #["UGens>Analysis", "UGens>FFT"] }
97 *categories { ^ #["UGens>Analysis", "UGens>FFT"] }
204 *categories { ^ #["UGens>FFT"] }
212 *categories { ^ #["UGens>FFT"] }
[all …]
/dports/graphics/dataplot/dataplot-2c1b27601a3b7523449de612613eadeead9a8f70/lib/frmenus/math/
H A Dfft.men4 1. Discrete Fast Fourier Transform (FFT)
5 2. LET YR YC = FFT Y
7 4. Variable containing real component for which to compute the FFT:
10 6. FFT (optional):
12 7. Variable to store the real component of the FFT:
14 8. Variable to store the complex component of the FFT:
17 10. Plot FFT?:
25 18. Compute the FFT?:
28 LET _3 _4 = FFT _1 _2 _6
40 WEB HELP FFT
H A Difft.men4 1. Inverse Discrete Fast Fourier Transform (FFT)
5 2. LET YR YC = INVERSE FFT XR XC
8 5. compute the inverse FFT:
11 7. compute the inverse FFT (optional):
13 8. Variable to store the real component of the inverse FFT:
15 9. Variable to store the complex component of the inverse FFT:
22 15. Compute the inverse FFT?:
25 LET _3 _4 = INVERSE FFT _1 _2 _5
27 WEB HELP INVERSE FFT
/dports/math/openturns/openturns-1.18/python/src/
H A DFFT_doc.i.in1 // FFT docstrings are defined in FFTImplementation_doc.i.in
3 %feature("docstring") OT::FFT
5 %feature("docstring") OT::FFT::transform
7 %feature("docstring") OT::FFT::inverseTransform
9 %feature("docstring") OT::FFT::transform2D
11 %feature("docstring") OT::FFT::inverseTransform2D
13 %feature("docstring") OT::FFT::transform3D
15 %feature("docstring") OT::FFT::inverseTransform3D
/dports/devel/juce/JUCE-f37e9a1/modules/juce_dsp/frequency/
H A Djuce_FFT.h44 class JUCE_API FFT
51 FFT (int order);
54 FFT (FFT&&) noexcept;
57 FFT& operator= (FFT&&) noexcept;
60 ~FFT();
123 JUCE_DECLARE_NON_COPYABLE_WITH_LEAK_DETECTOR (FFT)
/dports/audio/spectmorph/spectmorph-0.5.2/lib/
H A Dsmifftsynth.cc37 float *win = FFT::new_array_float (win_size); in decode()
38 float *wspectrum = FFT::new_array_float (win_size); in decode()
49 FFT::fftar_float (block_size * zero_padding, win, wspectrum, FFT::PLAN_ESTIMATE); in decode()
60 FFT::free_array_float (win); in decode()
61 FFT::free_array_float (wspectrum); in decode()
63 table->win_scale = FFT::new_array_float (block_size); // SSE in decode()
83 fft_in = FFT::new_array_float (block_size); in decode()
84 fft_out = FFT::new_array_float (block_size); in decode()
91 FFT::free_array_float (fft_in);
92 FFT::free_array_float (fft_out);
[all …]
/dports/audio/zrythm/zrythm-1.0.0-alpha.26.0.13/ext/qm-dsp/tests/
H A DTestFFT.cpp39 FFT(4).process(false, in, 0, re+1, im+1); in BOOST_AUTO_TEST_CASE()
127 FFT(4).process(false, in, 0, re, im); in BOOST_AUTO_TEST_CASE()
167 FFT(4).process(false, rin, iin, re, im); in BOOST_AUTO_TEST_CASE()
189 FFT(4).process(false, in, 0, re, im); in BOOST_AUTO_TEST_CASE()
228 FFT(4).process(false, in, 0, re, im); in BOOST_AUTO_TEST_CASE()
268 FFT(4).process(false, rin, iin, re, im); in BOOST_AUTO_TEST_CASE()
290 FFT(4).process(false, in, 0, re, im); in BOOST_AUTO_TEST_CASE()
335 FFT(4).process(false, rin, iin, re, im); in BOOST_AUTO_TEST_CASE()
353 FFT(4).process(false, in, 0, re, im); in BOOST_AUTO_TEST_CASE()
390 FFT(4).process(false, in, 0, re, im); in BOOST_AUTO_TEST_CASE()
[all …]

12345678910>>...99