mirror of
https://git.rwth-aachen.de/acs/public/villas/node/
synced 2025-03-09 00:00:00 +01:00
First peliminary revision of dft algorithm
This commit is contained in:
parent
df690ad859
commit
f3eb17b0d5
2 changed files with 187 additions and 0 deletions
|
@ -24,6 +24,7 @@ set(HOOK_SRC
|
|||
average.cpp
|
||||
cast.cpp
|
||||
decimate.cpp
|
||||
dft.cpp
|
||||
dp.cpp
|
||||
drop.cpp
|
||||
dump.cpp
|
||||
|
|
186
lib/hooks/dft.cpp
Normal file
186
lib/hooks/dft.cpp
Normal file
|
@ -0,0 +1,186 @@
|
|||
/** DFT hook.
|
||||
*
|
||||
* @author Manuel Pitz <manuel.pitz@eonerc.rwth-aachen.de>
|
||||
* @copyright 2014-2020, Institute for Automation of Complex Power Systems, EONERC
|
||||
* @license GNU General Public License (version 3)
|
||||
*
|
||||
* VILLASnode
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*********************************************************************************/
|
||||
|
||||
/** @addtogroup hooks Hook functions
|
||||
* @{
|
||||
*/
|
||||
|
||||
#include <cstring>
|
||||
|
||||
#include <villas/hook.hpp>
|
||||
#include <villas/path.h>
|
||||
#include <villas/sample.h>
|
||||
#include <villas/io.h>
|
||||
#include <villas/plugin.h>
|
||||
#include <complex>
|
||||
|
||||
namespace villas {
|
||||
namespace node {
|
||||
|
||||
class DftHook : public Hook {
|
||||
|
||||
protected:
|
||||
struct format_type *format;
|
||||
|
||||
//double* smp_memory;
|
||||
double smp_memory[200];
|
||||
|
||||
uint smp_mem_pos;
|
||||
uint smp_mem_size;
|
||||
|
||||
std::complex<double> dftMatrix[200][200];
|
||||
std::complex<double> omega;
|
||||
std::complex<double> M_I;
|
||||
std::complex<double> dftResults[200];
|
||||
double absDftResults[200];
|
||||
|
||||
public:
|
||||
DftHook(struct vpath *p, struct node *n, int fl, int prio, bool en = true) :
|
||||
Hook(p, n, fl, prio, en),
|
||||
smp_mem_pos(0),
|
||||
smp_mem_size(200),
|
||||
M_I(0.0,1.0)
|
||||
{
|
||||
format = format_type_lookup("villas.human");
|
||||
}
|
||||
|
||||
virtual void prepare(){
|
||||
|
||||
struct signal *freq_sig;
|
||||
struct signal *ampl_sig;
|
||||
struct signal *phase_sig;
|
||||
|
||||
/* Add signals */
|
||||
freq_sig = signal_create("amplitude", nullptr, SignalType::FLOAT);
|
||||
ampl_sig = signal_create("phase", nullptr, SignalType::FLOAT);
|
||||
phase_sig = signal_create("frequency", nullptr, SignalType::FLOAT);
|
||||
|
||||
|
||||
if (!freq_sig || !ampl_sig || !phase_sig)
|
||||
throw RuntimeError("Failed to create new signals");
|
||||
|
||||
|
||||
vlist_push(&signals, freq_sig);
|
||||
vlist_push(&signals, ampl_sig);
|
||||
vlist_push(&signals, phase_sig);
|
||||
|
||||
|
||||
//offset = vlist_length(&signals) - 1;//needs to be cleaned up
|
||||
|
||||
genDftMatrix();
|
||||
|
||||
|
||||
|
||||
state = State::PREPARED;
|
||||
|
||||
}
|
||||
|
||||
|
||||
virtual void start()
|
||||
{
|
||||
|
||||
assert(state == State::PREPARED || state == State::STOPPED);
|
||||
|
||||
//smp_memory = new double[smp_mem_size];
|
||||
if (!smp_memory)
|
||||
throw MemoryAllocationError();
|
||||
|
||||
for(uint i = 0; i < smp_mem_size; i++)
|
||||
smp_memory[i] = 0;
|
||||
|
||||
|
||||
|
||||
state = State::STARTED;
|
||||
}
|
||||
|
||||
virtual void stop()
|
||||
{
|
||||
assert(state == State::STARTED);
|
||||
|
||||
|
||||
state = State::STOPPED;
|
||||
}
|
||||
|
||||
virtual void parse(json_t *cfg)
|
||||
{
|
||||
|
||||
assert(state != State::STARTED);
|
||||
|
||||
Hook::parse(cfg);
|
||||
|
||||
state = State::PARSED;
|
||||
}
|
||||
|
||||
virtual Hook::Reason process(sample *smp)
|
||||
{
|
||||
assert(state == State::STARTED);
|
||||
|
||||
smp_memory[smp_mem_pos % smp_mem_size] = smp->data[1].f;
|
||||
smp_mem_pos ++ ;
|
||||
|
||||
|
||||
calcDft();
|
||||
|
||||
for(uint i=0; i<smp_mem_size; i++){
|
||||
absDftResults[i] = abs(dftResults[i]);
|
||||
}
|
||||
return Reason::OK;
|
||||
}
|
||||
|
||||
virtual ~DftHook()
|
||||
{
|
||||
//delete smp_memory;
|
||||
}
|
||||
|
||||
|
||||
void genDftMatrix(){
|
||||
using namespace std::complex_literals;
|
||||
|
||||
omega = exp((-2 * M_PI * M_I) / (double)smp_mem_size);
|
||||
|
||||
for( uint i=0 ; i < smp_mem_size ; i++){
|
||||
for( uint j=0 ; j < smp_mem_size ; j++){
|
||||
dftMatrix[i][j] = pow(omega, i * j);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void calcDft(){
|
||||
for( uint i=0; i < smp_mem_size; i++){
|
||||
dftResults[i] = 0;
|
||||
for(uint j=0; j < smp_mem_size; j++){
|
||||
dftResults[i]+= smp_memory[( j + smp_mem_pos ) % smp_mem_size] * dftMatrix[i][j];
|
||||
}
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
/* Register hook */
|
||||
static char n[] = "dft";
|
||||
static char d[] = "This hook calculates the dft on a window";
|
||||
static HookPlugin<DftHook, n, d, (int) Hook::Flags::NODE_READ | (int) Hook::Flags::NODE_WRITE | (int) Hook::Flags::PATH> p;
|
||||
|
||||
} /* namespace node */
|
||||
} /* namespace villas */
|
||||
|
||||
/** @} */
|
||||
|
Loading…
Add table
Reference in a new issue