Lines Matching full:cost
565 float cost[MAX_DYNAMIC_FRAMESIZE][16];
584 cost[0][i] = 1e10;
588 cost[0][1<<i] = (frame_cost + rate*(1<<i))*(1+factor*transient_boost(E, E_1, i, N+1));
598 cost[i][j] = cost[i-1][j-1];
609 min_cost = cost[i-1][1];
612 float tmp = cost[i-1][(1<<(k+1))-1];
620 cost[i][1<<j] = min_cost;
621 /* If part of the frame is outside the analysis window, only count part of the cost */
623 cost[i][1<<j] += curr_cost*(float)(N-i)/(1<<j);
625 cost[i][1<<j] += curr_cost;
630 best_cost = cost[N-1][1];
634 if (cost[N-1][i]<best_cost)
636 best_cost = cost[N-1][i];
