GNU Radio 3.6.5 C++ API
|
00001 /* -*- c++ -*- */ 00002 /* 00003 * Copyright 2010 Free Software Foundation, Inc. 00004 * 00005 * This file is part of GNU Radio 00006 * 00007 * GNU Radio is free software; you can redistribute it and/or modify 00008 * it under the terms of the GNU General Public License as published by 00009 * the Free Software Foundation; either version 3, or (at your option) 00010 * any later version. 00011 * 00012 * GNU Radio is distributed in the hope that it will be useful, 00013 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00014 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00015 * GNU General Public License for more details. 00016 * 00017 * You should have received a copy of the GNU General Public License 00018 * along with GNU Radio; see the file COPYING. If not, write to 00019 * the Free Software Foundation, Inc., 51 Franklin Street, 00020 * Boston, MA 02110-1301, USA. 00021 */ 00022 00023 #ifndef INCLUDED_GRI_FFT_FILTER_CCC_GENERIC_H 00024 #define INCLUDED_GRI_FFT_FILTER_CCC_GENERIC_H 00025 00026 #include <gr_core_api.h> 00027 #include <gr_complex.h> 00028 #include <vector> 00029 00030 class gri_fft_complex; 00031 00032 /*! 00033 * \brief Fast FFT filter with gr_complex input, gr_complex output and gr_complex taps 00034 */ 00035 class GR_CORE_API gri_fft_filter_ccc_generic 00036 { 00037 private: 00038 int d_ntaps; 00039 int d_nsamples; 00040 int d_fftsize; // fftsize = ntaps + nsamples - 1 00041 int d_decimation; 00042 gri_fft_complex *d_fwdfft; // forward "plan" 00043 gri_fft_complex *d_invfft; // inverse "plan" 00044 int d_nthreads; // number of FFTW threads to use 00045 std::vector<gr_complex> d_tail; // state carried between blocks for overlap-add 00046 std::vector<gr_complex> d_new_taps; 00047 gr_complex *d_xformed_taps; // Fourier xformed taps 00048 00049 void compute_sizes(int ntaps); 00050 int tailsize() const { return d_ntaps - 1; } 00051 00052 public: 00053 /*! 00054 * \brief Construct an FFT filter for complex vectors with the given taps and decimation rate. 00055 * 00056 * This is the basic implementation for performing FFT filter for fast convolution 00057 * in other blocks for complex vectors (such as gr_fft_filter_ccc). 00058 * \param decimation The decimation rate of the filter (int) 00059 * \param taps The filter taps (complex) 00060 * \param nthreads The number of threads for the FFT to use (int) 00061 */ 00062 gri_fft_filter_ccc_generic (int decimation, const std::vector<gr_complex> &taps, 00063 int nthreads=1); 00064 ~gri_fft_filter_ccc_generic (); 00065 00066 /*! 00067 * \brief Set new taps for the filter. 00068 * 00069 * Sets new taps and resets the class properties to handle different sizes 00070 * \param taps The filter taps (complex) 00071 */ 00072 int set_taps (const std::vector<gr_complex> &taps); 00073 00074 /*! 00075 * \brief Set number of threads to use. 00076 */ 00077 void set_nthreads(int n); 00078 00079 /*! 00080 * \brief Get number of threads being used. 00081 */ 00082 int nthreads() const; 00083 00084 /*! 00085 * \brief Perform the filter operation 00086 * 00087 * \param nitems The number of items to produce 00088 * \param input The input vector to be filtered 00089 * \param output The result of the filter operation 00090 */ 00091 int filter (int nitems, const gr_complex *input, gr_complex *output); 00092 00093 }; 00094 00095 #endif /* INCLUDED_GRI_FFT_FILTER_CCC_GENERIC_H */