|
max@0
|
1 // Copyright (C) 2010-2011 NICTA (www.nicta.com.au)
|
|
max@0
|
2 // Copyright (C) 2010-2011 Conrad Sanderson
|
|
max@0
|
3 //
|
|
max@0
|
4 // This file is part of the Armadillo C++ library.
|
|
max@0
|
5 // It is provided without any warranty of fitness
|
|
max@0
|
6 // for any purpose. You can redistribute this file
|
|
max@0
|
7 // and/or modify it under the terms of the GNU
|
|
max@0
|
8 // Lesser General Public License (LGPL) as published
|
|
max@0
|
9 // by the Free Software Foundation, either version 3
|
|
max@0
|
10 // of the License or (at your option) any later version.
|
|
max@0
|
11 // (see http://www.opensource.org/licenses for more info)
|
|
max@0
|
12
|
|
max@0
|
13
|
|
max@0
|
14 //! \addtogroup glue_conv
|
|
max@0
|
15 //! @{
|
|
max@0
|
16
|
|
max@0
|
17
|
|
max@0
|
18 //! rudimentary implementation of the convolution operation
|
|
max@0
|
19
|
|
max@0
|
20 template<typename T1, typename T2>
|
|
max@0
|
21 inline
|
|
max@0
|
22 void
|
|
max@0
|
23 glue_conv::apply(Mat<typename T1::elem_type>& out, const Glue<T1,T2,glue_conv>& X)
|
|
max@0
|
24 {
|
|
max@0
|
25 arma_extra_debug_sigprint();
|
|
max@0
|
26
|
|
max@0
|
27 typedef typename T1::elem_type eT;
|
|
max@0
|
28
|
|
max@0
|
29 const unwrap_check<T1> A_tmp(X.A, out);
|
|
max@0
|
30 const unwrap_check<T2> B_tmp(X.B, out);
|
|
max@0
|
31
|
|
max@0
|
32 const Mat<eT>& A = A_tmp.M;
|
|
max@0
|
33 const Mat<eT>& B = B_tmp.M;
|
|
max@0
|
34
|
|
max@0
|
35 arma_debug_check( ( (A.is_vec() == false) || (B.is_vec() == false) ), "conv(): inputs must be vectors" );
|
|
max@0
|
36
|
|
max@0
|
37
|
|
max@0
|
38 const Mat<eT>& h = (A.n_elem <= B.n_elem) ? A : B;
|
|
max@0
|
39 const Mat<eT>& x = (A.n_elem <= B.n_elem) ? B : A;
|
|
max@0
|
40
|
|
max@0
|
41
|
|
max@0
|
42 const uword h_n_elem = h.n_elem;
|
|
max@0
|
43 const uword x_n_elem = x.n_elem;
|
|
max@0
|
44 const uword out_n_elem = h_n_elem + x_n_elem - 1;
|
|
max@0
|
45
|
|
max@0
|
46
|
|
max@0
|
47 if( (h_n_elem == 0) || (x_n_elem == 0) )
|
|
max@0
|
48 {
|
|
max@0
|
49 out.reset();
|
|
max@0
|
50 return;
|
|
max@0
|
51 }
|
|
max@0
|
52
|
|
max@0
|
53
|
|
max@0
|
54 (A.n_cols == 1) ? out.set_size(out_n_elem, 1) : out.set_size(1, out_n_elem);
|
|
max@0
|
55
|
|
max@0
|
56
|
|
max@0
|
57 const eT* h_mem = h.memptr();
|
|
max@0
|
58 const eT* x_mem = x.memptr();
|
|
max@0
|
59 eT* out_mem = out.memptr();
|
|
max@0
|
60
|
|
max@0
|
61
|
|
max@0
|
62 for(uword out_i = 0; out_i < (h_n_elem-1); ++out_i)
|
|
max@0
|
63 {
|
|
max@0
|
64 eT acc = eT(0);
|
|
max@0
|
65
|
|
max@0
|
66 uword h_i = out_i;
|
|
max@0
|
67
|
|
max@0
|
68 for(uword x_i = 0; x_i <= out_i; ++x_i, --h_i)
|
|
max@0
|
69 {
|
|
max@0
|
70 acc += h_mem[h_i] * x_mem[x_i];
|
|
max@0
|
71 }
|
|
max@0
|
72
|
|
max@0
|
73 out_mem[out_i] = acc;
|
|
max@0
|
74 }
|
|
max@0
|
75
|
|
max@0
|
76
|
|
max@0
|
77 for(uword out_i = h_n_elem-1; out_i < out_n_elem - (h_n_elem-1); ++out_i)
|
|
max@0
|
78 {
|
|
max@0
|
79 eT acc = eT(0);
|
|
max@0
|
80
|
|
max@0
|
81 uword h_i = h_n_elem - 1;
|
|
max@0
|
82
|
|
max@0
|
83 for(uword x_i = out_i - h_n_elem + 1; x_i <= out_i; ++x_i, --h_i)
|
|
max@0
|
84 {
|
|
max@0
|
85 acc += h_mem[h_i] * x_mem[x_i];
|
|
max@0
|
86 }
|
|
max@0
|
87
|
|
max@0
|
88 out_mem[out_i] = acc;
|
|
max@0
|
89 }
|
|
max@0
|
90
|
|
max@0
|
91
|
|
max@0
|
92 for(uword out_i = out_n_elem - (h_n_elem-1); out_i < out_n_elem; ++out_i)
|
|
max@0
|
93 {
|
|
max@0
|
94 eT acc = eT(0);
|
|
max@0
|
95
|
|
max@0
|
96 uword h_i = h_n_elem - 1;
|
|
max@0
|
97
|
|
max@0
|
98 for(uword x_i = out_i - h_n_elem + 1; x_i < x_n_elem; ++x_i, --h_i)
|
|
max@0
|
99 {
|
|
max@0
|
100 acc += h_mem[h_i] * x_mem[x_i];
|
|
max@0
|
101 }
|
|
max@0
|
102
|
|
max@0
|
103 out_mem[out_i] = acc;
|
|
max@0
|
104 }
|
|
max@0
|
105
|
|
max@0
|
106
|
|
max@0
|
107 }
|
|
max@0
|
108
|
|
max@0
|
109
|
|
max@0
|
110
|
|
max@0
|
111 //! @}
|
