Files
GnuRadio/gr-jay/lib/peak_detect_impl.h
T
2019-05-25 07:47:01 +00:00

89 lines
2.3 KiB
C++

/* -*- c++ -*- */
/*
* Copyright 2019 Jay Arrowfield.
*
* This 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, or (at your option)
* any later version.
*
* This software 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 software; see the file COPYING. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street,
* Boston, MA 02110-1301, USA.
*/
#ifndef INCLUDED_JAY_PEAK_DETECT_IMPL_H
#define INCLUDED_JAY_PEAK_DETECT_IMPL_H
#include <jay/peak_detect.h>
namespace gr {
namespace jay {
class peak_detect_impl : public peak_detect
{
private:
float m_framerate;
float m_peak_height_min;
int m_peak_width_min;
int m_peak_width_max;
float m_alpha_s;
float m_alpha_m;
float *m_pPeakData;
float *m_pX;
float *m_pXs;
float *m_pXm;
float *m_pXd;
int *m_pPeakPos;
int *m_pPeakPos_final;
float *m_pPeakBox_rel;
float *m_pPeakBox_abs;
uint64_t m_frameCount;
pmt::pmt_t m_tag_id;
public:
peak_detect_impl(int vlen, float framerate, float peak_height_min, int peak_width_min, int peak_width_max, float alpha_s, float alpha_m);
~peak_detect_impl();
// Where all the action really happens
int work(int noutput_items, gr_vector_const_void_star &input_items, gr_vector_void_star &output_items);
private:
void fill(float *pDst, int length, float value);
float mean(float *pSrc, int length);
int threshold(float *pDst, float *pSrc, int length, float thresh);
int findPeakPos(int *pDst, float *pSrc, int length);
inline void sort(float const * const pData, int *pPos, int numPos)
{
int n = numPos;
do
{
int newn = 1;
for (int i=0; i < (n-1); i++)
{
if (pData[pPos[i]] < pData[pPos[i+1]])
{
int temp = pPos[i+1];
pPos[i+1] = pPos[i];
pPos[i] = temp;
newn = i+1;
} // ende if
} // ende for
n = newn;
} while (n > 1);
}
};
} // namespace jay
} // namespace gr
#endif /* INCLUDED_JAY_PEAK_DETECT_IMPL_H */