blob: 10484429e0d404671d552fb2a09af061c1982954 [file] [log] [blame]
ragoff0a51f2018-03-22 09:55:50 -07001/*
2 * Copyright (C) 2018 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#ifndef RDSP_H
18#define RDSP_H
19
20#include <complex>
21#include <log/log.h>
22#include <vector>
23using FloatVec = std::vector<float>;
24using ComplexVec = std::vector<std::complex<float>>;
25
26// =======
27// DSP window creation
28// =======
29
30#define TWOPI (M_PI * 2)
31
32enum rdsp_window_type {
33 RDSP_WINDOW_RECTANGULAR,
34 RDSP_WINDOW_TRIANGULAR,
35 RDSP_WINDOW_TRIANGULAR_FLAT_TOP,
36 RDSP_WINDOW_HAMMING,
37 RDSP_WINDOW_HAMMING_FLAT_TOP,
38 RDSP_WINDOW_HANNING,
39 RDSP_WINDOW_HANNING_FLAT_TOP,
40};
41
42template <typename T>
43static void fillRectangular(T &v) {
44 const size_t size = v.size();
45 for (size_t i = 0; i < size; i++) {
46 v[i] = 1.0;
47 }
48} //rectangular
49
50template <typename T>
51static void fillTriangular(T &v, size_t overlap) {
52 const size_t size = v.size();
53 //ramp up
54 size_t i = 0;
55 if (overlap > 0) {
56 for (; i < overlap; i++) {
57 v[i] = (2.0 * i + 1) / (2 * overlap);
58 }
59 }
60
61 //flat top
62 for (; i < size - overlap; i++) {
63 v[i] = 1.0;
64 }
65
66 //ramp down
67 if (overlap > 0) {
68 for (; i < size; i++) {
69 v[i] = (2.0 * (size - i) - 1) / (2 * overlap);
70 }
71 }
72} //triangular
73
74template <typename T>
75static void fillHamming(T &v, size_t overlap) {
76 const size_t size = v.size();
77 const size_t twoOverlap = 2 * overlap;
78 size_t i = 0;
79 if (overlap > 0) {
80 for (; i < overlap; i++) {
81 v[i] = 0.54 - 0.46 * cos(TWOPI * i /(twoOverlap - 1));
82 }
83 }
84
85 //flat top
86 for (; i < size - overlap; i++) {
87 v[i] = 1.0;
88 }
89
90 //ramp down
91 if (overlap > 0) {
92 for (; i < size; i++) {
93 int k = i - ((int)size - 2 * overlap);
94 v[i] = 0.54 - 0.46 * cos(TWOPI * k / (twoOverlap - 1));
95 }
96 }
97} //hamming
98
99template <typename T>
100static void fillHanning(T &v, size_t overlap) {
101 const size_t size = v.size();
102 const size_t twoOverlap = 2 * overlap;
103 //ramp up
104 size_t i = 0;
105 if (overlap > 0) {
106 for (; i < overlap; i++) {
107 v[i] = 0.5 * (1.0 - cos(TWOPI * i / (twoOverlap - 1)));
108 }
109 }
110
111 //flat top
112 for (; i < size - overlap; i++) {
113 v[i] = 1.0;
114 }
115
116 //ramp down
117 if (overlap > 0) {
118 for (; i < size; i++) {
119 int k = i - ((int)size - 2 * overlap);
120 v[i] = 0.5 * (1.0 - cos(TWOPI * k / (twoOverlap - 1)));
121 }
122 }
123}
124
125template <typename T>
126static void fill_window(T &v, int type, size_t size, size_t overlap) {
127 if (overlap > size / 2) {
128 overlap = size / 2;
129 }
130 v.resize(size);
131
132 switch (type) {
133 case RDSP_WINDOW_RECTANGULAR:
134 fillRectangular(v);
135 break;
136 case RDSP_WINDOW_TRIANGULAR:
137 fillTriangular(v, size / 2);
138 break;
139 case RDSP_WINDOW_TRIANGULAR_FLAT_TOP:
140 fillTriangular(v, overlap);
141 break;
142 case RDSP_WINDOW_HAMMING:
143 fillHamming(v, size / 2);
144 break;
145 case RDSP_WINDOW_HAMMING_FLAT_TOP:
146 fillHamming(v, overlap);
147 break;
148 case RDSP_WINDOW_HANNING:
149 fillHanning(v, size / 2);
150 break;
151 case RDSP_WINDOW_HANNING_FLAT_TOP:
152 fillHanning(v, overlap);
153 break;
154 default:
155 ALOGE("Error: unknown window type %d", type);
156 }
157}
158
159//};
160#endif //RDSP_H