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
|
/*
* Copyright (C) 2020 Linux Studio Plugins Project <https://lsp-plug.in/>
* (C) 2020 Vladimir Sadovnikov <sadko4u@gmail.com>
*
* This file is part of lsp-dsp-lib
* Created on: 31 мар. 2020 г.
*
* lsp-dsp-lib is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* any later version.
*
* lsp-dsp-lib 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with lsp-dsp-lib. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef PRIVATE_DSP_ARCH_GENERIC_CONVOLUTION_H_
#define PRIVATE_DSP_ARCH_GENERIC_CONVOLUTION_H_
#ifndef PRIVATE_DSP_ARCH_GENERIC_IMPL
#error "This header should not be included directly"
#endif /* PRIVATE_DSP_ARCH_GENERIC_IMPL */
namespace lsp
{
namespace generic
{
void convolve(float *dst, const float *src, const float *conv, size_t length, size_t count)
{
// Previous rotate register
float p[4];
const float *k = src;
while (count >= 4)
{
// Clear memory register
p[0] = 0.0f;
p[1] = 0.0f;
p[2] = 0.0f;
p[3] = 0.0f;
size_t clen = length;
float *d = dst;
const float *c = conv;
if (clen >= 4)
{
do
{
// Apply convolution
d[0] += k[0]*c[0] + k[1]*p[3] + k[2]*p[2] + k[3]*p[1];
d[1] += k[0]*c[1] + k[1]*c[0] + k[2]*p[3] + k[3]*p[2];
d[2] += k[0]*c[2] + k[1]*c[1] + k[2]*c[0] + k[3]*p[3];
d[3] += k[0]*c[3] + k[1]*c[2] + k[2]*c[1] + k[3]*c[0];
// Shift memory
p[0] = c[0];
p[1] = c[1];
p[2] = c[2];
p[3] = c[3];
// Decrement current convolution length and increment destination length
clen -= 4;
d += 4;
c += 4;
} while (clen >= 4);
// Apply tail
d[0] += /* 0 */ + k[1]*p[3] + k[2]*p[2] + k[3]*p[1];
d[1] += /* 0 */ + /* 0 */ + k[2]*p[3] + k[3]*p[2];
d[2] += /* 0 */ + /* 0 */ + /* 0 */ + k[3]*p[3];
// d[3] += /* 0 */ + /* 0 */ + /* 0 */ + /* 0 */;
}
// Apply tail
for (size_t j=0; j<clen; ++j)
{
d[0] += k[0] * c[j];
d[1] += k[1] * c[j];
d[2] += k[2] * c[j];
d[3] += k[3] * c[j];
d ++;
}
k += 4;
dst += 4;
count -= 4;
}
while (count--)
{
size_t clen = length;
float *d = dst++;
const float *c = conv;
while (clen >= 4)
{
// Apply convolution
d[0] += k[0]*c[0];
d[1] += k[0]*c[1];
d[2] += k[0]*c[2];
d[3] += k[0]*c[3];
// Decrement current convolution length and increment destination length
clen -= 4;
d += 4;
c += 4;
}
// Apply tail
while (clen--)
*(d++) += k[0] * *(c++);
k++;
}
}
}
}
#endif /* PRIVATE_DSP_ARCH_GENERIC_CONVOLUTION_H_ */
|
