/*
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
(at your option) 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 .
*/
//
/// @file ModeFilter.h
/// @brief A class to apply a mode filter which is basically picking the median value from the last x samples
/// the filter size (i.e buffer size) should always be an odd number
#pragma once
#include
#include "FilterClass.h"
#include "FilterWithBuffer.h"
template
class ModeFilter : public FilterWithBuffer
{
public:
ModeFilter(uint8_t return_element);
// apply - Add a new raw value to the filter, retrieve the filtered result
virtual T apply(T sample) override;
// get - get latest filtered value from filter (equal to the value returned by latest call to apply method)
virtual T get() const {
return _output;
}
private:
// private methods
uint8_t _return_element;
T _output;
void isort(T sample, bool drop_high_sample);
bool drop_high_sample; // switch to determine whether to drop the highest or lowest sample when new value arrives
};
// Typedef for convenience
typedef ModeFilter ModeFilterInt8_Size3;
typedef ModeFilter ModeFilterInt8_Size4;
typedef ModeFilter ModeFilterInt8_Size5;
typedef ModeFilter ModeFilterInt8_Size6;
typedef ModeFilter ModeFilterInt8_Size7;
typedef ModeFilter ModeFilterUInt8_Size3;
typedef ModeFilter ModeFilterUInt8_Size4;
typedef ModeFilter ModeFilterUInt8_Size5;
typedef ModeFilter ModeFilterUInt8_Size6;
typedef ModeFilter ModeFilterUInt8_Size7;
typedef ModeFilter ModeFilterInt16_Size3;
typedef ModeFilter ModeFilterInt16_Size4;
typedef ModeFilter ModeFilterInt16_Size5;
typedef ModeFilter ModeFilterInt16_Size6;
typedef ModeFilter ModeFilterInt16_Size7;
typedef ModeFilter ModeFilterUInt16_Size3;
typedef ModeFilter ModeFilterUInt16_Size4;
typedef ModeFilter ModeFilterUInt16_Size5;
typedef ModeFilter ModeFilterUInt16_Size6;
typedef ModeFilter ModeFilterUInt16_Size7;
typedef ModeFilter ModeFilterFloat_Size3;
typedef ModeFilter ModeFilterFloat_Size4;
typedef ModeFilter ModeFilterFloat_Size5;
typedef ModeFilter ModeFilterFloat_Size6;
typedef ModeFilter ModeFilterFloat_Size7;
// Constructor //////////////////////////////////////////////////////////////
template
ModeFilter::ModeFilter(uint8_t return_element) :
FilterWithBuffer(),
_return_element(return_element),
drop_high_sample(true)
{
// ensure we have a valid return_nth_element value. if not, revert to median
if( _return_element >= FILTER_SIZE )
_return_element = FILTER_SIZE / 2;
};
// Public Methods //////////////////////////////////////////////////////////////
template
T ModeFilter:: apply(T sample)
{
// insert the new items into the samples buffer
isort(sample, drop_high_sample);
// next time drop from the other end of the sample buffer
drop_high_sample = !drop_high_sample;
// return results
if( FilterWithBuffer::sample_index < FILTER_SIZE ) {
// middle sample if buffer is not yet full
return _output = FilterWithBuffer::samples[(FilterWithBuffer::sample_index / 2)];
}else{
// return element specified by user in constructor
return _output = FilterWithBuffer::samples[_return_element];
}
}
//
// insertion sort - takes a new sample and pushes it into the sample array
// drops either the highest or lowest sample depending on the 'drop_high_sample' parameter
//
template
void ModeFilter:: isort(T new_sample, bool drop_high)
{
int8_t i;
// if the buffer isn't full simply increase the #items in the buffer (i.e. sample_index)
// the rest is the same as dropping the high sample
if( FilterWithBuffer::sample_index < FILTER_SIZE ) {
FilterWithBuffer::sample_index++;
drop_high = true;
}
if( drop_high ) { // drop highest sample from the buffer to make room for our new sample
// start from top. Note: sample_index always points to the next open space so we start from sample_index-1
i = FilterWithBuffer::sample_index-1;
// if the next element is higher than our new sample, push it up one position
while(i > 0 && FilterWithBuffer::samples[i-1] > new_sample) {
FilterWithBuffer::samples[i] = FilterWithBuffer::samples[i-1];
i--;
}
// add our new sample to the buffer
FilterWithBuffer::samples[i] = new_sample;
}else{ // drop lowest sample from the buffer to make room for our new sample
// start from the bottom
i = 0;
// if the element is lower than our new sample, push it down one position
while( FilterWithBuffer::samples[i+1] < new_sample && i < FilterWithBuffer::sample_index-1 ) {
FilterWithBuffer::samples[i] = FilterWithBuffer::samples[i+1];
i++;
}
// add our new sample to the buffer
FilterWithBuffer::samples[i] = new_sample;
}
}