1 /********************************************************************
3 * THIS FILE IS PART OF THE Ogg Vorbis SOFTWARE CODEC SOURCE CODE. *
4 * USE, DISTRIBUTION AND REPRODUCTION OF THIS SOURCE IS GOVERNED BY *
5 * THE GNU PUBLIC LICENSE 2, WHICH IS INCLUDED WITH THIS SOURCE. *
6 * PLEASE READ THESE TERMS DISTRIBUTING. *
8 * THE OggSQUISH SOURCE CODE IS (C) COPYRIGHT 1994-2000 *
9 * by Monty <monty@xiph.org> and The XIPHOPHORUS Company *
10 * http://www.xiph.org/ *
12 ********************************************************************
14 function: LSP (also called LSF) conversion routines
15 last mod: $Id: lsp.c,v 1.7 2000/04/06 16:46:51 xiphmont Exp $
17 The LSP generation code is taken (with minimal modification) from
18 "On the Computation of the LSP Frequencies" by Joseph Rothweiler
19 <rothwlr@altavista.net>, available at:
21 http://www2.xtdl.com/~rothwlr/lsfpaper/lsfpage.html
23 ********************************************************************/
31 void vorbis_lsp_to_lpc(double *lsp,double *lpc,int m){
33 double *O=alloca(sizeof(double)*m2);
34 double *E=alloca(sizeof(double)*m2);
36 double *Ae=alloca(sizeof(double)*(m2+1));
37 double *Ao=alloca(sizeof(double)*(m2+1));
39 double *Be=alloca(sizeof(double)*(m2));
40 double *Bo=alloca(sizeof(double)*(m2));
43 /* even/odd roots setup */
45 O[i]=-2.*cos(lsp[i*2]);
46 E[i]=-2.*cos(lsp[i*2+1]);
49 /* set up impulse response */
59 /* run impulse response */
63 temp=O[j]*Ao[j]+Ae[j];
68 temp=E[j]*Bo[j]+Be[j];
73 lpc[i-1]=(A+Ao[j]+B-Ae[j])/2;
79 static void kw(double *r,int n) {
80 double *s=alloca(sizeof(double)*(n/2+1));
81 double *c=alloca(sizeof(double)*(n+1));
87 for(i=3;i<=n/2;i++) s[i] = s[i-2];
92 for(i=k+2;i<=n;i+=2) {
98 for(k=0;k<=n;k++) r[k] = c[k];
102 static int comp(const void *a,const void *b){
103 if(*(double *)a<*(double *)b)
109 /* CACM algorithm 283. */
110 static void cacm283(double *a,int ord,double *r){
112 double val, p, delta, error;
115 for(i=0; i<ord;i++) r[i] = 2.0 * (i+0.5) / ord - 1.0;
117 for(error=1 ; error > 1.e-12; ) {
119 for( i=0; i<ord; i++) { /* Update each point. */
123 for(k=ord-1; k>= 0; k--) {
124 val = val * rooti + a[k];
125 if (k != i) p *= rooti - r[k];
129 error += delta*delta;
133 /* Replaced the original bubble sort with a real sort. With your
134 help, we can eliminate the bubble sort in our lifetime. --Monty */
136 qsort(r,ord,sizeof(double),comp);
140 /* Convert lpc coefficients to lsp coefficients */
141 void vorbis_lpc_to_lsp(double *lpc,double *lsp,int m){
143 double *g1=alloca(sizeof(double)*(order2+1));
144 double *g2=alloca(sizeof(double)*(order2+1));
145 double *g1r=alloca(sizeof(double)*(order2+1));
146 double *g2r=alloca(sizeof(double)*(order2+1));
149 /* Compute the lengths of the x polynomials. */
150 /* Compute the first half of K & R F1 & F2 polynomials. */
151 /* Compute half of the symmetric and antisymmetric polynomials. */
152 /* Remove the roots at +1 and -1. */
155 for(i=0;i<order2;i++) g1[order2-i-1] = lpc[i]+lpc[m-i-1];
157 for(i=0;i<order2;i++) g2[order2-i-1] = lpc[i]-lpc[m-i-1];
159 for(i=0; i<order2;i++) g1[order2-i-1] -= g1[order2-i];
160 for(i=0; i<order2;i++) g2[order2-i-1] += g2[order2-i];
162 /* Convert into polynomials in cos(alpha) */
166 /* Find the roots of the 2 even polynomials.*/
168 cacm283(g1,order2,g1r);
169 cacm283(g2,order2,g2r);
172 lsp[i] = acos(g1r[i/2]*.5);
173 lsp[i+1] = acos(g2r[i/2]*.5);