3 * Copyright 2005 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.
27 #include <gr_fft_filter_fff.h>
28 #include <gr_io_signature.h>
33 #include <gr_firdes.h>
40 gr_fft_filter_fff_sptr gr_make_fft_filter_fff (int decimation, const std::vector<float> &taps)
42 return gr_fft_filter_fff_sptr (new gr_fft_filter_fff (decimation, taps));
46 gr_fft_filter_fff::gr_fft_filter_fff (int decimation, const std::vector<float> &taps)
47 : gr_sync_decimator ("fft_filter_fff",
48 gr_make_io_signature (1, 1, sizeof (float)),
49 gr_make_io_signature (1, 1, sizeof (float)),
51 d_fftsize(-1), d_fwdfft(0), d_invfft(0), d_updated(false)
54 actual_set_taps(taps);
57 gr_fft_filter_fff::~gr_fft_filter_fff ()
65 print_vector_complex(const std::string label, const std::vector<gr_complex> &x)
68 for (unsigned i = 0; i < x.size(); i++)
69 std::cout << x[i] << " ";
74 print_vector_float(const std::string label, const std::vector<float> &x)
77 for (unsigned i = 0; i < x.size(); i++)
78 std::cout << x[i] << " ";
84 gr_fft_filter_fff::set_taps (const std::vector<float> &taps)
91 * determines d_ntaps, d_nsamples, d_fftsize, d_xformed_taps
94 gr_fft_filter_fff::actual_set_taps (const std::vector<float> &taps)
97 compute_sizes(taps.size());
99 d_tail.resize(tailsize());
100 for (i = 0; i < tailsize(); i++)
103 float *in = d_fwdfft->get_inbuf();
104 gr_complex *out = d_fwdfft->get_outbuf();
106 float scale = 1.0 / d_fftsize;
108 // Compute forward xform of taps.
109 // Copy taps into first ntaps slots, then pad with zeros
110 for (i = 0; i < d_ntaps; i++)
111 in[i] = taps[i] * scale;
113 for (; i < d_fftsize; i++)
116 d_fwdfft->execute(); // do the xform
118 // now copy output to d_xformed_taps
119 for (i = 0; i < d_fftsize/2+1; i++)
120 d_xformed_taps[i] = out[i];
122 //print_vector_complex("transformed taps:", d_xformed_taps);
125 // determine and set d_ntaps, d_nsamples, d_fftsize
128 gr_fft_filter_fff::compute_sizes(int ntaps)
130 int old_fftsize = d_fftsize;
132 d_fftsize = (int) (2 * pow(2.0, ceil(log(ntaps) / log(2))));
133 d_nsamples = d_fftsize - d_ntaps + 1;
136 fprintf(stderr, "gr_fft_filter: ntaps = %d, fftsize = %d, nsamples = %d\n",
137 d_ntaps, d_fftsize, d_nsamples);
139 assert(d_fftsize == d_ntaps + d_nsamples -1 );
141 if (d_fftsize != old_fftsize){ // compute new plans
144 d_fwdfft = new gri_fft_real_fwd(d_fftsize);
145 d_invfft = new gri_fft_real_rev(d_fftsize);
146 d_xformed_taps.resize(d_fftsize/2+1);
149 set_output_multiple(d_nsamples);
153 gr_fft_filter_fff::work (int noutput_items,
154 gr_vector_const_void_star &input_items,
155 gr_vector_void_star &output_items)
157 const float *in = (const float *) input_items[0];
158 float *out = (float *) output_items[0];
161 actual_set_taps(d_new_taps);
163 return 0; // output multiple may have changed
166 assert(noutput_items % d_nsamples == 0);
170 int ninput_items = noutput_items * decimation();
172 for (int i = 0; i < ninput_items; i += d_nsamples){
174 memcpy(d_fwdfft->get_inbuf(), &in[i], d_nsamples * sizeof(float));
176 for (j = d_nsamples; j < d_fftsize; j++)
177 d_fwdfft->get_inbuf()[j] = 0;
179 d_fwdfft->execute(); // compute fwd xform
181 gr_complex *a = d_fwdfft->get_outbuf();
182 gr_complex *b = &d_xformed_taps[0];
183 gr_complex *c = d_invfft->get_inbuf();
185 for (j = 0; j < d_fftsize/2+1; j++) // filter in the freq domain
188 d_invfft->execute(); // compute inv xform
190 // add in the overlapping tail
192 for (j = 0; j < tailsize(); j++)
193 d_invfft->get_outbuf()[j] += d_tail[j];
195 // copy nsamples to output
197 //memcpy(out, d_invfft->get_outbuf(), d_nsamples * sizeof(float));
201 while (j < d_nsamples) {
202 *out++ = d_invfft->get_outbuf()[j];
205 dec_ctr = (j - d_nsamples);
208 memcpy(&d_tail[0], d_invfft->get_outbuf() + d_nsamples,
209 tailsize() * sizeof(float));
212 assert((out - (float *) output_items[0]) == noutput_items);
213 assert(dec_ctr == 0);
215 return noutput_items;