cannam@0
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
cannam@0
|
2
|
cannam@0
|
3 /*
|
cannam@0
|
4 QM DSP library
|
cannam@0
|
5 Centre for Digital Music, Queen Mary, University of London.
|
cannam@0
|
6 This file Copyright 2006 Chris Cannam.
|
Chris@84
|
7
|
Chris@84
|
8 This program is free software; you can redistribute it and/or
|
Chris@84
|
9 modify it under the terms of the GNU General Public License as
|
Chris@84
|
10 published by the Free Software Foundation; either version 2 of the
|
Chris@84
|
11 License, or (at your option) any later version. See the file
|
Chris@84
|
12 COPYING included with this distribution for more information.
|
cannam@0
|
13 */
|
cannam@0
|
14
|
cannam@0
|
15 #ifndef _WINDOW_H_
|
cannam@0
|
16 #define _WINDOW_H_
|
cannam@0
|
17
|
cannam@0
|
18 #include <cmath>
|
cannam@0
|
19 #include <iostream>
|
cannam@0
|
20 #include <map>
|
cannam@0
|
21
|
cannam@0
|
22 enum WindowType {
|
cannam@0
|
23 RectangularWindow,
|
cannam@0
|
24 BartlettWindow,
|
cannam@0
|
25 HammingWindow,
|
cannam@0
|
26 HanningWindow,
|
cannam@0
|
27 BlackmanWindow,
|
Chris@109
|
28
|
Chris@109
|
29 FirstWindow = RectangularWindow,
|
Chris@109
|
30 LastWindow = BlackmanWindow
|
cannam@0
|
31 };
|
cannam@0
|
32
|
Chris@152
|
33 /**
|
Chris@152
|
34 * Various shaped windows for sample frame conditioning, including
|
Chris@152
|
35 * cosine windows (Hann etc) and triangular and rectangular windows.
|
Chris@152
|
36 */
|
cannam@0
|
37 template <typename T>
|
cannam@0
|
38 class Window
|
cannam@0
|
39 {
|
cannam@0
|
40 public:
|
cannam@0
|
41 /**
|
Chris@109
|
42 * Construct a windower of the given type and size.
|
Chris@109
|
43 *
|
Chris@109
|
44 * Note that the cosine windows are periodic by design, rather
|
Chris@109
|
45 * than symmetrical. (A window of size N is equivalent to a
|
Chris@109
|
46 * symmetrical window of size N+1 with the final element missing.)
|
cannam@0
|
47 */
|
cannam@0
|
48 Window(WindowType type, size_t size) : m_type(type), m_size(size) { encache(); }
|
cannam@0
|
49 Window(const Window &w) : m_type(w.m_type), m_size(w.m_size) { encache(); }
|
cannam@0
|
50 Window &operator=(const Window &w) {
|
cannam@0
|
51 if (&w == this) return *this;
|
cannam@0
|
52 m_type = w.m_type;
|
cannam@0
|
53 m_size = w.m_size;
|
cannam@0
|
54 encache();
|
cannam@0
|
55 return *this;
|
cannam@0
|
56 }
|
cannam@26
|
57 virtual ~Window() { delete[] m_cache; }
|
cannam@0
|
58
|
cannam@0
|
59 void cut(T *src) const { cut(src, src); }
|
cannam@55
|
60 void cut(const T *src, T *dst) const {
|
cannam@0
|
61 for (size_t i = 0; i < m_size; ++i) dst[i] = src[i] * m_cache[i];
|
cannam@0
|
62 }
|
cannam@0
|
63
|
cannam@0
|
64 WindowType getType() const { return m_type; }
|
cannam@0
|
65 size_t getSize() const { return m_size; }
|
cannam@0
|
66
|
cannam@0
|
67 protected:
|
cannam@0
|
68 WindowType m_type;
|
cannam@0
|
69 size_t m_size;
|
cannam@0
|
70 T *m_cache;
|
cannam@0
|
71
|
cannam@0
|
72 void encache();
|
cannam@0
|
73 };
|
cannam@0
|
74
|
cannam@0
|
75 template <typename T>
|
cannam@0
|
76 void Window<T>::encache()
|
cannam@0
|
77 {
|
cannam@0
|
78 size_t n = m_size;
|
cannam@0
|
79 T *mult = new T[n];
|
cannam@0
|
80 size_t i;
|
cannam@0
|
81 for (i = 0; i < n; ++i) mult[i] = 1.0;
|
cannam@0
|
82
|
cannam@0
|
83 switch (m_type) {
|
cannam@0
|
84
|
cannam@0
|
85 case RectangularWindow:
|
Chris@109
|
86 for (i = 0; i < n; ++i) {
|
Chris@109
|
87 mult[i] = mult[i] * 0.5;
|
cannam@0
|
88 }
|
cannam@0
|
89 break;
|
cannam@0
|
90
|
cannam@0
|
91 case BartlettWindow:
|
Chris@109
|
92 if (n == 2) {
|
Chris@109
|
93 mult[0] = mult[1] = 0; // "matlab compatible"
|
Chris@109
|
94 } else if (n == 3) {
|
Chris@109
|
95 mult[0] = 0;
|
Chris@109
|
96 mult[1] = mult[2] = 2./3.;
|
Chris@109
|
97 } else if (n > 3) {
|
Chris@109
|
98 for (i = 0; i < n/2; ++i) {
|
Chris@109
|
99 mult[i] = mult[i] * (i / T(n/2));
|
Chris@109
|
100 mult[i + n - n/2] = mult[i + n - n/2] * (1.0 - (i / T(n/2)));
|
Chris@109
|
101 }
|
cannam@0
|
102 }
|
cannam@0
|
103 break;
|
cannam@0
|
104
|
cannam@0
|
105 case HammingWindow:
|
Chris@109
|
106 if (n > 1) {
|
Chris@109
|
107 for (i = 0; i < n; ++i) {
|
Chris@109
|
108 mult[i] = mult[i] * (0.54 - 0.46 * cos(2 * M_PI * i / n));
|
Chris@109
|
109 }
|
cannam@0
|
110 }
|
cannam@0
|
111 break;
|
cannam@0
|
112
|
cannam@0
|
113 case HanningWindow:
|
Chris@109
|
114 if (n > 1) {
|
Chris@109
|
115 for (i = 0; i < n; ++i) {
|
Chris@109
|
116 mult[i] = mult[i] * (0.50 - 0.50 * cos(2 * M_PI * i / n));
|
Chris@109
|
117 }
|
cannam@0
|
118 }
|
cannam@0
|
119 break;
|
cannam@0
|
120
|
cannam@0
|
121 case BlackmanWindow:
|
Chris@109
|
122 if (n > 1) {
|
Chris@109
|
123 for (i = 0; i < n; ++i) {
|
Chris@109
|
124 mult[i] = mult[i] * (0.42 - 0.50 * cos(2 * M_PI * i / n)
|
Chris@109
|
125 + 0.08 * cos(4 * M_PI * i / n));
|
Chris@109
|
126 }
|
cannam@0
|
127 }
|
cannam@0
|
128 break;
|
cannam@0
|
129 }
|
Chris@109
|
130
|
cannam@0
|
131 m_cache = mult;
|
cannam@0
|
132 }
|
cannam@0
|
133
|
cannam@0
|
134 #endif
|