Lines Matching defs:weight
21 * @brief Functions for angular-sum algorithm for weight alignment.
24 * - we compute a complex number P as (cos s*i, sin s*i) for each weight,
55 // Store a reduced sin/cos table for 64 possible weight values; this causes
89 * @param dec_weight_ideal_value The ideal decimated unquantized weight values.
135 * @brief For a given step size compute the lowest and highest weight.
137 * Compute the lowest and highest weight that results from quantizing using the given stepsize and
139 * forcing samples that should have had one weight value one step up or down.
142 * @param dec_weight_ideal_value The ideal decimated unquantized weight values.
146 * @param[out] lowest_weight Per angular step, the lowest weight.
147 * @param[out] weight_span Per angular step, the span between lowest and highest weight.
149 * @param[out] cut_low_weight_error Per angular step, the low weight cut error.
150 * @param[out] cut_high_weight_error Per angular step, the high weight cut error.
180 float weight = dec_weight_ideal_value[j];
181 __asm__ volatile("fmax %s0, %s0, %s1" : "+w"(max_weight) : "w"(weight));
182 __asm__ volatile("fmin %s0, %s0, %s1" : "+w"(min_weight) : "w"(weight));
227 // Write out min weight and weight span; clamp span to a usable range
235 // samples that should have had the weight value one step (up/down).
303 // Write out min weight and weight span; clamp span to a usable range
311 // samples that should have had the weight value one step (up/down).
327 * @param dec_weight_ideal_value The ideal decimated unquantized weight values.
329 * @param[out] low_value Per angular step, the lowest weight value.
330 * @param[out] high_value Per angular step, the highest weight value.
370 // Lane<2> = Cut low weight