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
|
/*
** Copyright 2003-2010, VisualOn, Inc.
**
** Licensed under the Apache License, Version 2.0 (the "License");
** you may not use this file except in compliance with the License.
** You may obtain a copy of the License at
**
** http://www.apache.org/licenses/LICENSE-2.0
**
** Unless required by applicable law or agreed to in writing, software
** distributed under the License is distributed on an "AS IS" BASIS,
** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
** See the License for the specific language governing permissions and
** limitations under the License.
*/
/***********************************************************************
File: convolve.c
Description:Perform the convolution between two vectors x[] and h[]
and write the result in the vector y[]
************************************************************************/
#include "typedef.h"
#include "basic_op.h"
#define UNUSED(x) (void)(x)
void Convolve (
Word16 x[], /* (i) : input vector */
Word16 h[], /* (i) : impulse response */
Word16 y[], /* (o) : output vector */
Word16 L /* (i) : vector size */
)
{
Word32 i, n;
Word16 *tmpH,*tmpX;
Word32 s;
UNUSED(L);
for (n = 0; n < 64;)
{
tmpH = h+n;
tmpX = x;
i=n+1;
s = vo_mult32((*tmpX++), (*tmpH--));i--;
while(i>0)
{
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
i -= 4;
}
y[n] = ((s<<1) + 0x8000)>>16;
n++;
tmpH = h+n;
tmpX = x;
i=n+1;
s = vo_mult32((*tmpX++), (*tmpH--));i--;
s += vo_mult32((*tmpX++), (*tmpH--));i--;
while(i>0)
{
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
i -= 4;
}
y[n] = ((s<<1) + 0x8000)>>16;
n++;
tmpH = h+n;
tmpX = x;
i=n+1;
s = vo_mult32((*tmpX++), (*tmpH--));i--;
s += vo_mult32((*tmpX++), (*tmpH--));i--;
s += vo_mult32((*tmpX++), (*tmpH--));i--;
while(i>0)
{
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
i -= 4;
}
y[n] = ((s<<1) + 0x8000)>>16;
n++;
s = 0;
tmpH = h+n;
tmpX = x;
i=n+1;
while(i>0)
{
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
s += vo_mult32((*tmpX++), (*tmpH--));
i -= 4;
}
y[n] = ((s<<1) + 0x8000)>>16;
n++;
}
return;
}
|
