FreeCalypso > hg > gsm-codec-lib
view libgsmefr/d1035pf.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 | 6ad363f7ea30 |
children |
line wrap: on
line source
/************************************************************************* * * FUNCTION: dec_10i40_35bits() * * PURPOSE: Builds the innovative codevector from the received * index of algebraic codebook. * * See c1035pf.c for more details about the algebraic codebook structure. * *************************************************************************/ #include "gsm_efr.h" #include "typedef.h" #include "namespace.h" #include "basic_op.h" #include "memops.h" #include "no_count.h" #include "codec.h" #define L_CODE 40 /* codevector length */ #define NB_PULSE 10 /* number of pulses */ #define NB_TRACK 5 /* number of track */ void dec_10i40_35bits ( const Word16 index[], /* (i) : index of 10 pulses (sign+position) */ Word16 cod[] /* (o) : algebraic (fixed) codebook excitation */ ) { static const Word16 dgray[8] = {0, 1, 3, 2, 5, 6, 4, 7}; Word16 i, j, pos1, pos2, sign, tmp; Set_zero (cod, L_CODE); /* decode the positions and signs of pulses and build the codeword */ for (j = 0; j < NB_TRACK; j++) { /* compute index i */ tmp = index[j]; move16 (); i = tmp & 7; logic16 (); i = dgray[i]; move16 (); i *= 5; pos1 = i + j; /* position of pulse "j" */ i = shr (tmp, 3) & 1; logic16 (); if (i == 0) { sign = 4096; move16 (); /* +1.0 */ } else { sign = -4096; move16 (); /* -1.0 */ } cod[pos1] = sign; move16 (); /* compute index i */ i = index[add (j, 5)] & 7; logic16 (); i = dgray[i]; move16 (); i *= 5; pos2 = i + j; /* position of pulse "j+5" */ if (pos2 < pos1) { sign = negate (sign); } cod[pos2] = add (cod[pos2], sign); move16 (); } return; }