view dev/u2s-regen.c @ 242:f081a6850fb5

libgsmfrp: new refined implementation The previous implementation exhibited the following defects, which are now fixed: 1) The last received valid SID was cached forever for the purpose of handling future invalid SIDs - we could have received some valid SID ages ago, then lots of speech or NO_DATA, and if we then get an invalid SID, we would resurrect the last valid SID from ancient history - a bad design. In our new design, we handle invalid SID based on the current state, much like BFI. 2) GSM 06.11 spec says clearly that after the second lost SID (received BFI=1 && TAF=1 in CN state) we need to gradually decrease the output level, rather than jump directly to emitting silence frames - we previously failed to implement such logic. 3) Per GSM 06.12 section 5.2, Xmaxc should be the same in all 4 subframes in a SID frame. What should we do if we receive an otherwise valid SID frame with different Xmaxc? Our previous approach would replicate this Xmaxc oddity in every subsequent generated CN frame, which is rather bad. In our new design, the very first CN frame (which can be seen as a transformation of the SID frame itself) retains the original 4 distinct Xmaxc, but all subsequent CN frames are based on the Xmaxc from the last subframe of the most recent SID.
author Mychaela Falconia <falcon@freecalypso.org>
date Tue, 09 May 2023 05:16:31 +0000
parents 20750ffb1c3e
children
line wrap: on
line source

/*
 * This program generates a G.711 mu-law decoding table of the same form
 * as the u2s[] table in the toast_ulaw.c module in libgsm/toast; the intent
 * is to replace that incorrect table with a corrected one.  The "engine"
 * function that does the computation is based on ulaw_expand() from ITU-T
 * G.191 STL.
 */

#include <stdio.h>
#include <stdlib.h>

static unsigned
ulaw_expand (input)
    unsigned input;
{
    short segment;              /* segment (Table 2/G711, column 1) */
    short mantissa;             /* low nibble of log companded sample */
    short exponent;             /* high nibble of log companded sample */
    short sign;                 /* sign of output sample */
    short step;
    short output;

    sign = input < (0x0080)     /* sign-bit = 1 for positiv values */
      ? -1 : 1;
    mantissa = ~input;          /* 1's complement of input value */
    exponent = (mantissa >> 4) & (0x0007);      /* extract exponent */
    segment = exponent + 1;     /* compute segment number */
    mantissa = mantissa & (0x000F);     /* extract mantissa */

    /* Compute Quantized Sample (14 bit left justified!) */
    step = (4) << segment;      /* position of the LSB */
    /* = 1 quantization step) */
    output = sign *             /* sign */
      (((0x0080) << exponent)   /* '1', preceding the mantissa */
       +step * mantissa         /* left shift of mantissa */
       + step / 2               /* 1/2 quantization step */
       - 4 * 33);
    return output & 0xFFFF;
}

main(argc, argv)
	char **argv;
{
	unsigned input, output;

	for (input = 0; input < 256; input++) {
		output = ulaw_expand(input);
		printf("%6u,", output);
		if ((input & 7) == 7)
			putchar('\n');
	}
	exit(0);
}