+ m_nFilterPoints = m_nSignalPoints;
+ m_filterMin = 0;
+ m_filterMax = m_nSignalPoints * m_signalInc;
+ m_filterInc = (m_filterMax - m_filterMin) / (m_nFilterPoints - 1);
+ m_vecFilter = new double [m_nFilterPoints];
+ int halfFilter = m_nFilterPoints / 2;
+ for (int i = 0; i < halfFilter; i++)
+ m_vecFilter[i] = static_cast<double>(i) / (halfFilter - 1) / (2 * m_signalInc);
+ for (int i = 0; i < halfFilter; i++)
+ m_vecFilter[m_nFilterPoints - i - 1] = static_cast<double>(i) / (halfFilter - 1) / (2 * m_signalInc);
+ if (halfFilter % 2) // odd
+ m_vecFilter[halfFilter] = 1;
+ } else if (m_idFilterMethod == FILTER_METHOD_FFT || m_idFilterMethod == FILTER_METHOD_FFT_ZEROPAD_2 || m_idFilterMethod == FILTER_METHOD_FFT_ZEROPAD_4) {
+ m_nFilterPoints = m_nSignalPoints;
+ if (m_idFilterMethod == FILTER_METHOD_FFT_ZEROPAD_2 || m_idFilterMethod == FILTER_METHOD_FFT_ZEROPAD_4) {
+ double logBase2 = log(m_nSignalPoints) / log(2);
+ int nextPowerOf2 = static_cast<int>(floor(logBase2)) + 1;
+ if (m_idFilterMethod == FILTER_METHOD_FFT_ZEROPAD_4)
+ nextPowerOf2++;
+ if (logBase2 != floor(logBase2))
+ nextPowerOf2++;
+ m_nFilterPoints = 1 << nextPowerOf2;
+ cout << "nFilterPoints = " << m_nFilterPoints << endl;
+ }
+ m_filterMin = 0;
+ m_filterMax = m_nSignalPoints * m_signalInc;
+ m_filterInc = (m_filterMax - m_filterMin) / (m_nFilterPoints - 1);
+ m_vecFilter = new double [m_nFilterPoints];
+ int halfFilter = m_nFilterPoints / 2;
+ for (int i = 0; i < halfFilter; i++)
+ m_vecFilter[i] = static_cast<double>(i) / (halfFilter - 1) / (2 * m_signalInc);
+ for (int i = 0; i < halfFilter; i++)
+ m_vecFilter[m_nFilterPoints - i - 1] = static_cast<double>(i) / (halfFilter - 1) / (2 * m_signalInc);
+ if (halfFilter % 2) // odd
+ m_vecFilter[halfFilter] = 1;
+
+#if HAVE_FFTW
+ m_planForward = fftw_create_plan (m_nFilterPoints, FFTW_FORWARD, FFTW_ESTIMATE);
+ m_planBackward = fftw_create_plan (m_nFilterPoints, FFTW_BACKWARD, FFTW_ESTIMATE);
+#endif