kopia lustrzana https://github.com/kosme/arduinoFFT
Allow performing bit reversal on the complex part of the input
rodzic
7f340769fa
commit
7f7bf6efa0
|
@ -25,7 +25,7 @@
|
|||
"email": "bim.overbohm@googlemail.com"
|
||||
}
|
||||
],
|
||||
"version": "2.0.3",
|
||||
"version": "2.0.4",
|
||||
"frameworks": ["arduino","mbed","espidf"],
|
||||
"platforms": "*",
|
||||
"headers": "arduinoFFT.h"
|
||||
|
|
|
@ -1,9 +1,9 @@
|
|||
name=arduinoFFT
|
||||
version=2.0.3
|
||||
version=2.0.4
|
||||
author=Enrique Condes <enrique@shapeoko.com>
|
||||
maintainer=Enrique Condes <enrique@shapeoko.com>
|
||||
sentence=A library for implementing floating point Fast Fourier Transform calculations on the Arduino framework.
|
||||
paragraph=With this library you can calculate the dominant frequency of a sampled signal.
|
||||
paragraph=With this library you can calculate the frequencies present on a sampled signal.
|
||||
category=Data Processing
|
||||
url=https://github.com/kosme/arduinoFFT
|
||||
architectures=*
|
||||
|
|
|
@ -82,6 +82,9 @@ void ArduinoFFT<T>::compute(T *vReal, T *vImag, uint_fast16_t samples,
|
|||
for (uint_fast16_t i = 0; i < (samples - 1); i++) {
|
||||
if (i < j) {
|
||||
swap(&vReal[i], &vReal[j]);
|
||||
#ifdef COMPLEX_INPUT
|
||||
swap(&vImag[i], &vImag[j]);
|
||||
#endif
|
||||
if (dir == FFTDirection::Reverse)
|
||||
swap(&vImag[i], &vImag[j]);
|
||||
}
|
||||
|
|
Ładowanie…
Reference in New Issue