File indexing completed on 2024-04-28 03:48:20
0001 /* 0002 File : NSLFilterTest.cpp 0003 Project : LabPlot 0004 Description : NSL Tests for filter 0005 -------------------------------------------------------------------- 0006 SPDX-FileCopyrightText: 2019 Stefan Gerlach <stefan.gerlach@uni.kn> 0007 0008 SPDX-License-Identifier: GPL-2.0-or-later 0009 */ 0010 0011 #include "NSLFilterTest.h" 0012 0013 extern "C" { 0014 #include "backend/nsl/nsl_filter.h" 0015 } 0016 0017 void NSLFilterTest::initTestCase() { 0018 const QString currentDir = QLatin1String(__FILE__); 0019 m_dataDir = currentDir.left(currentDir.lastIndexOf(QDir::separator())) + QDir::separator() + QLatin1String("data") + QDir::separator(); 0020 } 0021 0022 // ############################################################################## 0023 // ################# form test 0024 // ############################################################################## 0025 0026 void NSLFilterTest::testForm() { 0027 const int N = 1000; 0028 double data[N + 2]; 0029 0030 int i; 0031 for (i = 0; i < N + 2; i++) 0032 data[i] = 1.0; 0033 0034 /*Bessel gain*/ 0035 int n = 3; 0036 double x = 1.; 0037 double G = nsl_filter_gain_bessel(n, x); 0038 printf("G = %.15g\n", G); 0039 QCOMPARE(G, 0.901262652189164); 0040 0041 /* filter form */ 0042 nsl_filter_apply(data, N, nsl_filter_type_low_pass, nsl_filter_form_legendre, 2, 50, 2); 0043 nsl_filter_apply(data, N, nsl_filter_type_high_pass, nsl_filter_form_legendre, 2, 50, 2); 0044 nsl_filter_apply(data, N, nsl_filter_type_band_pass, nsl_filter_form_legendre, 2, 100, 50); 0045 nsl_filter_apply(data, N, nsl_filter_type_band_reject, nsl_filter_form_legendre, 2, 100, 100); 0046 nsl_filter_apply(data, N, nsl_filter_type_low_pass, nsl_filter_form_bessel, 2, 100, 100); 0047 nsl_filter_apply(data, N, nsl_filter_type_high_pass, nsl_filter_form_bessel, 2, 100, 100); 0048 nsl_filter_apply(data, N, nsl_filter_type_band_pass, nsl_filter_form_bessel, 2, 100, 100); 0049 nsl_filter_apply(data, N, nsl_filter_type_band_reject, nsl_filter_form_bessel, 2, 100, 100); 0050 0051 // for(i=0; i < N/2; i++) 0052 // printf("%d %g\n", i, data[2*i]); 0053 0054 /* all pass order,cut,bw */ 0055 nsl_filter_fourier(data, N, nsl_filter_type_high_pass, nsl_filter_form_ideal, 0, 0, 2); 0056 0057 /* filter tests */ 0058 nsl_filter_fourier(data, N, nsl_filter_type_low_pass, nsl_filter_form_ideal, 0, 3, 2); 0059 nsl_filter_fourier(data, N, nsl_filter_type_high_pass, nsl_filter_form_ideal, 0, 3, 2); 0060 nsl_filter_fourier(data, N, nsl_filter_type_band_pass, nsl_filter_form_ideal, 0, 2, 2); 0061 nsl_filter_fourier(data, N, nsl_filter_type_band_reject, nsl_filter_form_ideal, 0, 2, 2); 0062 nsl_filter_fourier(data, N, nsl_filter_type_low_pass, nsl_filter_form_butterworth, 1, 2, 2); 0063 nsl_filter_fourier(data, N, nsl_filter_type_high_pass, nsl_filter_form_butterworth, 1, 2, 2); 0064 nsl_filter_fourier(data, N, nsl_filter_type_band_pass, nsl_filter_form_butterworth, 2, 2, 2); 0065 } 0066 0067 // ############################################################################## 0068 // ################# performance 0069 // ############################################################################## 0070 0071 QTEST_MAIN(NSLFilterTest)