xref: /aosp_15_r20/external/libgsm/src/short_term.c (revision 8ec969cea971fe25ff2d3933a5a9f8504f8e86c9)
1*8ec969ceSTreehugger Robot /*
2*8ec969ceSTreehugger Robot  * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische
3*8ec969ceSTreehugger Robot  * Universitaet Berlin.  See the accompanying file "COPYRIGHT" for
4*8ec969ceSTreehugger Robot  * details.  THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE.
5*8ec969ceSTreehugger Robot  */
6*8ec969ceSTreehugger Robot 
7*8ec969ceSTreehugger Robot /* $Header: /tmp_amd/presto/export/kbs/jutta/src/gsm/RCS/short_term.c,v 1.2 1994/05/10 20:18:47 jutta Exp $ */
8*8ec969ceSTreehugger Robot 
9*8ec969ceSTreehugger Robot #include <stdio.h>
10*8ec969ceSTreehugger Robot #include <assert.h>
11*8ec969ceSTreehugger Robot 
12*8ec969ceSTreehugger Robot #include "private.h"
13*8ec969ceSTreehugger Robot 
14*8ec969ceSTreehugger Robot #include "gsm.h"
15*8ec969ceSTreehugger Robot #include "proto.h"
16*8ec969ceSTreehugger Robot 
17*8ec969ceSTreehugger Robot /*
18*8ec969ceSTreehugger Robot  *  SHORT TERM ANALYSIS FILTERING SECTION
19*8ec969ceSTreehugger Robot  */
20*8ec969ceSTreehugger Robot 
21*8ec969ceSTreehugger Robot /* 4.2.8 */
22*8ec969ceSTreehugger Robot 
23*8ec969ceSTreehugger Robot static void Decoding_of_the_coded_Log_Area_Ratios P2((LARc,LARpp),
24*8ec969ceSTreehugger Robot 	word 	* LARc,		/* coded log area ratio	[0..7] 	IN	*/
25*8ec969ceSTreehugger Robot 	word	* LARpp)	/* out: decoded ..			*/
26*8ec969ceSTreehugger Robot {
27*8ec969ceSTreehugger Robot 	register word	temp1 /* , temp2 */;
28*8ec969ceSTreehugger Robot 	register long	ltmp;	/* for GSM_ADD */
29*8ec969ceSTreehugger Robot 
30*8ec969ceSTreehugger Robot 	/*  This procedure requires for efficient implementation
31*8ec969ceSTreehugger Robot 	 *  two tables.
32*8ec969ceSTreehugger Robot  	 *
33*8ec969ceSTreehugger Robot 	 *  INVA[1..8] = integer( (32768 * 8) / real_A[1..8])
34*8ec969ceSTreehugger Robot 	 *  MIC[1..8]  = minimum value of the LARc[1..8]
35*8ec969ceSTreehugger Robot 	 */
36*8ec969ceSTreehugger Robot 
37*8ec969ceSTreehugger Robot 	/*  Compute the LARpp[1..8]
38*8ec969ceSTreehugger Robot 	 */
39*8ec969ceSTreehugger Robot 
40*8ec969ceSTreehugger Robot 	/* 	for (i = 1; i <= 8; i++, B++, MIC++, INVA++, LARc++, LARpp++) {
41*8ec969ceSTreehugger Robot 	 *
42*8ec969ceSTreehugger Robot 	 *		temp1  = GSM_ADD( *LARc, *MIC ) << 10;
43*8ec969ceSTreehugger Robot 	 *		temp2  = *B << 1;
44*8ec969ceSTreehugger Robot 	 *		temp1  = GSM_SUB( temp1, temp2 );
45*8ec969ceSTreehugger Robot 	 *
46*8ec969ceSTreehugger Robot 	 *		assert(*INVA != MIN_WORD);
47*8ec969ceSTreehugger Robot 	 *
48*8ec969ceSTreehugger Robot 	 *		temp1  = GSM_MULT_R( *INVA, temp1 );
49*8ec969ceSTreehugger Robot 	 *		*LARpp = GSM_ADD( temp1, temp1 );
50*8ec969ceSTreehugger Robot 	 *	}
51*8ec969ceSTreehugger Robot 	 */
52*8ec969ceSTreehugger Robot 
53*8ec969ceSTreehugger Robot #undef	STEP
54*8ec969ceSTreehugger Robot #define	STEP( B_TIMES_TWO, MIC, INVA )	\
55*8ec969ceSTreehugger Robot 		temp1    = GSM_ADD( *LARc++, MIC ) << 10;	\
56*8ec969ceSTreehugger Robot 		temp1    = GSM_SUB( temp1, B_TIMES_TWO );	\
57*8ec969ceSTreehugger Robot 		temp1    = GSM_MULT_R( INVA, temp1 );		\
58*8ec969ceSTreehugger Robot 		*LARpp++ = GSM_ADD( temp1, temp1 );
59*8ec969ceSTreehugger Robot 
60*8ec969ceSTreehugger Robot 	STEP(      0,  -32,  13107 );
61*8ec969ceSTreehugger Robot 	STEP(      0,  -32,  13107 );
62*8ec969ceSTreehugger Robot 	STEP(   4096,  -16,  13107 );
63*8ec969ceSTreehugger Robot 	STEP(  -5120,  -16,  13107 );
64*8ec969ceSTreehugger Robot 
65*8ec969ceSTreehugger Robot 	STEP(    188,   -8,  19223 );
66*8ec969ceSTreehugger Robot 	STEP(  -3584,   -8,  17476 );
67*8ec969ceSTreehugger Robot 	STEP(   -682,   -4,  31454 );
68*8ec969ceSTreehugger Robot 	STEP(  -2288,   -4,  29708 );
69*8ec969ceSTreehugger Robot 
70*8ec969ceSTreehugger Robot 	/* NOTE: the addition of *MIC is used to restore
71*8ec969ceSTreehugger Robot 	 * 	 the sign of *LARc.
72*8ec969ceSTreehugger Robot 	 */
73*8ec969ceSTreehugger Robot }
74*8ec969ceSTreehugger Robot 
75*8ec969ceSTreehugger Robot /* 4.2.9 */
76*8ec969ceSTreehugger Robot /* Computation of the quantized reflection coefficients
77*8ec969ceSTreehugger Robot  */
78*8ec969ceSTreehugger Robot 
79*8ec969ceSTreehugger Robot /* 4.2.9.1  Interpolation of the LARpp[1..8] to get the LARp[1..8]
80*8ec969ceSTreehugger Robot  */
81*8ec969ceSTreehugger Robot 
82*8ec969ceSTreehugger Robot /*
83*8ec969ceSTreehugger Robot  *  Within each frame of 160 analyzed speech samples the short term
84*8ec969ceSTreehugger Robot  *  analysis and synthesis filters operate with four different sets of
85*8ec969ceSTreehugger Robot  *  coefficients, derived from the previous set of decoded LARs(LARpp(j-1))
86*8ec969ceSTreehugger Robot  *  and the actual set of decoded LARs (LARpp(j))
87*8ec969ceSTreehugger Robot  *
88*8ec969ceSTreehugger Robot  * (Initial value: LARpp(j-1)[1..8] = 0.)
89*8ec969ceSTreehugger Robot  */
90*8ec969ceSTreehugger Robot 
91*8ec969ceSTreehugger Robot static void Coefficients_0_12 P3((LARpp_j_1, LARpp_j, LARp),
92*8ec969ceSTreehugger Robot 	register word * LARpp_j_1,
93*8ec969ceSTreehugger Robot 	register word * LARpp_j,
94*8ec969ceSTreehugger Robot 	register word * LARp)
95*8ec969ceSTreehugger Robot {
96*8ec969ceSTreehugger Robot 	register int 	i;
97*8ec969ceSTreehugger Robot 	register longword ltmp;
98*8ec969ceSTreehugger Robot 
99*8ec969ceSTreehugger Robot 	for (i = 1; i <= 8; i++, LARp++, LARpp_j_1++, LARpp_j++) {
100*8ec969ceSTreehugger Robot 		*LARp = GSM_ADD( SASR( *LARpp_j_1, 2 ), SASR( *LARpp_j, 2 ));
101*8ec969ceSTreehugger Robot 		*LARp = GSM_ADD( *LARp,  SASR( *LARpp_j_1, 1));
102*8ec969ceSTreehugger Robot 	}
103*8ec969ceSTreehugger Robot }
104*8ec969ceSTreehugger Robot 
105*8ec969ceSTreehugger Robot static void Coefficients_13_26 P3((LARpp_j_1, LARpp_j, LARp),
106*8ec969ceSTreehugger Robot 	register word * LARpp_j_1,
107*8ec969ceSTreehugger Robot 	register word * LARpp_j,
108*8ec969ceSTreehugger Robot 	register word * LARp)
109*8ec969ceSTreehugger Robot {
110*8ec969ceSTreehugger Robot 	register int i;
111*8ec969ceSTreehugger Robot 	register longword ltmp;
112*8ec969ceSTreehugger Robot 	for (i = 1; i <= 8; i++, LARpp_j_1++, LARpp_j++, LARp++) {
113*8ec969ceSTreehugger Robot 		*LARp = GSM_ADD( SASR( *LARpp_j_1, 1), SASR( *LARpp_j, 1 ));
114*8ec969ceSTreehugger Robot 	}
115*8ec969ceSTreehugger Robot }
116*8ec969ceSTreehugger Robot 
117*8ec969ceSTreehugger Robot static void Coefficients_27_39 P3((LARpp_j_1, LARpp_j, LARp),
118*8ec969ceSTreehugger Robot 	register word * LARpp_j_1,
119*8ec969ceSTreehugger Robot 	register word * LARpp_j,
120*8ec969ceSTreehugger Robot 	register word * LARp)
121*8ec969ceSTreehugger Robot {
122*8ec969ceSTreehugger Robot 	register int i;
123*8ec969ceSTreehugger Robot 	register longword ltmp;
124*8ec969ceSTreehugger Robot 
125*8ec969ceSTreehugger Robot 	for (i = 1; i <= 8; i++, LARpp_j_1++, LARpp_j++, LARp++) {
126*8ec969ceSTreehugger Robot 		*LARp = GSM_ADD( SASR( *LARpp_j_1, 2 ), SASR( *LARpp_j, 2 ));
127*8ec969ceSTreehugger Robot 		*LARp = GSM_ADD( *LARp, SASR( *LARpp_j, 1 ));
128*8ec969ceSTreehugger Robot 	}
129*8ec969ceSTreehugger Robot }
130*8ec969ceSTreehugger Robot 
131*8ec969ceSTreehugger Robot 
132*8ec969ceSTreehugger Robot static void Coefficients_40_159 P2((LARpp_j, LARp),
133*8ec969ceSTreehugger Robot 	register word * LARpp_j,
134*8ec969ceSTreehugger Robot 	register word * LARp)
135*8ec969ceSTreehugger Robot {
136*8ec969ceSTreehugger Robot 	register int i;
137*8ec969ceSTreehugger Robot 
138*8ec969ceSTreehugger Robot 	for (i = 1; i <= 8; i++, LARp++, LARpp_j++)
139*8ec969ceSTreehugger Robot 		*LARp = *LARpp_j;
140*8ec969ceSTreehugger Robot }
141*8ec969ceSTreehugger Robot 
142*8ec969ceSTreehugger Robot /* 4.2.9.2 */
143*8ec969ceSTreehugger Robot 
144*8ec969ceSTreehugger Robot static void LARp_to_rp P1((LARp),
145*8ec969ceSTreehugger Robot 	register word * LARp)	/* [0..7] IN/OUT  */
146*8ec969ceSTreehugger Robot /*
147*8ec969ceSTreehugger Robot  *  The input of this procedure is the interpolated LARp[0..7] array.
148*8ec969ceSTreehugger Robot  *  The reflection coefficients, rp[i], are used in the analysis
149*8ec969ceSTreehugger Robot  *  filter and in the synthesis filter.
150*8ec969ceSTreehugger Robot  */
151*8ec969ceSTreehugger Robot {
152*8ec969ceSTreehugger Robot 	register int 		i;
153*8ec969ceSTreehugger Robot 	register word		temp;
154*8ec969ceSTreehugger Robot 	register longword	ltmp;
155*8ec969ceSTreehugger Robot 
156*8ec969ceSTreehugger Robot 	for (i = 1; i <= 8; i++, LARp++) {
157*8ec969ceSTreehugger Robot 
158*8ec969ceSTreehugger Robot 		/* temp = GSM_ABS( *LARp );
159*8ec969ceSTreehugger Robot 	         *
160*8ec969ceSTreehugger Robot 		 * if (temp < 11059) temp <<= 1;
161*8ec969ceSTreehugger Robot 		 * else if (temp < 20070) temp += 11059;
162*8ec969ceSTreehugger Robot 		 * else temp = GSM_ADD( temp >> 2, 26112 );
163*8ec969ceSTreehugger Robot 		 *
164*8ec969ceSTreehugger Robot 		 * *LARp = *LARp < 0 ? -temp : temp;
165*8ec969ceSTreehugger Robot 		 */
166*8ec969ceSTreehugger Robot 
167*8ec969ceSTreehugger Robot 		if (*LARp < 0) {
168*8ec969ceSTreehugger Robot 			temp = *LARp == MIN_WORD ? MAX_WORD : -(*LARp);
169*8ec969ceSTreehugger Robot 			*LARp = - ((temp < 11059) ? temp << 1
170*8ec969ceSTreehugger Robot 				: ((temp < 20070) ? temp + 11059
171*8ec969ceSTreehugger Robot 				:  GSM_ADD( temp >> 2, 26112 )));
172*8ec969ceSTreehugger Robot 		} else {
173*8ec969ceSTreehugger Robot 			temp  = *LARp;
174*8ec969ceSTreehugger Robot 			*LARp =    (temp < 11059) ? temp << 1
175*8ec969ceSTreehugger Robot 				: ((temp < 20070) ? temp + 11059
176*8ec969ceSTreehugger Robot 				:  GSM_ADD( temp >> 2, 26112 ));
177*8ec969ceSTreehugger Robot 		}
178*8ec969ceSTreehugger Robot 	}
179*8ec969ceSTreehugger Robot }
180*8ec969ceSTreehugger Robot 
181*8ec969ceSTreehugger Robot 
182*8ec969ceSTreehugger Robot /* 4.2.10 */
183*8ec969ceSTreehugger Robot static void Short_term_analysis_filtering P4((S,rp,k_n,s),
184*8ec969ceSTreehugger Robot 	struct gsm_state * S,
185*8ec969ceSTreehugger Robot 	register word	* rp,	/* [0..7]	IN	*/
186*8ec969ceSTreehugger Robot 	register int 	k_n, 	/*   k_end - k_start	*/
187*8ec969ceSTreehugger Robot 	register word	* s	/* [0..n-1]	IN/OUT	*/
188*8ec969ceSTreehugger Robot )
189*8ec969ceSTreehugger Robot /*
190*8ec969ceSTreehugger Robot  *  This procedure computes the short term residual signal d[..] to be fed
191*8ec969ceSTreehugger Robot  *  to the RPE-LTP loop from the s[..] signal and from the local rp[..]
192*8ec969ceSTreehugger Robot  *  array (quantized reflection coefficients).  As the call of this
193*8ec969ceSTreehugger Robot  *  procedure can be done in many ways (see the interpolation of the LAR
194*8ec969ceSTreehugger Robot  *  coefficient), it is assumed that the computation begins with index
195*8ec969ceSTreehugger Robot  *  k_start (for arrays d[..] and s[..]) and stops with index k_end
196*8ec969ceSTreehugger Robot  *  (k_start and k_end are defined in 4.2.9.1).  This procedure also
197*8ec969ceSTreehugger Robot  *  needs to keep the array u[0..7] in memory for each call.
198*8ec969ceSTreehugger Robot  */
199*8ec969ceSTreehugger Robot {
200*8ec969ceSTreehugger Robot 	register word		* u = S->u;
201*8ec969ceSTreehugger Robot 	register int		i;
202*8ec969ceSTreehugger Robot 	register word		di, zzz, ui, sav, rpi;
203*8ec969ceSTreehugger Robot 	register longword 	ltmp;
204*8ec969ceSTreehugger Robot 
205*8ec969ceSTreehugger Robot 	for (; k_n--; s++) {
206*8ec969ceSTreehugger Robot 
207*8ec969ceSTreehugger Robot 		di = sav = *s;
208*8ec969ceSTreehugger Robot 
209*8ec969ceSTreehugger Robot 		for (i = 0; i < 8; i++) {		/* YYY */
210*8ec969ceSTreehugger Robot 
211*8ec969ceSTreehugger Robot 			ui    = u[i];
212*8ec969ceSTreehugger Robot 			rpi   = rp[i];
213*8ec969ceSTreehugger Robot 			u[i]  = sav;
214*8ec969ceSTreehugger Robot 
215*8ec969ceSTreehugger Robot 			zzz   = GSM_MULT_R(rpi, di);
216*8ec969ceSTreehugger Robot 			sav   = GSM_ADD(   ui,  zzz);
217*8ec969ceSTreehugger Robot 
218*8ec969ceSTreehugger Robot 			zzz   = GSM_MULT_R(rpi, ui);
219*8ec969ceSTreehugger Robot 			di    = GSM_ADD(   di,  zzz );
220*8ec969ceSTreehugger Robot 		}
221*8ec969ceSTreehugger Robot 
222*8ec969ceSTreehugger Robot 		*s = di;
223*8ec969ceSTreehugger Robot 	}
224*8ec969ceSTreehugger Robot }
225*8ec969ceSTreehugger Robot 
226*8ec969ceSTreehugger Robot #if defined(USE_FLOAT_MUL) && defined(FAST)
227*8ec969ceSTreehugger Robot 
228*8ec969ceSTreehugger Robot static void Fast_Short_term_analysis_filtering P4((S,rp,k_n,s),
229*8ec969ceSTreehugger Robot 	struct gsm_state * S,
230*8ec969ceSTreehugger Robot 	register word	* rp,	/* [0..7]	IN	*/
231*8ec969ceSTreehugger Robot 	register int 	k_n, 	/*   k_end - k_start	*/
232*8ec969ceSTreehugger Robot 	register word	* s	/* [0..n-1]	IN/OUT	*/
233*8ec969ceSTreehugger Robot )
234*8ec969ceSTreehugger Robot {
235*8ec969ceSTreehugger Robot 	register word		* u = S->u;
236*8ec969ceSTreehugger Robot 	register int		i;
237*8ec969ceSTreehugger Robot 
238*8ec969ceSTreehugger Robot 	float 	  uf[8],
239*8ec969ceSTreehugger Robot 		 rpf[8];
240*8ec969ceSTreehugger Robot 
241*8ec969ceSTreehugger Robot 	register float scalef = 3.0517578125e-5;
242*8ec969ceSTreehugger Robot 	register float		sav, di, temp;
243*8ec969ceSTreehugger Robot 
244*8ec969ceSTreehugger Robot 	for (i = 0; i < 8; ++i) {
245*8ec969ceSTreehugger Robot 		uf[i]  = u[i];
246*8ec969ceSTreehugger Robot 		rpf[i] = rp[i] * scalef;
247*8ec969ceSTreehugger Robot 	}
248*8ec969ceSTreehugger Robot 	for (; k_n--; s++) {
249*8ec969ceSTreehugger Robot 		sav = di = *s;
250*8ec969ceSTreehugger Robot 		for (i = 0; i < 8; ++i) {
251*8ec969ceSTreehugger Robot 			register float rpfi = rpf[i];
252*8ec969ceSTreehugger Robot 			register float ufi  = uf[i];
253*8ec969ceSTreehugger Robot 
254*8ec969ceSTreehugger Robot 			uf[i] = sav;
255*8ec969ceSTreehugger Robot 			temp  = rpfi * di + ufi;
256*8ec969ceSTreehugger Robot 			di   += rpfi * ufi;
257*8ec969ceSTreehugger Robot 			sav   = temp;
258*8ec969ceSTreehugger Robot 		}
259*8ec969ceSTreehugger Robot 		*s = di;
260*8ec969ceSTreehugger Robot 	}
261*8ec969ceSTreehugger Robot 	for (i = 0; i < 8; ++i) u[i] = uf[i];
262*8ec969ceSTreehugger Robot }
263*8ec969ceSTreehugger Robot #endif /* ! (defined (USE_FLOAT_MUL) && defined (FAST)) */
264*8ec969ceSTreehugger Robot 
265*8ec969ceSTreehugger Robot static void Short_term_synthesis_filtering P5((S,rrp,k,wt,sr),
266*8ec969ceSTreehugger Robot 	struct gsm_state * S,
267*8ec969ceSTreehugger Robot 	register word	* rrp,	/* [0..7]	IN	*/
268*8ec969ceSTreehugger Robot 	register int	k,	/* k_end - k_start	*/
269*8ec969ceSTreehugger Robot 	register word	* wt,	/* [0..k-1]	IN	*/
270*8ec969ceSTreehugger Robot 	register word	* sr	/* [0..k-1]	OUT	*/
271*8ec969ceSTreehugger Robot )
272*8ec969ceSTreehugger Robot {
273*8ec969ceSTreehugger Robot 	register word		* v = S->v;
274*8ec969ceSTreehugger Robot 	register int		i;
275*8ec969ceSTreehugger Robot 	register word		sri, tmp1, tmp2;
276*8ec969ceSTreehugger Robot 	register longword	ltmp;	/* for GSM_ADD  & GSM_SUB */
277*8ec969ceSTreehugger Robot 
278*8ec969ceSTreehugger Robot 	while (k--) {
279*8ec969ceSTreehugger Robot 		sri = *wt++;
280*8ec969ceSTreehugger Robot 		for (i = 8; i--;) {
281*8ec969ceSTreehugger Robot 
282*8ec969ceSTreehugger Robot 			/* sri = GSM_SUB( sri, gsm_mult_r( rrp[i], v[i] ) );
283*8ec969ceSTreehugger Robot 			 */
284*8ec969ceSTreehugger Robot 			tmp1 = rrp[i];
285*8ec969ceSTreehugger Robot 			tmp2 = v[i];
286*8ec969ceSTreehugger Robot 			tmp2 =  ( tmp1 == MIN_WORD && tmp2 == MIN_WORD
287*8ec969ceSTreehugger Robot 				? MAX_WORD
288*8ec969ceSTreehugger Robot 				: 0x0FFFF & (( (longword)tmp1 * (longword)tmp2
289*8ec969ceSTreehugger Robot 					     + 16384) >> 15)) ;
290*8ec969ceSTreehugger Robot 
291*8ec969ceSTreehugger Robot 			sri  = GSM_SUB( sri, tmp2 );
292*8ec969ceSTreehugger Robot 
293*8ec969ceSTreehugger Robot 			/* v[i+1] = GSM_ADD( v[i], gsm_mult_r( rrp[i], sri ) );
294*8ec969ceSTreehugger Robot 			 */
295*8ec969ceSTreehugger Robot 			tmp1  = ( tmp1 == MIN_WORD && sri == MIN_WORD
296*8ec969ceSTreehugger Robot 				? MAX_WORD
297*8ec969ceSTreehugger Robot 				: 0x0FFFF & (( (longword)tmp1 * (longword)sri
298*8ec969ceSTreehugger Robot 					     + 16384) >> 15)) ;
299*8ec969ceSTreehugger Robot 
300*8ec969ceSTreehugger Robot 			v[i+1] = GSM_ADD( v[i], tmp1);
301*8ec969ceSTreehugger Robot 		}
302*8ec969ceSTreehugger Robot 		*sr++ = v[0] = sri;
303*8ec969ceSTreehugger Robot 	}
304*8ec969ceSTreehugger Robot }
305*8ec969ceSTreehugger Robot 
306*8ec969ceSTreehugger Robot 
307*8ec969ceSTreehugger Robot #if defined(FAST) && defined(USE_FLOAT_MUL)
308*8ec969ceSTreehugger Robot 
309*8ec969ceSTreehugger Robot static void Fast_Short_term_synthesis_filtering P5((S,rrp,k,wt,sr),
310*8ec969ceSTreehugger Robot 	struct gsm_state * S,
311*8ec969ceSTreehugger Robot 	register word	* rrp,	/* [0..7]	IN	*/
312*8ec969ceSTreehugger Robot 	register int	k,	/* k_end - k_start	*/
313*8ec969ceSTreehugger Robot 	register word	* wt,	/* [0..k-1]	IN	*/
314*8ec969ceSTreehugger Robot 	register word	* sr	/* [0..k-1]	OUT	*/
315*8ec969ceSTreehugger Robot )
316*8ec969ceSTreehugger Robot {
317*8ec969ceSTreehugger Robot 	register word		* v = S->v;
318*8ec969ceSTreehugger Robot 	register int		i;
319*8ec969ceSTreehugger Robot 
320*8ec969ceSTreehugger Robot 	float va[9], rrpa[8];
321*8ec969ceSTreehugger Robot 	register float scalef = 3.0517578125e-5, temp;
322*8ec969ceSTreehugger Robot 
323*8ec969ceSTreehugger Robot 	for (i = 0; i < 8; ++i) {
324*8ec969ceSTreehugger Robot 		va[i]   = v[i];
325*8ec969ceSTreehugger Robot 		rrpa[i] = (float)rrp[i] * scalef;
326*8ec969ceSTreehugger Robot 	}
327*8ec969ceSTreehugger Robot 	while (k--) {
328*8ec969ceSTreehugger Robot 		register float sri = *wt++;
329*8ec969ceSTreehugger Robot 		for (i = 8; i--;) {
330*8ec969ceSTreehugger Robot 			sri -= rrpa[i] * va[i];
331*8ec969ceSTreehugger Robot 			if     (sri < -32768.) sri = -32768.;
332*8ec969ceSTreehugger Robot 			else if (sri > 32767.) sri =  32767.;
333*8ec969ceSTreehugger Robot 
334*8ec969ceSTreehugger Robot 			temp = va[i] + rrpa[i] * sri;
335*8ec969ceSTreehugger Robot 			if     (temp < -32768.) temp = -32768.;
336*8ec969ceSTreehugger Robot 			else if (temp > 32767.) temp =  32767.;
337*8ec969ceSTreehugger Robot 			va[i+1] = temp;
338*8ec969ceSTreehugger Robot 		}
339*8ec969ceSTreehugger Robot 		*sr++ = va[0] = sri;
340*8ec969ceSTreehugger Robot 	}
341*8ec969ceSTreehugger Robot 	for (i = 0; i < 9; ++i) v[i] = va[i];
342*8ec969ceSTreehugger Robot }
343*8ec969ceSTreehugger Robot 
344*8ec969ceSTreehugger Robot #endif /* defined(FAST) && defined(USE_FLOAT_MUL) */
345*8ec969ceSTreehugger Robot 
346*8ec969ceSTreehugger Robot void Gsm_Short_Term_Analysis_Filter P3((S,LARc,s),
347*8ec969ceSTreehugger Robot 
348*8ec969ceSTreehugger Robot 	struct gsm_state * S,
349*8ec969ceSTreehugger Robot 
350*8ec969ceSTreehugger Robot 	word	* LARc,		/* coded log area ratio [0..7]  IN	*/
351*8ec969ceSTreehugger Robot 	word	* s		/* signal [0..159]		IN/OUT	*/
352*8ec969ceSTreehugger Robot )
353*8ec969ceSTreehugger Robot {
354*8ec969ceSTreehugger Robot 	word		* LARpp_j	= S->LARpp[ S->j      ];
355*8ec969ceSTreehugger Robot 	word		* LARpp_j_1	= S->LARpp[ S->j ^= 1 ];
356*8ec969ceSTreehugger Robot 
357*8ec969ceSTreehugger Robot 	word		LARp[8];
358*8ec969ceSTreehugger Robot 
359*8ec969ceSTreehugger Robot #undef	FILTER
360*8ec969ceSTreehugger Robot #if 	defined(FAST) && defined(USE_FLOAT_MUL)
361*8ec969ceSTreehugger Robot # 	define	FILTER 	(* (S->fast			\
362*8ec969ceSTreehugger Robot 			   ? Fast_Short_term_analysis_filtering	\
363*8ec969ceSTreehugger Robot 		    	   : Short_term_analysis_filtering	))
364*8ec969ceSTreehugger Robot 
365*8ec969ceSTreehugger Robot #else
366*8ec969ceSTreehugger Robot # 	define	FILTER	Short_term_analysis_filtering
367*8ec969ceSTreehugger Robot #endif
368*8ec969ceSTreehugger Robot 
369*8ec969ceSTreehugger Robot 	Decoding_of_the_coded_Log_Area_Ratios( LARc, LARpp_j );
370*8ec969ceSTreehugger Robot 
371*8ec969ceSTreehugger Robot 	Coefficients_0_12(  LARpp_j_1, LARpp_j, LARp );
372*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
373*8ec969ceSTreehugger Robot 	FILTER( S, LARp, 13, s);
374*8ec969ceSTreehugger Robot 
375*8ec969ceSTreehugger Robot 	Coefficients_13_26( LARpp_j_1, LARpp_j, LARp);
376*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
377*8ec969ceSTreehugger Robot 	FILTER( S, LARp, 14, s + 13);
378*8ec969ceSTreehugger Robot 
379*8ec969ceSTreehugger Robot 	Coefficients_27_39( LARpp_j_1, LARpp_j, LARp);
380*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
381*8ec969ceSTreehugger Robot 	FILTER( S, LARp, 13, s + 27);
382*8ec969ceSTreehugger Robot 
383*8ec969ceSTreehugger Robot 	Coefficients_40_159( LARpp_j, LARp);
384*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
385*8ec969ceSTreehugger Robot 	FILTER( S, LARp, 120, s + 40);
386*8ec969ceSTreehugger Robot }
387*8ec969ceSTreehugger Robot 
388*8ec969ceSTreehugger Robot void Gsm_Short_Term_Synthesis_Filter P4((S, LARcr, wt, s),
389*8ec969ceSTreehugger Robot 	struct gsm_state * S,
390*8ec969ceSTreehugger Robot 
391*8ec969ceSTreehugger Robot 	word	* LARcr,	/* received log area ratios [0..7] IN  */
392*8ec969ceSTreehugger Robot 	word	* wt,		/* received d [0..159]		   IN  */
393*8ec969ceSTreehugger Robot 
394*8ec969ceSTreehugger Robot 	word	* s		/* signal   s [0..159]		  OUT  */
395*8ec969ceSTreehugger Robot )
396*8ec969ceSTreehugger Robot {
397*8ec969ceSTreehugger Robot 	word		* LARpp_j	= S->LARpp[ S->j     ];
398*8ec969ceSTreehugger Robot 	word		* LARpp_j_1	= S->LARpp[ S->j ^=1 ];
399*8ec969ceSTreehugger Robot 
400*8ec969ceSTreehugger Robot 	word		LARp[8];
401*8ec969ceSTreehugger Robot 
402*8ec969ceSTreehugger Robot #undef	FILTER
403*8ec969ceSTreehugger Robot #if 	defined(FAST) && defined(USE_FLOAT_MUL)
404*8ec969ceSTreehugger Robot 
405*8ec969ceSTreehugger Robot # 	define	FILTER 	(* (S->fast			\
406*8ec969ceSTreehugger Robot 			   ? Fast_Short_term_synthesis_filtering	\
407*8ec969ceSTreehugger Robot 		    	   : Short_term_synthesis_filtering	))
408*8ec969ceSTreehugger Robot #else
409*8ec969ceSTreehugger Robot #	define	FILTER	Short_term_synthesis_filtering
410*8ec969ceSTreehugger Robot #endif
411*8ec969ceSTreehugger Robot 
412*8ec969ceSTreehugger Robot 	Decoding_of_the_coded_Log_Area_Ratios( LARcr, LARpp_j );
413*8ec969ceSTreehugger Robot 
414*8ec969ceSTreehugger Robot 	Coefficients_0_12( LARpp_j_1, LARpp_j, LARp );
415*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
416*8ec969ceSTreehugger Robot 	FILTER( S, LARp, 13, wt, s );
417*8ec969ceSTreehugger Robot 
418*8ec969ceSTreehugger Robot 	Coefficients_13_26( LARpp_j_1, LARpp_j, LARp);
419*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
420*8ec969ceSTreehugger Robot 	FILTER( S, LARp, 14, wt + 13, s + 13 );
421*8ec969ceSTreehugger Robot 
422*8ec969ceSTreehugger Robot 	Coefficients_27_39( LARpp_j_1, LARpp_j, LARp);
423*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
424*8ec969ceSTreehugger Robot 	FILTER( S, LARp, 13, wt + 27, s + 27 );
425*8ec969ceSTreehugger Robot 
426*8ec969ceSTreehugger Robot 	Coefficients_40_159( LARpp_j, LARp );
427*8ec969ceSTreehugger Robot 	LARp_to_rp( LARp );
428*8ec969ceSTreehugger Robot 	FILTER(S, LARp, 120, wt + 40, s + 40);
429*8ec969ceSTreehugger Robot }
430