2 * Copyright (C) 2006, 2016 Paul Davis
3 * Written by Sampo Savolainen & Robin Gareus
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
20 #include "fft_result.h"
21 #include "fft_graph.h"
30 FFTResult::FFTResult(FFTGraph *graph, Gdk::Color color, string trackname)
34 _windowSize = _graph->windowSize();
35 _dataSize = _windowSize / 2;
37 _min_flat = _max_flat = 0.0;
38 _min_prop = _max_prop = 0.0;
40 _data_flat_avg = (float *) malloc (sizeof(float) * _dataSize);
41 _data_flat_min = (float *) malloc (sizeof(float) * _dataSize);
42 _data_flat_max = (float *) malloc (sizeof(float) * _dataSize);
43 _data_prop_avg = (float *) malloc (sizeof(float) * _dataSize);
44 _data_prop_min = (float *) malloc (sizeof(float) * _dataSize);
45 _data_prop_max = (float *) malloc (sizeof(float) * _dataSize);
47 for (unsigned int i = 0; i < _dataSize; i++) {
48 _data_flat_min[i] = FLT_MAX;
49 _data_flat_max[i] = FLT_MIN;
50 _data_flat_avg[i] = 0;
51 _data_prop_min[i] = FLT_MAX;
52 _data_prop_max[i] = FLT_MIN;
53 _data_prop_avg[i] = 0;
57 _trackname = trackname;
61 FFTResult::analyzeWindow(float *window)
63 float const * const _hanning = _graph->_hanning;
64 float *_in = _graph->_in;
65 float *_out = _graph->_out;
67 // Copy the data and apply the hanning window
68 for (unsigned int i = 0; i < _windowSize; ++i) {
69 _in[i] = window[i] * _hanning[i];
72 fftwf_execute(_graph->_plan);
74 // calculate signal power per bin
75 float b = _out[0] * _out[0];
77 _data_flat_avg[0] += b;
78 if (b < _data_flat_min[0]) _data_flat_min[0] = b;
79 if (b > _data_flat_max[0]) _data_flat_max[0] = b;
81 for (unsigned int i = 1; i < _dataSize - 1; ++i) {
82 b = (_out[i] * _out[i]) + (_out[_windowSize - i] * _out[_windowSize - i]);
83 _data_flat_avg[i] += b;
84 if (_data_flat_min[i] > b) _data_flat_min[i] = b;
85 if (_data_flat_max[i] < b ) _data_flat_max[i] = b;
95 _min_flat = _max_flat = 0.0;
96 _min_prop = _max_prop = 0.0;
101 for (unsigned int i = 0; i < _dataSize - 1; ++i) {
102 _data_flat_avg[i] /= _averages;
103 // proportional, pink spectrum @ -18dB
104 _data_prop_avg[i] = _data_flat_avg [i] * i / 63.096f;
105 _data_prop_min[i] = _data_flat_min [i] * i / 63.096f;
106 _data_prop_max[i] = _data_flat_max [i] * i / 63.096f;
109 _data_prop_avg[0] = _data_flat_avg [0] / 63.096f;
110 _data_prop_min[0] = _data_flat_min [0] / 63.096f;
111 _data_prop_max[0] = _data_flat_max [0] / 63.096f;
114 for (unsigned int i = 0; i < _dataSize - 1; ++i) {
115 _data_flat_min[i] = power_to_db (_data_flat_min[i]);
116 _data_flat_max[i] = power_to_db (_data_flat_max[i]);
117 _data_flat_avg[i] = power_to_db (_data_flat_avg[i]);
118 _data_prop_min[i] = power_to_db (_data_prop_min[i]);
119 _data_prop_max[i] = power_to_db (_data_prop_max[i]);
120 _data_prop_avg[i] = power_to_db (_data_prop_avg[i]);
124 _min_flat = _max_flat = _data_flat_avg[0];
125 _min_prop = _max_prop = _data_prop_avg[0];
127 for (unsigned int i = 1; i < _dataSize - 1; ++i) {
128 _min_flat = std::min (_min_flat, _data_flat_avg[i]);
129 _max_flat = std::max (_max_flat, _data_flat_avg[i]);
130 _min_prop = std::min (_min_prop, _data_prop_avg[i]);
131 _max_prop = std::max (_max_prop, _data_prop_avg[i]);
137 FFTResult::~FFTResult()
139 free(_data_flat_avg);
140 free(_data_flat_min);
141 free(_data_flat_max);
142 free(_data_prop_avg);
143 free(_data_prop_min);
144 free(_data_prop_max);