3 * Copyright 2010 Free Software Foundation, Inc.
5 * This file is part of GNU Radio
7 * GNU Radio is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 3, or (at your option)
12 * GNU Radio is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with GNU Radio; see the file COPYING. If not, write to
19 * the Free Software Foundation, Inc., 51 Franklin Street,
20 * Boston, MA 02110-1301, USA.
28 #include <qa_gri_fir_filter_with_buffer_fff.h>
29 #include <gri_fir_filter_with_buffer_fff.h>
33 #include <cppunit/TestAssert.h>
40 typedef float tap_type;
41 typedef float acc_type;
45 #define ERR_DELTA (1e-5)
47 #define NELEM(x) (sizeof (x) / sizeof (x[0]))
52 return 2.0 * ((float) random () / RANDOM_MAX - 0.5); // uniformly (-1, 1)
56 random_floats (float *buf, unsigned n)
58 for (unsigned i = 0; i < n; i++)
59 buf[i] = (float) rint (uniform () * 32767);
63 ref_dotprod (const i_type input[], const tap_type taps[], int ntaps)
66 for (int i = 0; i < ntaps; i++) {
67 sum += input[i] * taps[i];
73 // Test for ntaps in [0,9], and input lengths in [0,17].
74 // This ensures that we are building the shifted taps correctly,
75 // and exercises all corner cases on input alignment and length.
79 qa_gri_fir_filter_with_buffer_fff::t1 ()
81 const int MAX_TAPS = 9;
82 const int OUTPUT_LEN = 17;
83 const int INPUT_LEN = MAX_TAPS + OUTPUT_LEN;
85 // Mem aligned buffer not really necessary, but why not?
86 i_type *input = (i_type *)malloc16Align(INPUT_LEN * sizeof(i_type));
87 i_type *dline = (i_type*)malloc16Align(INPUT_LEN * sizeof(i_type));
88 o_type expected_output[OUTPUT_LEN];
89 o_type actual_output[OUTPUT_LEN];
90 tap_type taps[MAX_TAPS];
92 srandom (0); // we want reproducibility
93 memset(dline, 0, INPUT_LEN*sizeof(i_type));
95 for (int n = 0; n <= MAX_TAPS; n++){
96 for (int ol = 0; ol <= OUTPUT_LEN; ol++){
98 // cerr << "@@@ n:ol " << n << ":" << ol << endl;
100 // build random test case
101 random_floats (input, INPUT_LEN);
102 random_floats (taps, MAX_TAPS);
104 // compute expected output values
105 memset(dline, 0, INPUT_LEN*sizeof(i_type));
106 for (int o = 0; o < ol; o++){
107 // use an actual delay line for this test
108 for(int oo = INPUT_LEN-1; oo > 0; oo--)
109 dline[oo] = dline[oo-1];
111 expected_output[o] = ref_dotprod (dline, taps, n);
115 vector<tap_type> f1_taps(&taps[0], &taps[n]);
116 gri_fir_filter_with_buffer_fff *f1 = new gri_fir_filter_with_buffer_fff(f1_taps);
118 // zero the output, then do the filtering
119 memset (actual_output, 0, sizeof (actual_output));
120 f1->filterN (actual_output, input, ol);
124 // we use a sloppy error margin because on the x86 architecture,
125 // our reference implementation is using 80 bit floating point
126 // arithmetic, while the SSE version is using 32 bit float point
129 for (int o = 0; o < ol; o++){
130 CPPUNIT_ASSERT_DOUBLES_EQUAL(expected_output[o], actual_output[o],
131 fabsf (expected_output[o]) * ERR_DELTA);