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
|
/************************************************************************
FAUST Architecture File
Copyright (C) 2017 GRAME, Centre National de Creation Musicale
---------------------------------------------------------------------
This Architecture section 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/>.
EXCEPTION : As a special exception, you may create a larger work
that contains this FAUST architecture section and distribute
that work under terms of your choice, so long as this FAUST
architecture section is not modified.
************************************************************************
************************************************************************/
#ifndef __dsp_tools__
#define __dsp_tools__
#ifndef FAUSTFLOAT
#define FAUSTFLOAT float
#endif
class Deinterleaver
{
private:
int fNumFrames;
int fNumInputs;
int fNumOutputs;
FAUSTFLOAT* fInput;
FAUSTFLOAT* fOutputs[256];
public:
Deinterleaver(int numFrames, int numInputs, int numOutputs)
{
fNumFrames = numFrames;
fNumInputs = numInputs;
fNumOutputs = max(numInputs, numOutputs);
// allocate interleaved input channel
fInput = new FAUSTFLOAT[fNumFrames * fNumInputs];
// allocate separate output channels
for (int i = 0; i < fNumOutputs; i++) {
fOutputs[i] = new FAUSTFLOAT[fNumFrames];
}
}
~Deinterleaver()
{
// free interleaved input channel
delete [] fInput;
// free separate output channels
for (int i = 0; i < fNumOutputs; i++) {
delete [] fOutputs[i];
}
}
FAUSTFLOAT* input() { return fInput; }
FAUSTFLOAT** outputs() { return fOutputs; }
void deinterleave()
{
for (int s = 0; s < fNumFrames; s++) {
for (int c = 0; c < fNumInputs; c++) {
fOutputs[c][s] = fInput[c + s * fNumInputs];
}
}
}
};
class Interleaver
{
private:
int fNumFrames;
int fNumChans;
FAUSTFLOAT* fInputs[256];
FAUSTFLOAT* fOutput;
public:
Interleaver(int numFrames, int numChans)
{
fNumFrames = numFrames;
fNumChans = numChans;
// allocate separate input channels
for (int i = 0; i < fNumChans; i++) {
fInputs[i] = new FAUSTFLOAT[fNumFrames];
}
// allocate interleaved output channel
fOutput = new FAUSTFLOAT[fNumFrames * fNumChans];
}
~Interleaver()
{
// free separate input channels
for (int i = 0; i < fNumChans; i++) {
delete [] fInputs[i];
}
// free interleaved output channel
delete [] fOutput;
}
FAUSTFLOAT** inputs() { return fInputs; }
FAUSTFLOAT* output() { return fOutput; }
void interleave()
{
for (int s = 0; s < fNumFrames; s++) {
for (int c = 0; c < fNumChans; c++) {
fOutput[c + s * fNumChans] = fInputs[c][s];
}
}
}
};
#endif
|
