Lines Matching +full:6 +full:a

12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser
15 * You should have received a copy of the GNU Lesser General Public License
23 * This source code is a product of Sun Microsystems, Inc. and is provided
28 * THE WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
29 * PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
59 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
60 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
61 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
62 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
114 * "floating point" representation (4-bit exponent, 6-bit mantessa) "srn".
123 anexp = log2plus1(anmag) - 6; in fmult()
126 wanexp = anexp + ((srn >> 6) & 0xF) - 13; in fmult()
152 state_ptr->a[cnta] = 0; in g72x_init_state()
156 for (cnta = 0; cnta < 6; cnta++) { in g72x_init_state()
166 * computes the estimated signal from 6-zero predictor.
175 for (i = 1; i < 6; i++) /* ACCUM */ in predictor_zero()
187 return (fmult(state_ptr->a[1] >> 2, state_ptr->sr[1]) + in predictor_pole()
188 fmult(state_ptr->a[0] >> 2, state_ptr->sr[0])); in predictor_pole()
205 y = state_ptr->yl >> 6; in step_size()
209 y += (dif * al) >> 6; in step_size()
211 y += (dif * al + 0x3F) >> 6; in step_size()
219 * Given a raw sample, 'd', of the difference signal and a
223 * as a subtraction.
300 short mag, exp; /* Adaptive predictor, FLOAT A */ in update()
342 state_ptr->yl += state_ptr->yu + ((-state_ptr->yl) >> 6); in update()
347 if (tr == 1) { /* reset a's and b's for modem signal */ in update()
348 state_ptr->a[0] = 0; in update()
349 state_ptr->a[1] = 0; in update()
356 } else { /* update a's and b's */ in update()
359 /* update predictor pole a[1] */ in update()
360 a2p = state_ptr->a[1] - (state_ptr->a[1] >> 7); in update()
362 fa1 = (pks1) ? state_ptr->a[0] : -state_ptr->a[0]; in update()
390 state_ptr->a[1] = a2p; in update()
393 /* update predictor pole a[0] */ in update()
394 state_ptr->a[0] -= state_ptr->a[0] >> 8; in update()
398 state_ptr->a[0] += 192; in update()
400 state_ptr->a[0] -= 192; in update()
404 if (state_ptr->a[0] < -a1ul) in update()
405 state_ptr->a[0] = -a1ul; in update()
406 else if (state_ptr->a[0] > a1ul) in update()
407 state_ptr->a[0] = a1ul; in update()
409 /* UPB : update predictor zeros b[6] */ in update()
410 for (cnt = 0; cnt < 6; cnt++) { in update()
426 /* FLOAT A : convert dq[0] to 4-bit exp, 6-bit mantissa f.p. */ in update()
432 (exp << 6) + ((mag << 6) >> exp) : in update()
433 (exp << 6) + ((mag << 6) >> exp) - 0x400; in update()
437 /* FLOAT B : convert sr to 4-bit exp., 6-bit mantissa f.p. */ in update()
442 state_ptr->sr[0] = (exp << 6) + ((sr << 6) >> exp); in update()
446 state_ptr->sr[0] = (exp << 6) + ((mag << 6) >> exp) - 0x400; in update()
450 /* DELAY A */ in update()
485 * the output of this decoder as a tandem process. If the output of the
487 * is adjusted by one level of A-law or u-law codes.
497 * adjusted A-law or u-law compressed sample.
501 unsigned char sp; /* A-law compressed 8-bit code */ in tandem_adjust_alaw()
504 int sd; /* adjusted A-law decoded sample value */ in tandem_adjust_alaw()
510 sp = sox_13linear2alaw(((sr >> 1) << 3));/* short to A-law compression */ in tandem_adjust_alaw()
517 /* ADPCM codes : 8, 9, ... F, 0, 1, ... , 6, 7 */ in tandem_adjust_alaw()
558 /* ADPCM codes : 8, 9, ... F, 0, 1, ... , 6, 7 */ in tandem_adjust_ulaw()