You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

filter.c 1.6 KiB

21 years ago
21 years ago
21 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
  1. /*
  2. * Atpdec
  3. * Copyright (c) 2004 by Thierry Leconte (F4DWV)
  4. *
  5. * $Id$
  6. *
  7. * This library is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU Library General Public License as
  9. * published by the Free Software Foundation; either version 2 of
  10. * the License, or (at your option) any later version.
  11. *
  12. * This program 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 Library General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Library General Public
  18. * License along with this library; if not, write to the Free Software
  19. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  20. *
  21. */
  22. #include "filter.h"
  23. #include <math.h>
  24. float fir(float *buff, const float *coeff, const int len)
  25. {
  26. int i;
  27. double r;
  28. r = 0.0;
  29. for (i = 0; i < len; i++) {
  30. r += buff[i] * coeff[i];
  31. }
  32. return r;
  33. }
  34. void iqfir(float *buff, const float *coeff, const int len,double *I,double *Q)
  35. {
  36. int k;
  37. double i,q;
  38. i=q=0.0;
  39. for (k = 0; k < len; k++) {
  40. q += buff[2*k] * coeff[k];
  41. i += buff[2*k] ;
  42. }
  43. i= buff[len-1]-i/len;
  44. *I=i,*Q=q;
  45. }
  46. float rsfir(double *buff, const float *coeff, const int len, const double offset,
  47. const double delta)
  48. {
  49. int i;
  50. double n;
  51. double out;
  52. out = 0.0;
  53. for (i = 0, n = offset; i < (len-1)/delta-1; n += delta, i++) {
  54. int k;
  55. double alpha;
  56. k = (int)floor(n);
  57. alpha = n - k;
  58. out += buff[i]*(coeff[k]*(1.0-alpha)+coeff[k + 1]*alpha);
  59. }
  60. return out;
  61. }