1 /* -*- c++ -*- */
2 /*
3 * Copyright 2008,2010,2013,2017,2018 Free Software Foundation, Inc.
4 *
5 * This file is part of GNU Radio
6 *
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)
10 * any later version.
11 *
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.
16 *
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.
21 */
22
23
24 #ifdef HAVE_CONFIG_H
25 #include "config.h"
26 #endif
27
28 #include "moving_average_impl.h"
29 #include <gnuradio/io_signature.h>
30
31 namespace gr {
32 namespace blocks {
33
34 template <class T>
35 typename moving_average<T>::sptr
make(int length,T scale,int max_iter,unsigned int vlen)36 moving_average<T>::make(int length, T scale, int max_iter, unsigned int vlen)
37 {
38 return gnuradio::get_initial_sptr(
39 new moving_average_impl<T>(length, scale, max_iter, vlen));
40 }
41
42 template <class T>
moving_average_impl(int length,T scale,int max_iter,unsigned int vlen)43 moving_average_impl<T>::moving_average_impl(int length,
44 T scale,
45 int max_iter,
46 unsigned int vlen)
47 : sync_block("moving_average",
48 io_signature::make(1, 1, sizeof(T) * vlen),
49 io_signature::make(1, 1, sizeof(T) * vlen)),
50 d_length(length),
51 d_scale(scale),
52 d_max_iter(max_iter),
53 d_vlen(vlen),
54 d_new_length(length),
55 d_new_scale(scale),
56 d_updated(false)
57 {
58 this->set_history(length);
59 // we don't have C++11's <array>, so initialize the stored vector instead
60 // we store this vector so that work() doesn't spend its time allocating and freeing
61 // vector storage
62 if (d_vlen > 1) {
63 d_sum = std::vector<T>(d_vlen);
64 }
65 }
66
67 template <class T>
~moving_average_impl()68 moving_average_impl<T>::~moving_average_impl()
69 {
70 }
71
72 template <class T>
set_length_and_scale(int length,T scale)73 void moving_average_impl<T>::set_length_and_scale(int length, T scale)
74 {
75 d_new_length = length;
76 d_new_scale = scale;
77 d_updated = true;
78 }
79
80 template <class T>
set_length(int length)81 void moving_average_impl<T>::set_length(int length)
82 {
83 d_new_length = length;
84 d_updated = true;
85 }
86
87 template <class T>
set_scale(T scale)88 void moving_average_impl<T>::set_scale(T scale)
89 {
90 d_new_scale = scale;
91 d_updated = true;
92 }
93
94 template <class T>
work(int noutput_items,gr_vector_const_void_star & input_items,gr_vector_void_star & output_items)95 int moving_average_impl<T>::work(int noutput_items,
96 gr_vector_const_void_star& input_items,
97 gr_vector_void_star& output_items)
98 {
99 if (d_updated) {
100 d_length = d_new_length;
101 d_scale = d_new_scale;
102 this->set_history(d_length);
103 d_updated = false;
104 return 0; // history requirements might have changed
105 }
106
107 const T* in = (const T*)input_items[0];
108 T* out = (T*)output_items[0];
109
110 unsigned int num_iter =
111 (unsigned int)((noutput_items > d_max_iter) ? d_max_iter : noutput_items);
112 if (d_vlen == 1) {
113 T sum = in[0];
114 for (int i = 1; i < d_length - 1; i++) {
115 sum += in[i];
116 }
117
118 for (unsigned int i = 0; i < num_iter; i++) {
119 sum += in[i + d_length - 1];
120 out[i] = sum * d_scale;
121 sum -= in[i];
122 }
123
124 } else { // d_vlen > 1
125 // gets automatically optimized well
126 for (unsigned int elem = 0; elem < d_vlen; elem++) {
127 d_sum[elem] = in[elem];
128 }
129
130 for (int i = 1; i < d_length - 1; i++) {
131 for (unsigned int elem = 0; elem < d_vlen; elem++) {
132 d_sum[elem] += in[i * d_vlen + elem];
133 }
134 }
135
136 for (unsigned int i = 0; i < num_iter; i++) {
137 for (unsigned int elem = 0; elem < d_vlen; elem++) {
138 d_sum[elem] += in[(i + d_length - 1) * d_vlen + elem];
139 out[i * d_vlen + elem] = d_sum[elem] * d_scale;
140 d_sum[elem] -= in[i * d_vlen + elem];
141 }
142 }
143 }
144 return num_iter;
145 }
146
147 template class moving_average<std::int16_t>;
148 template class moving_average<std::int32_t>;
149 template class moving_average<float>;
150 template class moving_average<gr_complex>;
151 } /* namespace blocks */
152 } /* namespace gr */
153