annotate dsp/signalconditioning/FiltFilt.cpp @ 483:fdaa63607c15

Untabify, indent, tidy
author Chris Cannam <cannam@all-day-breakfast.com>
date Fri, 31 May 2019 11:54:32 +0100
parents fa851e147e3f
children b1f72e469ec8
rev   line source
c@225 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
c@225 2
c@225 3 /*
c@225 4 QM DSP Library
c@225 5
c@225 6 Centre for Digital Music, Queen Mary, University of London.
c@309 7 This file 2005-2006 Christian Landone.
c@309 8
c@309 9 This program is free software; you can redistribute it and/or
c@309 10 modify it under the terms of the GNU General Public License as
c@309 11 published by the Free Software Foundation; either version 2 of the
c@309 12 License, or (at your option) any later version. See the file
c@309 13 COPYING included with this distribution for more information.
c@225 14 */
c@225 15
c@225 16 #include "FiltFilt.h"
c@225 17
c@225 18 //////////////////////////////////////////////////////////////////////
c@225 19 // Construction/Destruction
c@225 20 //////////////////////////////////////////////////////////////////////
c@225 21
c@417 22 FiltFilt::FiltFilt(Filter::Parameters parameters) :
c@417 23 m_filter(parameters)
c@225 24 {
c@417 25 m_ord = m_filter.getOrder();
c@225 26 }
c@225 27
c@225 28 FiltFilt::~FiltFilt()
c@225 29 {
c@225 30 }
c@225 31
c@225 32 void FiltFilt::process(double *src, double *dst, unsigned int length)
cannam@483 33 {
c@225 34 unsigned int i;
c@225 35
c@283 36 if (length == 0) return;
c@283 37
c@225 38 unsigned int nFilt = m_ord + 1;
c@225 39 unsigned int nFact = 3 * ( nFilt - 1);
cannam@483 40 unsigned int nExt = length + 2 * nFact;
c@225 41
c@417 42 double *filtScratchIn = new double[ nExt ];
c@417 43 double *filtScratchOut = new double[ nExt ];
cannam@483 44
cannam@483 45 for( i = 0; i< nExt; i++ ) {
cannam@483 46 filtScratchIn[ i ] = 0.0;
cannam@483 47 filtScratchOut[ i ] = 0.0;
c@225 48 }
c@225 49
c@225 50 // Edge transients reflection
c@225 51 double sample0 = 2 * src[ 0 ];
c@225 52 double sampleN = 2 * src[ length - 1 ];
c@225 53
c@225 54 unsigned int index = 0;
cannam@483 55 for( i = nFact; i > 0; i-- ) {
cannam@483 56 filtScratchIn[ index++ ] = sample0 - src[ i ];
c@225 57 }
c@225 58 index = 0;
cannam@483 59 for( i = 0; i < nFact; i++ ) {
cannam@483 60 filtScratchIn[ (nExt - nFact) + index++ ] = sampleN - src[ (length - 2) - i ];
c@225 61 }
c@225 62
c@225 63 index = 0;
cannam@483 64 for( i = 0; i < length; i++ ) {
cannam@483 65 filtScratchIn[ i + nFact ] = src[ i ];
c@225 66 }
cannam@483 67
c@225 68 ////////////////////////////////
c@225 69 // Do 0Ph filtering
c@417 70 m_filter.process( filtScratchIn, filtScratchOut, nExt);
cannam@483 71
c@225 72 // reverse the series for FILTFILT
cannam@483 73 for ( i = 0; i < nExt; i++) {
cannam@483 74 filtScratchIn[ i ] = filtScratchOut[ nExt - i - 1];
c@225 75 }
c@225 76
c@225 77 // do FILTER again
c@417 78 m_filter.process( filtScratchIn, filtScratchOut, nExt);
cannam@483 79
c@225 80 // reverse the series back
cannam@483 81 for ( i = 0; i < nExt; i++) {
cannam@483 82 filtScratchIn[ i ] = filtScratchOut[ nExt - i - 1 ];
c@225 83 }
cannam@483 84 for ( i = 0;i < nExt; i++) {
cannam@483 85 filtScratchOut[ i ] = filtScratchIn[ i ];
c@225 86 }
c@225 87
c@225 88 index = 0;
cannam@483 89 for( i = 0; i < length; i++ ) {
cannam@483 90 dst[ index++ ] = filtScratchOut[ i + nFact ];
cannam@483 91 }
c@225 92
c@417 93 delete [] filtScratchIn;
c@417 94 delete [] filtScratchOut;
c@225 95 }
c@225 96
c@225 97 void FiltFilt::reset()
c@225 98 {
c@225 99
c@225 100 }