-
-
Notifications
You must be signed in to change notification settings - Fork 1.4k
Expand file tree
/
Copy pathfft.h
More file actions
95 lines (75 loc) · 2.08 KB
/
Copy pathfft.h
File metadata and controls
95 lines (75 loc) · 2.08 KB
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
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
// Based on eos' (I)FFT code which is in turn
// based upon the (I)FFT code in FFmpeg
// Copyright (c) 2008 Loren Merritt
// Copyright (c) 2002 Fabrice Bellard
// Partly based on libdjbfft by D. J. Bernstein
#ifndef MATH_FFT_H
#define MATH_FFT_H
#include "common/scummsys.h"
namespace Math {
/**
* @defgroup math_fft Fast Fourier Transform (FFT)
* @ingroup math
*
* @brief API for the FFT algorithm.
*
* @{
*/
class CosineTable;
struct Complex;
/**
* (Inverse) Fast Fourier Transform.
*
* Used in engines:
* - SCUMM
*/
class FFT {
public:
FFT(int bits, int inverse);
~FFT();
const uint16 *getRevTab() const;
/** Perform the permutation needed BEFORE calling calc(). */
void permute(Complex *z);
/** Perform a complex FFT.
*
* The input data must be permuted before.
* No 1.0/sqrt(n) normalization is done.
*/
void calc(Complex *z);
private:
int _bits;
int _inverse;
uint16 *_revTab;
Complex *_expTab;
Complex *_tmpBuf;
int _splitRadix;
static int splitRadixPermutation(int i, int n, int inverse);
CosineTable *_cosTables[13];
void fft4(Complex *z);
void fft8(Complex *z);
void fft16(Complex *z);
void fft(int n, int logn, Complex *z);
};
/** @} */
} // End of namespace Math
#endif // MATH_FFT_H