-
Notifications
You must be signed in to change notification settings - Fork 67
/
normalize.hpp
127 lines (116 loc) · 4.4 KB
/
normalize.hpp
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
/******************************************************************************
* Copyright (c) 2022, Xilinx, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION). HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*******************************************************************************
* @brief Normalization layers.
* @author Thomas B. Preusser <[email protected]>
*******************************************************************************/
#ifndef NORMALIZE_HPP
#define NORMALIZE_HPP
#include <ap_int.h>
#include <hls_stream.h>
#include <functional>
#include "utils.hpp"
/**
* Subjects a feature map stream [FM_SIZE x CHANNELS] to a channelwise normalization
* using the coefficients obtained by calling f() CHANNELS times for each input
* feature map.
*
* Type Requirements:
* f: void -> TC
* g: TC x TI -> TO
*/
template<
unsigned FM_SIZE, // Feature Map Size
unsigned CHANNELS, // Channels per Feature Map Pixel
typename G = std::multiplies<>, // Scaling Function
typename F, // Coefficient Adjustment Function
typename TI, // Input Feature Type
typename TO // Output Feature Type
>
void normalize(
hls::stream<TI> &src,
hls::stream<TO> &dst,
F &&f,
G &&g = G()
) {
#pragma HLS dataflow disable_start_propagation
decltype(f()) coeff_buf[CHANNELS];
for(unsigned c = 0; c < CHANNELS; c++) {
#pragma HLS pipeline II=1 style=flp
coeff_buf[c] = f();
}
for(unsigned i = 0; i < FM_SIZE; i++) {
for(unsigned c = 0; c < CHANNELS; c++) {
#pragma HLS pipeline II=1 style=flp
TI const x = src.read();
TO const y = g(coeff_buf[c], x);
dst.write(y);
}
}
} // normalize()
/**
* Quantized maximum normalization over input vectors of length FM_SIZE
* into the numeric range of the output type `ap_uint<WO>`:
*
* x_i -> round( NORMAX * x_i / max{x_j | j=0:FM_SIZE} )
*/
template<
unsigned FM_SIZE, // Vector length
unsigned NORMAX = 0, // Value of normalized maximum: 0 -> 2^WO-1
int WI, // Input Precision
int WO // Output Precision
>
void max_norm(
hls::stream<ap_uint<WI>> &src,
hls::stream<ap_uint<WO>> &dst
) {
static_assert(clog2(1+NORMAX) <= WO, "Specified normalized maximum exceeds output range");
static ap_uint<WO> const MAX { NORMAX? NORMAX : -1u };
#pragma HLS dataflow disable_start_propagation
hls::stream<ap_uint<WI>> buffer;
#pragma HLS stream variable=buffer depth=FM_SIZE
// Buffer input and scan it for the maximum
ap_uint<WI> max = 1; // Prevent division by zero
for(unsigned i = 0; i < FM_SIZE; i++) {
#pragma HLS pipeline II=1 style=flp
auto const x = src.read();
max = std::max(max, x);
buffer.write(x);
}
// Replay buffer normalizing all values
for(unsigned i = 0; i < FM_SIZE; i++) {
#pragma HLS pipeline II=1 style=flp
ap_uint<WO+WI> const a = MAX * buffer.read();
ap_uint<WO+WI+1> const b = (a, ap_uint<1>(0)); // div with one fractional binary digit for rounding
ap_uint<WO+1> const q = b / max;
dst.write(q(WO, 1) + q[0]);
}
} // max_norm()
#endif