Lines Matching refs:mad
243 /* collect the necessary data: target bits, actual bits, mad and QP */
247 pMP->mad = video->sumMAD / (float)currVol->nTotalMB;
248 if (pMP->mad < MAD_MIN) pMP->mad = MAD_MIN; /* MAD_MIN is defined as 1 in mp4def.h */
264 /* Purpose : Save QP, actual_bits, mad and R_D of the current iteration */
276 pMP->pRDSamples[pMP->framePos][counter_samples].mad = pMP->mad;
277 pMP->pRDSamples[pMP->framePos][counter_samples].R_D = (float)(pMP->actual_bits / (pMP->mad + 0.0001));
497 /* Keep the current average mad */
522 /* Purpose : quadratic bit allocation model: T(n) = C*sqrt(mad(n)/aver_mad(n-1)) */
561 /*1.calculate average mad */
571 /*2.average_mad, mad ==> diff_counter_BTsrc, diff_counter_BTdst */
596 /* transition time: use previous average mad "pMP->aver_mad_prev" instead of the current average mad "pMP->aver_mad" */
698 /* Mad based variable bit allocation + QP calculation with a new quadratic method */
714 /* Mad based variable bit allocation */
732 prev_mad = pMP->pRDSamples[0][0].mad;
736 if (pMP->pRDSamples[i][0].mad != 0 && prev_mad != 0 &&
737 PV_ABS(prev_mad - curr_mad) > PV_ABS(pMP->pRDSamples[i][0].mad - curr_mad))
739 mad;
773 // When mad is already low, lower bound on Qc doesn't have to be small.
871 pMP->sum_mad -= pMP->mad;
872 pMP->aver_mad = (pMP->aver_mad * pMP->encoded_frames - pMP->mad) / (float)(pMP->encoded_frames - 1 + 0.0001);
