Chris@49
|
1 // Copyright (C) 2010-2013 NICTA (www.nicta.com.au)
|
Chris@49
|
2 // Copyright (C) 2010-2013 Conrad Sanderson
|
Chris@49
|
3 //
|
Chris@49
|
4 // This Source Code Form is subject to the terms of the Mozilla Public
|
Chris@49
|
5 // License, v. 2.0. If a copy of the MPL was not distributed with this
|
Chris@49
|
6 // file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
Chris@49
|
7
|
Chris@49
|
8
|
Chris@49
|
9 //! \addtogroup glue_conv
|
Chris@49
|
10 //! @{
|
Chris@49
|
11
|
Chris@49
|
12
|
Chris@49
|
13 //! rudimentary implementation of the convolution operation
|
Chris@49
|
14
|
Chris@49
|
15 template<typename T1, typename T2>
|
Chris@49
|
16 inline
|
Chris@49
|
17 void
|
Chris@49
|
18 glue_conv::apply(Mat<typename T1::elem_type>& out, const Glue<T1,T2,glue_conv>& X)
|
Chris@49
|
19 {
|
Chris@49
|
20 arma_extra_debug_sigprint();
|
Chris@49
|
21
|
Chris@49
|
22 typedef typename T1::elem_type eT;
|
Chris@49
|
23
|
Chris@49
|
24 const unwrap_check<T1> A_tmp(X.A, out);
|
Chris@49
|
25 const unwrap_check<T2> B_tmp(X.B, out);
|
Chris@49
|
26
|
Chris@49
|
27 const Mat<eT>& A = A_tmp.M;
|
Chris@49
|
28 const Mat<eT>& B = B_tmp.M;
|
Chris@49
|
29
|
Chris@49
|
30 arma_debug_check
|
Chris@49
|
31 (
|
Chris@49
|
32 ( ((A.is_vec() == false) && (A.is_empty() == false)) || ((B.is_vec() == false) && (B.is_empty() == false)) ),
|
Chris@49
|
33 "conv(): given object is not a vector"
|
Chris@49
|
34 );
|
Chris@49
|
35
|
Chris@49
|
36
|
Chris@49
|
37 const Mat<eT>& h = (A.n_elem <= B.n_elem) ? A : B;
|
Chris@49
|
38 const Mat<eT>& x = (A.n_elem <= B.n_elem) ? B : A;
|
Chris@49
|
39
|
Chris@49
|
40
|
Chris@49
|
41 const uword h_n_elem = h.n_elem;
|
Chris@49
|
42 const uword x_n_elem = x.n_elem;
|
Chris@49
|
43 const uword out_n_elem = h_n_elem + x_n_elem - 1;
|
Chris@49
|
44
|
Chris@49
|
45
|
Chris@49
|
46 if( (h_n_elem == 0) || (x_n_elem == 0) )
|
Chris@49
|
47 {
|
Chris@49
|
48 out.reset();
|
Chris@49
|
49 return;
|
Chris@49
|
50 }
|
Chris@49
|
51
|
Chris@49
|
52
|
Chris@49
|
53 (A.n_cols == 1) ? out.set_size(out_n_elem, 1) : out.set_size(1, out_n_elem);
|
Chris@49
|
54
|
Chris@49
|
55
|
Chris@49
|
56 const eT* h_mem = h.memptr();
|
Chris@49
|
57 const eT* x_mem = x.memptr();
|
Chris@49
|
58 eT* out_mem = out.memptr();
|
Chris@49
|
59
|
Chris@49
|
60
|
Chris@49
|
61 for(uword out_i = 0; out_i < (h_n_elem-1); ++out_i)
|
Chris@49
|
62 {
|
Chris@49
|
63 eT acc = eT(0);
|
Chris@49
|
64
|
Chris@49
|
65 uword h_i = out_i;
|
Chris@49
|
66
|
Chris@49
|
67 for(uword x_i = 0; x_i <= out_i; ++x_i, --h_i)
|
Chris@49
|
68 {
|
Chris@49
|
69 acc += h_mem[h_i] * x_mem[x_i];
|
Chris@49
|
70 }
|
Chris@49
|
71
|
Chris@49
|
72 out_mem[out_i] = acc;
|
Chris@49
|
73 }
|
Chris@49
|
74
|
Chris@49
|
75
|
Chris@49
|
76 for(uword out_i = h_n_elem-1; out_i < out_n_elem - (h_n_elem-1); ++out_i)
|
Chris@49
|
77 {
|
Chris@49
|
78 eT acc = eT(0);
|
Chris@49
|
79
|
Chris@49
|
80 uword h_i = h_n_elem - 1;
|
Chris@49
|
81
|
Chris@49
|
82 for(uword x_i = out_i - h_n_elem + 1; x_i <= out_i; ++x_i, --h_i)
|
Chris@49
|
83 {
|
Chris@49
|
84 acc += h_mem[h_i] * x_mem[x_i];
|
Chris@49
|
85 }
|
Chris@49
|
86
|
Chris@49
|
87 out_mem[out_i] = acc;
|
Chris@49
|
88 }
|
Chris@49
|
89
|
Chris@49
|
90
|
Chris@49
|
91 for(uword out_i = out_n_elem - (h_n_elem-1); out_i < out_n_elem; ++out_i)
|
Chris@49
|
92 {
|
Chris@49
|
93 eT acc = eT(0);
|
Chris@49
|
94
|
Chris@49
|
95 uword h_i = h_n_elem - 1;
|
Chris@49
|
96
|
Chris@49
|
97 for(uword x_i = out_i - h_n_elem + 1; x_i < x_n_elem; ++x_i, --h_i)
|
Chris@49
|
98 {
|
Chris@49
|
99 acc += h_mem[h_i] * x_mem[x_i];
|
Chris@49
|
100 }
|
Chris@49
|
101
|
Chris@49
|
102 out_mem[out_i] = acc;
|
Chris@49
|
103 }
|
Chris@49
|
104
|
Chris@49
|
105
|
Chris@49
|
106 }
|
Chris@49
|
107
|
Chris@49
|
108
|
Chris@49
|
109
|
Chris@49
|
110 //! @}
|