| /external/eigen/unsupported/test/ |
| FFTW.cpp | 11 #include <unsupported/Eigen/FFT>
80 typedef typename FFT<T>::Complex Complex;
81 typedef typename FFT<T>::Scalar Scalar;
85 FFT<T> fft; local
93 fft.SetFlag(fft.HalfSpectrum );
94 fft.fwd( freqBuf,tbuf);
98 fft.ClearFlag(fft.HalfSpectrum )
146 FFT<T> fft; local
217 FFT<float> fft; local
[all...] |
| /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/ |
| FFT.java | 21 * This class computes FFT of inputting data.
27 public class FFT {
29 private double[] cos; // precomputed cosine tables for FFT
30 private double[] sin; // precomputed sine tables for FFT
34 FFT(int FFTSamplingSize) {
37 // set up variables needed for computing FFT
42 throw new RuntimeException("FFT sampling size must be power of 2");
56 * Do FFT, and store the result's real part to "x", imaginary part to "y".
58 public void fft(double[] x, double[] y, int sign) { method in class:FFT
83 // FFT
[all...] |
| GlitchDetectionThread.java | 33 // Measured in FFT samples
43 private double mDoubleBuffer[]; // keep the data used for FFT calculation
44 private boolean mIsFirstFFT = true; // whether or not it's the first FFT calculation
51 private final int mFFTSamplingSize; // amount of samples used to perform a FFT
53 private final int mNewSamplesPerFFT; // amount of new samples (not from last FFT) in a FFT
56 private final int[] mGlitches; // for every value = n, n is nth FFT where a glitch is found
58 private int mFFTCount; // store the current number of FFT performed
59 private FFT mFFT;
96 mFFT = new FFT(mFFTSamplingSize)
[all...] |
| /external/eigen/bench/ |
| benchFFT.cpp | 17 #include <unsupported/Eigen/FFT>
51 FFT< Scalar > fft; local
54 fft.SetFlag(fft.Unscaled);
58 fft.SetFlag(fft.HalfSpectrum);
64 fft.fwd( outbuf , inbuf);
72 fft.fwd( outbuf , inbuf);
75 fft.inv(inbuf,outbuf)
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| TensorFFT.h | 22 * \brief Tensor FFT class.
61 template <typename FFT, typename XprType, int FFTResultType, int FFTDir>
62 struct traits<TensorFFTOp<FFT, XprType, FFTResultType, FFTDir> > : public traits<XprType> {
76 template <typename FFT, typename XprType, int FFTResultType, int FFTDirection>
77 struct eval<TensorFFTOp<FFT, XprType, FFTResultType, FFTDirection>, Eigen::Dense> {
78 typedef const TensorFFTOp<FFT, XprType, FFTResultType, FFTDirection>& type;
81 template <typename FFT, typename XprType, int FFTResultType, int FFTDirection>
82 struct nested<TensorFFTOp<FFT, XprType, FFTResultType, FFTDirection>, 1, typename eval<TensorFFTOp<FFT, XprType, FFTResultType, FFTDirection> >::type> {
83 typedef TensorFFTOp<FFT, XprType, FFTResultType, FFTDirection> type
104 const FFT& fft() const { return m_fft; } function in class:Eigen::TensorFFTOp
[all...] |
| TensorForwardDeclarations.h | 43 template<typename FFT, typename XprType, int FFTDataType, int FFTDirection> class TensorFFTOp;
|
| TensorBase.h | 495 template <int FFTDataType, int FFTDirection, typename FFT> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
496 const TensorFFTOp<const FFT, const Derived, FFTDataType, FFTDirection>
497 fft(const FFT& fft) const { function in class:Eigen::TensorBase
498 return TensorFFTOp<const FFT, const Derived, FFTDataType, FFTDirection>(derived(), fft);
[all...] |
| /frameworks/av/media/libeffects/dynamicsproc/dsp/ |
| DPFrequency.h | 22 #include <unsupported/Eigen/FFT>
155 Eigen::FFT<float> mFftServer;
|
| /external/eigen/unsupported/doc/examples/ |
| FFT.cpp | 1 // To use the simple FFT implementation
2 // g++ -o demofft -I.. -Wall -O3 FFT.cpp
5 // g++ -o demofft -I.. -DUSE_FFTW -Wall -O3 FFT.cpp -lfftw3 -lfftw3f -lfftw3l
17 #include <unsupported/Eigen/FFT>
82 static FFT<Scalar> fft; local
83 fft.fwd(freqbuf,timebuf);
86 fft.inv(timebuf2,freqbuf);
|
| /external/adhd/scripts/mic_testing/frontend/ |
| analysis.js | 41 var fft = new FFT(length);
42 fft.forward(tmpBuffer);
43 return fft.spectrum;
240 * @param {Float32Array} fft buffer of a channel
290 var fftLeft = new FFT(leftData.length);
292 var fftRight = new FFT(rightData.length);
360 * FFT is a class for calculating the Discrete Fourier Transform of a signal
367 function FFT(bufferSize) {
403 FFT.prototype.forward = function(buffer)
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
| fft_ops.cc | 16 // XLA-specific Ops for FFT.
60 // Zero pad or truncate the axes we're doing FFT on.
91 // Innermost axis provides the FFT length.
98 xla::XlaOp fft = xla::Fft(input, fft_type_, fft_length); variable
99 ctx->SetOutput(0, fft);
114 : GenericFftOp(ctx, /*fft_type=*/FftType::FFT, /*fft_rank=*/FFTRank) {}
116 REGISTER_XLA_OP(Name("FFT").TypeConstraint("Tcomplex", DT_COMPLEX64), FFTOp<1>);
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| xla_data.proto | 517 FFT = 0; // Forward FFT; complex in, complex out.
518 IFFT = 1; // Inverse FFT; complex in, complex out.
519 RFFT = 2; // Forward real FFT; real in, fft_length / 2 + 1 complex out
520 IRFFT = 3; // Inverse real FFT; fft_length / 2 + 1 complex in,
|
| /external/tensorflow/tensorflow/compiler/xla/service/gpu/ |
| fft_thunk.cc | 63 se::fft::Type FftTypeToSeType(FftType type) {
65 case FftType::FFT:
66 return se::fft::Type::kC2CForward;
68 return se::fft::Type::kC2CInverse;
70 return se::fft::Type::kC2R;
72 return se::fft::Type::kR2C;
74 LOG(FATAL) << "unsupported fft type";
78 string FftTypeToString(se::fft::Type type) {
80 case se::fft::Type::kC2CForward:
81 return "FFT";
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/service/cpu/ |
| runtime_fft_impl.h | 33 // Computes either a forward or reverse complex-to-complex FFT.
56 output.device(device) = input.template fft<Eigen::BothParts, direction>(axes);
59 // Computes a forward real->complex FFT, slicing out redundant negative
86 // Compute the full FFT using a temporary tensor.
91 input.template fft<Eigen::BothParts, Eigen::FFT_FORWARD>(axes);
97 // Computes a reverse complex->real FFT, reconstructing redundant negative
122 // Calculate the shape of the temporary tensor for the full FFT and the
149 .template fft<Eigen::BothParts, Eigen::FFT_REVERSE>(outer_axes);
152 // Reconstruct the full FFT by appending reversed and conjugated
168 full_fft.template fft<Eigen::RealPart, Eigen::FFT_REVERSE>(inner_axis)
[all...] |
| /external/webrtc/webrtc/modules/audio_processing/ns/ |
| ns_core.c | 100 // Initialize FFT work arrays.
[all...] |
| /external/speex/libspeexdsp/ |
| fftwrap.c | 104 speex_warning("FFT should not be done in-place");
120 speex_warning("FFT should not be done in-place");
188 of the fft. */
226 fftwf_plan fft; member in struct:fftw_config
237 table->fft = fftwf_plan_dft_r2c_1d(size, table->in, (fftwf_complex *) table->out, FFTW_PATIENT);
247 fftwf_destroy_plan(t->fft);
266 fftwf_execute(t->fft);
357 #error No other FFT implemented
|
| /external/libxaac/decoder/armv7/ |
| ixheaacd_fft32x32_ld2_armv7.s | 9 @DIT Radix-4 FFT First Stage
161 @DIT Radix-4 FFT Second Stage
|
| /external/tensorflow/tensorflow/lite/models/testdata/g3doc/ |
| README.md | 46 typical signal processing algorithms, like FFT and spectral subtraction, and
|
| /external/speex/ |
| configure | [all...] |
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| hlo_instructions.h | 127 // Describes FFT type for an FFT instruction.
128 FftType fft_type_ = FftType::FFT;
130 // Indicates the FFT length for an FFT instruction.
[all...] |
| hlo_parser_test.cc | 699 // fft
701 "Fft",
704 ENTRY %Fft (input: c64[8,32]) -> c64[8,32] {
706 ROOT %fft = c64[8,32]{1,0} fft(c64[8,32]{1,0} %input), fft_type=FFT, fft_length={32}
718 ROOT %fft = c64[5,8,32]{2,1,0} fft(c64[5,8,32]{2,1,0} %input), fft_type=IFFT, fft_length={8,32}
730 ROOT %fft = c64[5,64,17]{2,1,0} fft(f32[5,64,32]{2,1,0} %input), fft_type=RFFT, fft_length={64,32
[all...] |
| shape_inference.cc | [all...] |
| /external/tensorflow/tensorflow/compiler/tests/ |
| randomized_tests.cc | [all...] |
| /external/tensorflow/tensorflow/go/op/ |
| wrappers.go | [all...] |
