1b815c7f3Sopenharmony_ci/* 2b815c7f3Sopenharmony_ci * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische 3b815c7f3Sopenharmony_ci * Universitaet Berlin. See the accompanying file "COPYRIGHT" for 4b815c7f3Sopenharmony_ci * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. 5b815c7f3Sopenharmony_ci */ 6b815c7f3Sopenharmony_ci 7b815c7f3Sopenharmony_ci 8b815c7f3Sopenharmony_ci#include <stdlib.h> 9b815c7f3Sopenharmony_ci#include <string.h> 10b815c7f3Sopenharmony_ci 11b815c7f3Sopenharmony_ci#include "gsm610_priv.h" 12b815c7f3Sopenharmony_ci 13b815c7f3Sopenharmony_ci/* 14b815c7f3Sopenharmony_ci * 4.2 FIXED POINT IMPLEMENTATION OF THE RPE-LTP CODER 15b815c7f3Sopenharmony_ci */ 16b815c7f3Sopenharmony_ci 17b815c7f3Sopenharmony_civoid Gsm_Coder ( 18b815c7f3Sopenharmony_ci 19b815c7f3Sopenharmony_ci struct gsm_state * State, 20b815c7f3Sopenharmony_ci 21b815c7f3Sopenharmony_ci int16_t * s, /* [0..159] samples IN */ 22b815c7f3Sopenharmony_ci 23b815c7f3Sopenharmony_ci/* 24b815c7f3Sopenharmony_ci * The RPE-LTD coder works on a frame by frame basis. The length of 25b815c7f3Sopenharmony_ci * the frame is equal to 160 samples. Some computations are done 26b815c7f3Sopenharmony_ci * once per frame to produce at the output of the coder the 27b815c7f3Sopenharmony_ci * LARc [1..8] parameters which are the coded LAR coefficients and 28b815c7f3Sopenharmony_ci * also to realize the inverse filtering operation for the entire 29b815c7f3Sopenharmony_ci * frame (160 samples of signal d [0..159]). These parts produce at 30b815c7f3Sopenharmony_ci * the output of the coder: 31b815c7f3Sopenharmony_ci */ 32b815c7f3Sopenharmony_ci 33b815c7f3Sopenharmony_ci int16_t * LARc, /* [0..7] LAR coefficients OUT */ 34b815c7f3Sopenharmony_ci 35b815c7f3Sopenharmony_ci/* 36b815c7f3Sopenharmony_ci * Procedure 4.2.11 to 4.2.18 are to be executed four times per 37b815c7f3Sopenharmony_ci * frame. That means once for each sub-segment RPE-LTP analysis of 38b815c7f3Sopenharmony_ci * 40 samples. These parts produce at the output of the coder: 39b815c7f3Sopenharmony_ci */ 40b815c7f3Sopenharmony_ci 41b815c7f3Sopenharmony_ci int16_t *Nc, /* [0..3] LTP lag OUT */ 42b815c7f3Sopenharmony_ci int16_t *bc, /* [0..3] coded LTP gain OUT */ 43b815c7f3Sopenharmony_ci int16_t *Mc, /* [0..3] RPE grid selection OUT */ 44b815c7f3Sopenharmony_ci int16_t *xmaxc, /* [0..3] Coded maximum amplitude OUT */ 45b815c7f3Sopenharmony_ci int16_t *xMc /* [13*4] normalized RPE samples OUT */ 46b815c7f3Sopenharmony_ci) 47b815c7f3Sopenharmony_ci{ 48b815c7f3Sopenharmony_ci int k ; 49b815c7f3Sopenharmony_ci int16_t *dp = State->dp0 + 120 ; /* [-120...-1] */ 50b815c7f3Sopenharmony_ci int16_t *dpp = dp ; /* [0...39] */ 51b815c7f3Sopenharmony_ci 52b815c7f3Sopenharmony_ci int16_t so [160] ; 53b815c7f3Sopenharmony_ci 54b815c7f3Sopenharmony_ci Gsm_Preprocess (State, s, so) ; 55b815c7f3Sopenharmony_ci Gsm_LPC_Analysis (State, so, LARc) ; 56b815c7f3Sopenharmony_ci Gsm_Short_Term_Analysis_Filter (State, LARc, so) ; 57b815c7f3Sopenharmony_ci 58b815c7f3Sopenharmony_ci for (k = 0 ; k <= 3 ; k++, xMc += 13) 59b815c7f3Sopenharmony_ci { Gsm_Long_Term_Predictor (State, 60b815c7f3Sopenharmony_ci so+k*40, /* d [0..39] IN */ 61b815c7f3Sopenharmony_ci dp, /* dp [-120..-1] IN */ 62b815c7f3Sopenharmony_ci State->e + 5, /* e [0..39] OUT */ 63b815c7f3Sopenharmony_ci dpp, /* dpp [0..39] OUT */ 64b815c7f3Sopenharmony_ci Nc++, 65b815c7f3Sopenharmony_ci bc++) ; 66b815c7f3Sopenharmony_ci 67b815c7f3Sopenharmony_ci Gsm_RPE_Encoding (/*-S,-*/ 68b815c7f3Sopenharmony_ci State->e + 5, /* e ][0..39][IN/OUT */ 69b815c7f3Sopenharmony_ci xmaxc++, Mc++, xMc) ; 70b815c7f3Sopenharmony_ci /* 71b815c7f3Sopenharmony_ci * Gsm_Update_of_reconstructed_short_time_residual_signal 72b815c7f3Sopenharmony_ci * (dpp, State->e + 5, dp) ; 73b815c7f3Sopenharmony_ci */ 74b815c7f3Sopenharmony_ci 75b815c7f3Sopenharmony_ci { 76b815c7f3Sopenharmony_ci register int i ; 77b815c7f3Sopenharmony_ci for (i = 0 ; i <= 39 ; i++) 78b815c7f3Sopenharmony_ci dp [i] = GSM_ADD (State->e [5 + i], dpp [i]) ; 79b815c7f3Sopenharmony_ci } 80b815c7f3Sopenharmony_ci dp += 40 ; 81b815c7f3Sopenharmony_ci dpp += 40 ; 82b815c7f3Sopenharmony_ci 83b815c7f3Sopenharmony_ci } 84b815c7f3Sopenharmony_ci memcpy ((char *) State->dp0, (char *) (State->dp0 + 160), 85b815c7f3Sopenharmony_ci 120 * sizeof (*State->dp0)) ; 86b815c7f3Sopenharmony_ci} 87b815c7f3Sopenharmony_ci 88