| /external/libvorbis/lib/ |
| lsp.h | 13 function: LSP (also called LSF) conversion routines
14 last mod: $Id: lsp.h 16227 2009-07-08 06:58:46Z xiphmont $
22 extern int vorbis_lpc_to_lsp(float *lpc,float *lsp,int m);
25 float *lsp,int m,
|
| lsp.c | 13 function: LSP (also called LSF) conversion routines
14 last mod: $Id: lsp.c 16227 2009-07-08 06:58:46Z xiphmont $
16 The LSP generation code is taken (with minimal modification and a
17 few bugfixes) from "On the Computation of the LSP Frequencies" by
25 /* Note that the lpc-lsp conversion finds the roots of polynomial with
38 #include "lsp.h"
44 /* three possible LSP to f curve functions; the exact computation
64 /* side effect: changes *lsp to cosines of lsp */
65 void vorbis_lsp_to_curve(float *curve,int *map,int n,int ln,float *lsp,int m
[all...] |
| floor0.c | 26 #include "lsp.h"
176 float *lsp=_vorbis_block_alloc(vb,sizeof(*lsp)*(look->m+b->dim+1)); local
179 if(vorbis_book_decodev_set(b,lsp+j,&vb->opb,b->dim)==-1)goto eop;
181 for(k=0;k<b->dim;k++,j++)lsp[j]+=last;
182 last=lsp[j-1];
185 lsp[look->m]=amp;
186 return(lsp);
201 float *lsp=(float *)memo; local
202 float amp=lsp[look->m]
[all...] |
| /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/ilbc/ |
| poly_to_lsf.c | 28 int16_t lsp[10]; local
29 WebRtcIlbcfix_Poly2Lsp(a, lsp, (int16_t*)WebRtcIlbcfix_kLspMean);
30 WebRtcIlbcfix_Lsp2Lsf(lsp, lsf, 10);
|
| lsp_to_lsf.c | 23 * conversion from LSP coefficients to LSF coefficients
27 int16_t *lsp, /* (i) lsp vector -1...+1 in Q15 */
43 Start with the highest LSP and then work the way down
44 For each LSP the lsf is calculated by first order approximation
47 lspPtr = &lsp[9];
53 locate value in the table, which is just above lsp[i],
66 The linear approximation of acos(lsp[i]) :
67 acos(lsp[i])= k*512 + (WebRtcIlbcfix_kAcosDerivative[ind]*offset >> 11)
|
| lsf_to_poly.c | 33 int16_t lsp[10]; local
36 /* Convert lsf to lsp */
37 WebRtcIlbcfix_Lsf2Lsp(lsf, lsp, LPC_FILTERORDER);
39 /* Get F1(z) and F2(z) from the lsp */
42 WebRtcIlbcfix_GetLspPoly(&lsp[0],f1ptr);
43 WebRtcIlbcfix_GetLspPoly(&lsp[1],f2ptr);
|
| poly_to_lsp.h | 25 * conversion from lpc coefficients to lsp coefficients
31 int16_t *lsp, /* (i) LSP coefficients in Q15 */
32 int16_t *old_lsp /* (i) old LSP coefficients that are used if the new
|
| poly_to_lsp.c | 24 * conversion from lpc coefficients to lsp coefficients
30 int16_t *lsp, /* (i) LSP coefficients in Q15 */
31 int16_t *old_lsp /* (i) old LSP coefficients that are used if the new
79 Iterate until all the 10 LSP's have been found or
80 all the grid points have been tried. If the 10 LSP's can
81 not be found, set the LSP vector to previous LSP
136 /* Store the calculated lsp */
137 lsp[foundFreqs] = (int16_t)xint
[all...] |
| get_lsp_poly.h | 25 * Construct the polynomials F1(z) and F2(z) from the LSP
31 * tmp = -2.0 * lsp[0];
34 * b = -2.0 * lsp[2*i-2];
44 int16_t *lsp, /* (i) LSP in Q15 */
|
| get_lsp_poly.c | 22 * Construct the polynomials F1(z) and F2(z) from the LSP
28 * tmp = -2.0 * lsp[0];
31 * b = -2.0 * lsp[2*i-2];
41 int16_t *lsp, /* (i) LSP in Q15 */
50 lspPtr = lsp;
|
| lsf_to_lsp.h | 25 * conversion from lsf to lsp coefficients
30 int16_t *lsp, /* (o) lsp in Q15 values between -1 and 1 */
|
| lsp_to_lsf.h | 25 * conversion from LSP coefficients to LSF coefficients
29 int16_t *lsp, /* (i) lsp vector -1...+1 in Q15 */
|
| lsf_to_lsp.c | 23 * conversion from lsf to lsp coefficients
28 int16_t *lsp, /* (o) lsp in Q15 values between -1 and 1 */
57 lsp[i] = WebRtcIlbcfix_kCos[k]+(int16_t)(WEBRTC_SPL_RSHIFT_W32(tmpW32, 12));
|
| /external/speex/libspeex/ |
| quant_lsp.c | 3 LSP vector quantization
159 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits)
166 qlsp[i]=lsp[i];
210 qlsp[i]=lsp[i]-qlsp[i];
213 void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits)
217 lsp[i]=LSP_LINEAR(i);
222 lsp[i] = ADD32(lsp[i], LSP_DIV_256(cdbk_nb[id*10+i]));
226 lsp[i] = ADD16(lsp[i], LSP_DIV_512(cdbk_nb_low1[id*5+i]))
[all...] |
| quant_lsp.h | 4 @brief LSP vector quantization
57 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
60 void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits);
63 void lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
66 void lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits);
69 void lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
72 void lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits);
|
| lsp.c | 3 FILE........: lsp.c
11 Coefficients (LPC) to Line Spectral Pair (LSP) and back. Note that the
12 LSP coefficients are not in radians format but in the x domain of the
70 LSP frequencies is basically finding the roots of 5th order
87 #include "lsp.h"
207 This function converts LPC coefficients to LSP
222 /* float *freq LSP frequencies in the x domain */
397 Converts LSP coefficients to LPC coefficients.
404 /* float *freq array of LSP frequencies in the x domain */
421 in form 1 - 2cos(w)z(-1) + z(-2), where w is the LSP frequency
[all...] |
| modes.c | 156 /* LSP quantization */
177 /*LSP quantization*/
198 /*LSP quantization*/
219 /*LSP quantization*/
240 /*LSP quantization*/
261 /*LSP quantization*/
282 /*LSP quantization*/
303 /*LSP quantization*/
|
| lsp.h | 12 Coefficients (LPC) to Line Spectral Pair (LSP) and back. Note that the
13 LSP coefficients are not in radians format but in the x domain of the
18 @file lsp.h
19 @brief Line Spectral Pair (LSP) functions.
60 void lsp_enforce_margin(spx_lsp_t *lsp, int len, spx_word16_t margin);
|
| /external/speex/ |
| AUTHORS | 5 lsp.c lsp.h
|
| /external/chromium_org/chrome/browser/safe_browsing/ |
| environment_data_collection_win_unittest.cc | 64 // We'll test RecordLspFeatures against a real dll registered as a LSP. All
70 // Look for dlls that are registered as a LSP.
73 // Look through dll entries and check that none contains the LSP feature.
82 LSP)
90 // Manually add an entry to the process report that will get marked as a LSP.
97 // Look for dlls that are registered as a LSP.
100 // Look through dll entries and check if the one we added contains the LSP
110 LSP)
|
| environment_data_collection_win.h | 18 // check one of them is a registered LSP.
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| int_lpc.cpp | 99 lsp_old -- array of type Word16 -- LSP vector at the
101 lsp_mid -- array of type Word16 -- LSP vector at the 2nd subfr. of
103 lsp_new -- array of type Word16 -- LSP vector at the 4th subfr. of
175 Word16 lsp_old[], /* i : LSP vector at the 4th subfr. of past frame (M) */
176 Word16 lsp_mid[], /* i : LSP vector at the 2nd subfr. of
178 Word16 lsp_new[], /* i : LSP vector at the 4th subfr. of
186 Word16 lsp[M]; local
190 Word16 *p_lsp = &lsp[0];
192 /* lsp[i] = lsp_mid[i] * 0.5 + lsp_old[i] * 0.5 */
201 lsp,
323 Word16 lsp[M]; local
446 Word16 lsp[M]; local
582 Word16 lsp[M]; local
[all...] |
| lsp_az.cpp | 91 This file contains functions that convert line spectral pairs (LSP) to
94 F1(z) and F2(z), and Lsp_Az, which converts LSP to LPC by multiplying
135 lsp = pointer to the buffer containing the line spectral pairs (LSP)
160 This function finds the polynomial F1(z) or F2(z) from the LSPs. If the LSP
166 F1(z) = product ( 1 - 2 lsp[i] z^-1 + z^-2 )
168 F2(z) = product ( 1 - 2 lsp[i] z^-1 + z^-2 )
171 where lsp[] is the LSP vector in the cosine domain.
176 b = -2.0 * lsp[0
[all...] |
| lsp_lsf.cpp | 71 This file contains the functions that convert line spectral pairs (LSP) to
129 lsp = buffer containing line spectral pairs; valid range is between
134 lsp contains the newly calculated line spectral pairs
148 This function performs the LSF to LSP transformation using the equation:
150 lsf[i] = arccos(lsp[i])/(2*pi)
152 The transformation from lsp[i] to lsf[i] is approximated by a look-up table
170 Word16 lsp[], // (o) : lsp[m] (range: -1<=val<1)
182 // lsp[i] = table[ind]+ ((table[ind+1]-table[ind])*offset) / 256
185 lsp[i] = add (table[ind], extract_l (L_shr (L_tmp, 9)))
[all...] |
| /external/libvorbis/ |
| Android.mk | 19 lib/lsp.c \
|
