1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
use std::collections::HashMap;
use std::sync::Arc;
use rustfft::FFTplanner;
use common;
use ::{DCT1, DST1, TransformType4, TransformType2And3};
use mdct::*;
use algorithm::*;
use algorithm::type2and3_butterflies::*;
const DCT2_BUTTERFLIES: [usize; 5] = [2, 3, 4, 8, 16];
pub struct DCTplanner<T> {
fft_planner: FFTplanner<T>,
dct1_cache: HashMap<usize, Arc<DCT1<T>>>,
dst1_cache: HashMap<usize, Arc<DST1<T>>>,
dct23_cache: HashMap<usize, Arc<TransformType2And3<T>>>,
dct4_cache: HashMap<usize, Arc<TransformType4<T>>>,
mdct_cache: HashMap<usize, Arc<MDCT<T>>>,
}
impl<T: common::DCTnum> DCTplanner<T> {
pub fn new() -> Self {
Self {
fft_planner: FFTplanner::new(false),
dct1_cache: HashMap::new(),
dst1_cache: HashMap::new(),
dct23_cache: HashMap::new(),
dct4_cache: HashMap::new(),
mdct_cache: HashMap::new(),
}
}
pub fn plan_dct1(&mut self, len: usize) -> Arc<DCT1<T>> {
if self.dct1_cache.contains_key(&len) {
Arc::clone(self.dct1_cache.get(&len).unwrap())
} else {
let result = self.plan_new_dct1(len);
self.dct1_cache.insert(len, Arc::clone(&result));
result
}
}
fn plan_new_dct1(&mut self, len: usize) -> Arc<DCT1<T>> {
if len < 25 {
Arc::new(DCT1Naive::new(len))
} else {
let fft = self.fft_planner.plan_fft((len - 1) * 2);
Arc::new(DCT1ConvertToFFT::new(fft))
}
}
pub fn plan_dct2(&mut self, len: usize) -> Arc<TransformType2And3<T>> {
if self.dct23_cache.contains_key(&len) {
Arc::clone(self.dct23_cache.get(&len).unwrap())
} else {
let result = self.plan_new_dct2(len);
self.dct23_cache.insert(len, Arc::clone(&result));
result
}
}
fn plan_new_dct2(&mut self, len: usize) -> Arc<TransformType2And3<T>> {
if DCT2_BUTTERFLIES.contains(&len) {
self.plan_dct2_butterfly(len)
} else if len.is_power_of_two() && len > 2 {
let half_dct = self.plan_dct2(len / 2);
let quarter_dct = self.plan_dct2(len / 4);
Arc::new(Type2And3SplitRadix::new(half_dct, quarter_dct))
} else if len < 16 {
Arc::new(Type2And3Naive::new(len))
} else {
let fft = self.fft_planner.plan_fft(len);
Arc::new(Type2And3ConvertToFFT::new(fft))
}
}
fn plan_dct2_butterfly(&mut self, len: usize) -> Arc<TransformType2And3<T>> {
match len {
2 => Arc::new(Type2And3Butterfly2::new()),
3 => Arc::new(Type2And3Butterfly3::new()),
4 => Arc::new(Type2And3Butterfly4::new()),
8 => Arc::new(Type2And3Butterfly8::new()),
16 => Arc::new(Type2And3Butterfly16::new()),
_ => panic!("Invalid butterfly size for DCT2: {}", len)
}
}
pub fn plan_dct3(&mut self, len: usize) -> Arc<TransformType2And3<T>> {
self.plan_dct2(len)
}
pub fn plan_dct4(&mut self, len: usize) -> Arc<TransformType4<T>> {
if self.dct4_cache.contains_key(&len) {
Arc::clone(self.dct4_cache.get(&len).unwrap())
} else {
let result = self.plan_new_dct4(len);
self.dct4_cache.insert(len, Arc::clone(&result));
result
}
}
fn plan_new_dct4(&mut self, len: usize) -> Arc<TransformType4<T>> {
if len % 2 == 0 {
if len < 6 {
Arc::new(Type4Naive::new(len))
} else {
let inner_dct = self.plan_dct3(len / 2);
Arc::new(Type4ConvertToType3Even::new(inner_dct))
}
} else {
if len < 7 {
Arc::new(Type4Naive::new(len))
} else {
let fft = self.fft_planner.plan_fft(len);
Arc::new(Type4ConvertToFFTOdd::new(fft))
}
}
}
pub fn plan_dst1(&mut self, len: usize) -> Arc<DST1<T>> {
if self.dst1_cache.contains_key(&len) {
Arc::clone(self.dst1_cache.get(&len).unwrap())
} else {
let result = self.plan_new_dst1(len);
self.dst1_cache.insert(len, Arc::clone(&result));
result
}
}
fn plan_new_dst1(&mut self, len: usize) -> Arc<DST1<T>> {
if len < 25 {
Arc::new(DST1Naive::new(len))
} else {
let fft = self.fft_planner.plan_fft((len + 1) * 2);
Arc::new(DST1ConvertToFFT::new(fft))
}
}
pub fn plan_dst2(&mut self, len: usize) -> Arc<TransformType2And3<T>> {
self.plan_dct2(len)
}
pub fn plan_dst3(&mut self, len: usize) -> Arc<TransformType2And3<T>> {
self.plan_dct2(len)
}
pub fn plan_dst4(&mut self, len: usize) -> Arc<TransformType4<T>> {
self.plan_dct4(len)
}
pub fn plan_mdct<F>(&mut self, len: usize, window_fn: F) -> Arc<MDCT<T>>
where F: (FnOnce(usize) -> Vec<T>) {
if self.mdct_cache.contains_key(&len) {
Arc::clone(self.mdct_cache.get(&len).unwrap())
} else {
let result = self.plan_new_mdct(len, window_fn);
self.mdct_cache.insert(len, Arc::clone(&result));
result
}
}
fn plan_new_mdct<F>(&mut self, len: usize, window_fn: F) -> Arc<MDCT<T>>
where F: (FnOnce(usize) -> Vec<T>) {
let inner_dct4 = self.plan_dct4(len);
Arc::new(MDCTViaDCT4::new(inner_dct4, window_fn))
}
}