[1174] | 1 | /************************************ |
---|
| 2 | Extended Kalman Filter |
---|
| 3 | Matrix operations |
---|
| 4 | |
---|
[1240] | 5 | V. Smidl, Z. Peroutka |
---|
[1174] | 6 | |
---|
[1240] | 7 | Rev. 28.10.2010 (ZP) |
---|
[1174] | 8 | |
---|
[1240] | 9 | 26.10.2010 Prvni verze (VS) |
---|
[1174] | 10 | |
---|
[1240] | 11 | 26.10.2010 Upravena chyba v Thorton_fast - spatne shiftovani o vypoctu SIGMA. |
---|
| 12 | 27.10.2010 Pokus o odstraneni problemu v Thorton_fast - potize dela omezovani (orezavani) varianci. |
---|
| 13 | 28.10.2010 Drobne upravy v kodu. |
---|
| 14 | |
---|
[1174] | 15 | *************************************/ |
---|
[1225] | 16 | |
---|
| 17 | #include "matrix_vs.h" |
---|
[1241] | 18 | #include <math.h> |
---|
[1225] | 19 | |
---|
[1174] | 20 | /* Matrix multiply Full matrix by upper diagonal matrix; */ |
---|
[1240] | 21 | void mmultAU(int16 *m1, int16 *up, int16 *result, unsigned int16 rows, unsigned int16 columns) { |
---|
| 22 | unsigned int16 i, j, k; |
---|
| 23 | int32 tmp_sum=0L; //in 15+qAU |
---|
| 24 | int16 *m2pom; |
---|
| 25 | int16 *m1pom=m1; |
---|
| 26 | int16 *respom=result; |
---|
[1174] | 27 | |
---|
[1179] | 28 | for (i=0; i<rows; i++) //rows of result |
---|
[1174] | 29 | { |
---|
[1179] | 30 | for (j=0; j<columns; j++) //columns of result |
---|
[1240] | 31 | { |
---|
[1179] | 32 | m2pom=up+j;//?? |
---|
[1174] | 33 | |
---|
[1179] | 34 | for (k=0; k<j; k++) //inner loop up to "j" - U(j,j)==1; |
---|
| 35 | { |
---|
[1240] | 36 | tmp_sum+=((int32)(*(m1pom++))**m2pom)>>(15-qAU); |
---|
[1179] | 37 | m2pom+=columns; |
---|
| 38 | } |
---|
| 39 | // add the missing A(i,j) |
---|
[1240] | 40 | tmp_sum +=(int32)(*m1pom)<<qAU; // no need to shift |
---|
[1225] | 41 | m1pom-=(j); // shift back to first element |
---|
[1174] | 42 | |
---|
[1235] | 43 | *respom++=tmp_sum>>15; |
---|
[1225] | 44 | |
---|
| 45 | tmp_sum=0; |
---|
| 46 | } |
---|
| 47 | m1pom+=(columns); |
---|
| 48 | } |
---|
| 49 | }; |
---|
| 50 | |
---|
| 51 | |
---|
[1240] | 52 | void bierman_fast(int16 *difz, int16 *xp, int16 *U, int16 *D, int16 *R, unsigned int16 dimy, unsigned int16 dimx ) |
---|
| 53 | { |
---|
| 54 | int16 alpha; |
---|
| 55 | int16 beta,lambda; |
---|
| 56 | int16 b[5]; // ok even for 4-dim state |
---|
| 57 | int16 *a; // in [0,1] -> q15 |
---|
| 58 | unsigned int16 iy,j,i; |
---|
[1225] | 59 | |
---|
[1240] | 60 | int16 *b_j,*b_i; |
---|
| 61 | int16 *a_j; |
---|
| 62 | int16 *D_j; |
---|
| 63 | int16 *U_ij; |
---|
| 64 | int16 *x_i; |
---|
[1225] | 65 | |
---|
[1240] | 66 | int32 z_pom; |
---|
| 67 | int16 z_pom_int16; |
---|
[1174] | 68 | |
---|
[1179] | 69 | a = U; // iyth row of U |
---|
| 70 | for (iy=0; iy<dimy; iy++, a+=dimx) { |
---|
| 71 | // a is a row |
---|
| 72 | for (j=0,a_j=a,b_j=b,D_j=D; j<dimx; j++,b_j++,D_j++,a_j++) |
---|
[1240] | 73 | *b_j=((int32)(*D_j)*(*a_j))>>15; |
---|
[1179] | 74 | |
---|
[1240] | 75 | alpha = R[iy]; //\alpha = R+vDv = R+a*b |
---|
[1179] | 76 | // R in q15, a in q15, b=q15 |
---|
| 77 | // gamma = (1<<15)/alpha; //(in q15) |
---|
| 78 | //min alpha = R[iy] = 164 |
---|
| 79 | //max gamma = 0.0061 => gamma_ref = q7 |
---|
| 80 | for (j=0,a_j=a,b_j=b,D_j=D; j<dimx; j++,a_j++,b_j++,D_j++) { |
---|
[1240] | 81 | /* beta=alpha; |
---|
| 82 | lambda = -((int32)(*a_j)<<15)/beta; |
---|
| 83 | alpha += ((int32)(*a_j)*(*b_j))>>15; |
---|
| 84 | D[j] = ((int32)beta**D_j)/alpha;*/ |
---|
| 85 | /*xx*/ |
---|
| 86 | lambda=alpha; |
---|
| 87 | alpha += ((int32)(*a_j)*(*b_j))>>15; |
---|
| 88 | D[j] = ((int32)lambda**D_j)/alpha; |
---|
| 89 | z_pom_int16 = -((int32)(*a_j)<<15)/lambda; |
---|
| 90 | /*xx*/ |
---|
| 91 | |
---|
[1179] | 92 | if (*D_j==0) *D_j=1; |
---|
| 93 | |
---|
| 94 | for (i=0,b_i=b,U_ij=U+j; i<j; i++, b_i++,U_ij+=dimx) { |
---|
| 95 | beta = *U_ij; |
---|
[1240] | 96 | // *U_ij += ((int32)lambda*(*b_i))>>15; // puvodni reseni |
---|
| 97 | *U_ij -= ((int32)(*a_j)*(*b_i))/lambda; // pozadovane optimalni reseni |
---|
| 98 | // *U_ij -= ((int32)((int16)((int32)(*a_j)<<15)/lambda)**b_i)>>15; // tohle funguje - problem je s tim pretypovanim na (int16) |
---|
| 99 | // *U_ij -= (int16)((int32)(*a_j)*(*b_i))/lambda; |
---|
| 100 | // z_pom = (((int32)(*a_j)*(*b_i))/lambda); |
---|
| 101 | /* z_pom = (int32)(*U_ij)-(int16)((int32)(*a_j)*(*b_i))/lambda; |
---|
| 102 | if (z_pom > 32767) z_pom = 32767; |
---|
| 103 | if (z_pom < - 32768) z_pom = -32768; |
---|
| 104 | *U_ij = z_pom; /**/ |
---|
| 105 | // *U_ij += ((int32)z_pom_int16*(*b_i))>>15; // puvodni reseni - jen jina konstanta |
---|
| 106 | *b_i += ((int32)beta*(*b_j))>>15; |
---|
[1179] | 107 | } |
---|
| 108 | } |
---|
| 109 | // no shift due to gamma |
---|
| 110 | for (i=0,x_i=xp,b_i=b; i<dimx; i++,x_i++,b_i++) { |
---|
[1240] | 111 | *x_i += ((int32)difz[iy]*(*b_i))/alpha; // multiply by unscaled Kalman gain |
---|
[1179] | 112 | } |
---|
| 113 | } |
---|
| 114 | } |
---|
| 115 | |
---|
| 116 | // Thorton procedure - Kalman predictive variance in UD |
---|
[1245] | 117 | void thorton(int16 *U, int16 *D, int16 *PSIU, int16 *Q, int16 *G, int16 *Dold, unsigned int16 rows) { |
---|
| 118 | thorton_fast(U, D, PSIU, Q, G, Dold, rows); |
---|
| 119 | } |
---|
| 120 | |
---|
| 121 | // Thorton procedure - Kalman predictive variance in UD |
---|
[1240] | 122 | void thorton_fast(int16 *U, int16 *D, int16 *PSIU, int16 *Q, int16 *G, int16 *Dold, unsigned int16 rows) { |
---|
| 123 | unsigned int16 i,j,k; |
---|
[1179] | 124 | // copy D to Dold |
---|
[1240] | 125 | int16 *Dold_i,*Dold_k; |
---|
| 126 | int16 *D_i; |
---|
| 127 | int16 *PSIU_ij,*PSIU_ik,*PSIU_jk; |
---|
| 128 | int16 *Q_jj,*Q_ii,*Q_kk; |
---|
| 129 | int16 *U_ji; |
---|
| 130 | int16 *G_ik,*G_jk; |
---|
| 131 | int16 irows,jrows; |
---|
| 132 | int32 sigma; // in qAU+15!! |
---|
| 133 | int32 z; |
---|
[1179] | 134 | |
---|
| 135 | for (i=0,Dold_i=Dold,D_i=D;i<rows;i++,Dold_i++,D_i++) { |
---|
| 136 | *Dold_i=*D_i; |
---|
| 137 | } |
---|
| 138 | |
---|
| 139 | // initialize G = eye() |
---|
| 140 | G_ik= G; |
---|
[1235] | 141 | *G_ik++=32767; |
---|
[1179] | 142 | for (i=0;i<rows-1;i++) { |
---|
| 143 | // clean elem before diag |
---|
| 144 | for (k=0; k<rows; k++) { |
---|
| 145 | *G_ik++=0; |
---|
| 146 | } |
---|
[1235] | 147 | *G_ik++=32767; |
---|
[1179] | 148 | } |
---|
| 149 | // eye created |
---|
| 150 | |
---|
| 151 | for (i=rows-1, Dold_i=Dold+i, D_i=D+i; |
---|
[1237] | 152 | 1; i--, Dold_i--,D_i--) { // stop if i==0 at the END! |
---|
[1179] | 153 | irows=i*rows; |
---|
| 154 | sigma = 0; |
---|
[1197] | 155 | for (k=0, PSIU_ik=PSIU+irows,Dold_k=Dold; |
---|
[1233] | 156 | k<rows; k++, PSIU_ik++,Dold_k++) { |
---|
[1240] | 157 | sigma += (((int32)(*PSIU_ik)**PSIU_ik)>>(qAU))*(*Dold_k); |
---|
[1225] | 158 | } |
---|
[1240] | 159 | sigma += (int32)(*(Q+i+irows))<<qAU; |
---|
[1179] | 160 | for (j=i+1, G_ik=G+irows+i+1; j<rows; j++,G_ik++) { |
---|
[1240] | 161 | sigma += (((int32)(*G_ik)**G_ik)>>16)**(Q+j+j*rows); |
---|
[1237] | 162 | } |
---|
[1235] | 163 | |
---|
[1240] | 164 | if (sigma>((int32)1<<(qAU+15))) { |
---|
[1235] | 165 | *D_i = 32767; |
---|
[1237] | 166 | // *(Dold+i)-=*(Q+i+irows); |
---|
[1235] | 167 | } else { |
---|
| 168 | *D_i=sigma>>qAU; |
---|
| 169 | } |
---|
[1179] | 170 | if (*D_i==0) *D_i=1; |
---|
| 171 | |
---|
| 172 | for (j=0;j<i;j++) { |
---|
| 173 | jrows = j*rows; |
---|
| 174 | |
---|
| 175 | sigma =0; |
---|
| 176 | for (k=0, PSIU_ik=PSIU+irows, PSIU_jk=PSIU+jrows, Dold_k=Dold; |
---|
| 177 | k<rows; k++, PSIU_ik++, PSIU_jk++, Dold_k++) { |
---|
[1225] | 178 | |
---|
[1240] | 179 | sigma += ((((int32)(*PSIU_ik)**PSIU_jk)>>qAU)**Dold_k); |
---|
[1179] | 180 | } |
---|
[1225] | 181 | |
---|
[1235] | 182 | for (k=i,G_ik=G+irows+i,G_jk=G+jrows+i,Q_kk=Q+k*rows+k; |
---|
[1225] | 183 | k<rows;k++,G_ik++,G_jk++,Q_kk+=rows+1) { |
---|
[1240] | 184 | sigma += ((((int32)*G_ik)**G_jk)>>16)**Q_kk; |
---|
[1179] | 185 | } |
---|
[1225] | 186 | |
---|
[1237] | 187 | z=(sigma/(*D_i))<<(15-qAU); // shift to q15 |
---|
[1179] | 188 | if (z>32767) z=32767; |
---|
| 189 | if (z<-32768) z=-32768; |
---|
| 190 | |
---|
| 191 | U_ji=U+jrows+i; |
---|
[1240] | 192 | *U_ji = (int16)z; |
---|
[1179] | 193 | |
---|
| 194 | |
---|
| 195 | for (k=0,PSIU_ik=PSIU+irows,PSIU_jk=PSIU+jrows; |
---|
| 196 | k<rows;k++,PSIU_ik++,PSIU_jk++) { |
---|
[1240] | 197 | *PSIU_jk -= ((int32)*U_ji**PSIU_ik)>>15; |
---|
[1179] | 198 | } |
---|
[1225] | 199 | |
---|
[1179] | 200 | for (k=0,G_jk=G+jrows,G_ik=G+irows; |
---|
[1225] | 201 | k<rows;k++, G_jk++, G_ik++) { |
---|
[1240] | 202 | *G_jk -= ((int32)*U_ji**G_ik)>>15; |
---|
[1179] | 203 | } |
---|
[1225] | 204 | |
---|
[1179] | 205 | } |
---|
[1235] | 206 | if (i==0) return; |
---|
[1179] | 207 | } |
---|
| 208 | } |
---|
| 209 | |
---|
[1225] | 210 | /* square root of 0<a<1 using taylor at 0.5 in q15*/ |
---|
[1241] | 211 | int16 int_sqrt(int16 x) { |
---|
[1230] | 212 | double xd(double(x)/32768.); |
---|
| 213 | return round(sqrt(xd)*32768); |
---|
[1237] | 214 | |
---|
[1225] | 215 | //sqrt(x) == 1/2*2^(1/2)+1/2*2^(1/2)*(x-1/2)-1/4*2^(1/2)*(x-1/2)^2 |
---|
| 216 | // = k1 + k1*(x-0.5) - k2*(x-0.5)(x-0.5); |
---|
| 217 | #define k1 23170 //0.5*sqrt(2)*32768 |
---|
| 218 | #define k2 11585 //0.25*sqrt(2)*32768 |
---|
| 219 | |
---|
[1241] | 220 | int16 tmp; |
---|
[1225] | 221 | if (x>6554) { |
---|
[1241] | 222 | int16 xm05=x-16384; |
---|
[1294] | 223 | tmp = ((int32)k1*xm05)>>15; |
---|
| 224 | tmp-=(((int32(k2)*xm05)>>15)*xm05)>>15; |
---|
[1225] | 225 | tmp +=k1; |
---|
| 226 | } else { |
---|
| 227 | tmp = 4*x; |
---|
[1294] | 228 | tmp-=int32(8*x)*x>>15; |
---|
[1225] | 229 | } |
---|
| 230 | return tmp; |
---|
| 231 | } |
---|
| 232 | |
---|
[1241] | 233 | void householder(int16 *Ch /*= int16 *PSICh*/, int16 *Q, unsigned int16 dimx) { |
---|
| 234 | int16 k,j,i; |
---|
| 235 | int16 alpha,beta; |
---|
| 236 | int32 sigma; // 2*qCh |
---|
| 237 | int32 tmp_long; |
---|
| 238 | int16 B[25];//Q in qCh |
---|
| 239 | int16 w[5]; |
---|
| 240 | int16 v[5]; |
---|
[1225] | 241 | |
---|
| 242 | // copy Q to B |
---|
[1237] | 243 | for (i=0;i<dimx*dimx;i++) |
---|
| 244 | { |
---|
[1241] | 245 | B[i]=Q[i]>>(15-qCh); |
---|
[1225] | 246 | } |
---|
| 247 | |
---|
[1237] | 248 | for (k=dimx-1; k>=0; k--) |
---|
| 249 | { |
---|
[1225] | 250 | sigma=0; |
---|
[1237] | 251 | for (j=0;j<dimx;j++) |
---|
| 252 | { |
---|
[1294] | 253 | sigma+=((int32)B[k*dimx+j]*B[k*dimx+j]); |
---|
[1225] | 254 | } |
---|
[1237] | 255 | for (j=0;j<=k;j++) |
---|
| 256 | { |
---|
[1294] | 257 | sigma+=((int32)Ch[k*dimx+j]*Ch[k*dimx+j]); |
---|
[1225] | 258 | } |
---|
[1241] | 259 | |
---|
| 260 | //alpha in qCh |
---|
[1294] | 261 | alpha = (int16)(sqrt((double)sigma)+0.5); // predelat pro DSP |
---|
[1241] | 262 | |
---|
| 263 | sigma=0; |
---|
[1225] | 264 | for (j=0;j<dimx;j++) { |
---|
| 265 | w[j]=B[k*dimx+j]; |
---|
[1294] | 266 | sigma+=(int32)w[j]*w[j]; |
---|
[1225] | 267 | } |
---|
| 268 | for (j=0; j<=k;j++) { |
---|
| 269 | if (j==k) { |
---|
| 270 | v[j]=Ch[k*dimx+j]-alpha; |
---|
| 271 | } else { |
---|
| 272 | v[j]=Ch[k*dimx+j]; |
---|
| 273 | } |
---|
[1294] | 274 | sigma+=(int32)v[j]*v[j]; |
---|
[1225] | 275 | } |
---|
[1237] | 276 | |
---|
[1241] | 277 | alpha=sigma>>(qCh+1); // alpha = sigma /2; |
---|
[1237] | 278 | if (alpha==0) alpha =1; |
---|
| 279 | |
---|
[1225] | 280 | for (i=0;i<=k;i++) { |
---|
| 281 | sigma=0; |
---|
| 282 | for (j=0;j<dimx;j++) { |
---|
[1294] | 283 | sigma+=((int32)B[i*dimx+j]*w[j]); |
---|
[1225] | 284 | } |
---|
| 285 | for (j=0;j<=k;j++) { |
---|
[1294] | 286 | sigma+=(int32)Ch[i*dimx+j]*v[j]; |
---|
[1225] | 287 | } |
---|
[1237] | 288 | |
---|
| 289 | sigma = sigma >> 15; // navrat do Q15 |
---|
[1245] | 290 | // if (sigma>32767)sigma=32767; |
---|
[1241] | 291 | |
---|
[1237] | 292 | for (j=0;j<dimx;j++) |
---|
| 293 | { |
---|
[1241] | 294 | tmp_long=B[i*dimx+j]-(sigma*w[j])/alpha; |
---|
| 295 | if (tmp_long>32767) { |
---|
| 296 | B[i*dimx+j]=32767; |
---|
| 297 | } else { |
---|
| 298 | if (tmp_long<-32767){ |
---|
| 299 | B[i*dimx+j]=-32767; |
---|
| 300 | } else { |
---|
| 301 | B[i*dimx+j]=tmp_long; |
---|
| 302 | } |
---|
| 303 | } |
---|
[1225] | 304 | }; |
---|
[1237] | 305 | |
---|
| 306 | for (j=0;j<=k;j++) |
---|
| 307 | { |
---|
[1241] | 308 | tmp_long=Ch[i*dimx+j]-(sigma*v[j])/alpha; |
---|
| 309 | if (tmp_long>32767) { |
---|
| 310 | Ch[i*dimx+j]=32767; |
---|
| 311 | } else { |
---|
| 312 | if (tmp_long<-32767){ |
---|
| 313 | Ch[i*dimx+j]=-32767; |
---|
| 314 | } else { |
---|
| 315 | Ch[i*dimx+j]=tmp_long; |
---|
| 316 | } |
---|
| 317 | } |
---|
| 318 | } |
---|
[1225] | 319 | } |
---|
| 320 | } |
---|
| 321 | |
---|
| 322 | } |
---|
| 323 | |
---|
[1241] | 324 | void carlson(int16 *difz, int16 *xp, int16 *Ch, int16 *R, unsigned int16 dimy, unsigned int16 dimx ) { |
---|
| 325 | int16 alpha,beta,gamma; |
---|
| 326 | int16 delta, eta,epsilon,zeta,sigma,tau; |
---|
| 327 | int16 i,j,iy; |
---|
| 328 | int16 w[5]; |
---|
| 329 | int32 tmp_long; |
---|
[1225] | 330 | |
---|
[1237] | 331 | for (iy=0; iy<dimy; iy++) |
---|
| 332 | { |
---|
[1225] | 333 | alpha=R[iy]; |
---|
| 334 | delta = difz[iy]; |
---|
| 335 | |
---|
[1237] | 336 | for (j=0;j<dimx;j++) |
---|
| 337 | { |
---|
[1225] | 338 | sigma=Ch[iy*dimx+j]; |
---|
| 339 | beta=alpha; |
---|
[1294] | 340 | alpha+=((int32)sigma*sigma)>>15; |
---|
[1225] | 341 | // double ab=(double)alpha*beta/32768./32768.; |
---|
| 342 | // double s_ab=sqrt(ab); |
---|
[1294] | 343 | gamma=(int16)(sqrt((double)((int32)alpha*beta))+0.5); // predelat v DSP |
---|
[1225] | 344 | //gamma = round(s_ab*(1<<15)); |
---|
[1237] | 345 | // eta=((long)beta<<15) / gamma; |
---|
[1225] | 346 | //zeta=(long(sigma)<<15)/ gamma; |
---|
| 347 | w[j]=0; |
---|
| 348 | for (i=0;i<=j;i++) { |
---|
| 349 | tau=Ch[i*dimx+j]; |
---|
[1294] | 350 | tmp_long=((int32)beta*Ch[i*dimx+j] -(int32)sigma*w[i])/gamma; |
---|
[1241] | 351 | if (tmp_long>32767) { |
---|
| 352 | Ch[i*dimx+j]=32767; |
---|
| 353 | } else { |
---|
| 354 | if (tmp_long<-32767){ |
---|
| 355 | Ch[i*dimx+j]=-32767; |
---|
| 356 | } else { |
---|
| 357 | Ch[i*dimx+j]=tmp_long; |
---|
| 358 | } |
---|
| 359 | } |
---|
| 360 | |
---|
[1294] | 361 | w[i]+=((int32)tau*sigma)>>15; |
---|
[1225] | 362 | } |
---|
| 363 | } |
---|
| 364 | |
---|
| 365 | //epsilon=(long(difz)<<15) / (alpha); // q15*q13/q13 = q15 |
---|
| 366 | for (i=0;i<dimx;i++) { |
---|
[1294] | 367 | xp[i]+=((int32)w[i]*delta)/alpha; |
---|
[1225] | 368 | } |
---|
| 369 | } |
---|
| 370 | } |
---|
[1230] | 371 | |
---|
| 372 | /* perform Householder update of Ch matrix using PSI*Ch , Q, */ |
---|
[1241] | 373 | extern void givens(int16 *Ch /*= int16 *PSICh*/, int16 *Q, unsigned int16 dimx){ |
---|
| 374 | int16 i,j,k; |
---|
| 375 | int16 rho,s,c,tau; |
---|
| 376 | int32 tmp_long; |
---|
[1237] | 377 | |
---|
[1241] | 378 | int16 A[25];//beware |
---|
[1230] | 379 | // copy Q to A |
---|
| 380 | for (i=0;i<dimx*dimx;i++) { |
---|
[1241] | 381 | A[i]=Q[i]>>(15-qCh); |
---|
[1230] | 382 | } |
---|
[1237] | 383 | |
---|
| 384 | |
---|
[1230] | 385 | for (i=dimx-1; i>=0; i--){ |
---|
| 386 | for (j=0; j<dimx; j++) { |
---|
[1294] | 387 | tmp_long=(int32)Ch[i*dimx+i]*Ch[i*dimx+i]+int32(A[i*dimx+j])*A[i*dimx+j]; |
---|
[1241] | 388 | if (tmp_long>0){ |
---|
| 389 | rho=sqrt(double(tmp_long)); |
---|
[1294] | 390 | s=(int32(A[i*dimx+j])<<15)/rho; |
---|
| 391 | c=(int32(Ch[i*dimx+i])<<15)/rho; |
---|
[1241] | 392 | for (k=0;k<=i; k++){ |
---|
[1294] | 393 | tau=(int32(c)*A[k*dimx+j]-int32(s)*Ch[k*dimx+i])>>15; |
---|
| 394 | Ch[k*dimx +i]=(int32(s)*A[k*dimx+j]+int32(c)*Ch[k*dimx+i])>>15; |
---|
[1241] | 395 | A[k*dimx +j]=tau; |
---|
| 396 | } |
---|
[1230] | 397 | } |
---|
| 398 | } |
---|
[1245] | 399 | |
---|
| 400 | for (j=0; j<i; j++){ |
---|
[1294] | 401 | tmp_long=(int32(Ch[i*dimx+i])*Ch[i*dimx+i]+int32(Ch[i*dimx+j])*Ch[i*dimx+j]); |
---|
[1245] | 402 | if (tmp_long>0){ |
---|
| 403 | rho=sqrt((double)(tmp_long)); |
---|
[1294] | 404 | s=(int32(Ch[i*dimx+j])<<15)/rho; |
---|
| 405 | c=(int32(Ch[i*dimx+i])<<15)/rho; |
---|
[1245] | 406 | for (k=0; k<=i; k++){ |
---|
[1294] | 407 | tau=(int32(c)*Ch[k*dimx+j]-int32(s)*Ch[k*dimx+i])>>15; |
---|
| 408 | Ch[k*dimx+i]=(int32(s)*Ch[k*dimx+j]+int32(c)*Ch[k*dimx+i])>>15; |
---|
[1245] | 409 | Ch[k*dimx+j]=tau; |
---|
| 410 | } |
---|
[1241] | 411 | } |
---|
[1230] | 412 | } |
---|
[1245] | 413 | |
---|
[1230] | 414 | } |
---|
| 415 | } |
---|
[1241] | 416 | |
---|
| 417 | /* Matrix multiply Full matrix by upper diagonal matrix; */ |
---|
| 418 | void mmultACh(int16 *m1, int16 *up, int16 *result, unsigned int16 rows, unsigned int16 columns) { |
---|
| 419 | unsigned int16 i, j, k; |
---|
| 420 | int32 tmp_sum=0L; |
---|
| 421 | int16 *m2pom; |
---|
| 422 | int16 *m1pom=m1; |
---|
| 423 | int16 *respom=result; |
---|
| 424 | |
---|
| 425 | for (i=0; i<rows; i++) //rows of result |
---|
| 426 | { |
---|
| 427 | for (j=0; j<columns; j++) //columns of result |
---|
| 428 | { |
---|
| 429 | m2pom=up+j;//?? |
---|
| 430 | |
---|
| 431 | for (k=0; k<=j; k++) //inner loop up to "j" - U(j,j)==1; |
---|
| 432 | { |
---|
| 433 | tmp_sum+=(int32)(*(m1pom++))**m2pom; |
---|
| 434 | m2pom+=columns; |
---|
| 435 | } |
---|
| 436 | m1pom-=(j+1); // shift back to first element |
---|
| 437 | |
---|
| 438 | *respom++=tmp_sum>>15; |
---|
| 439 | |
---|
| 440 | tmp_sum=0; |
---|
| 441 | } |
---|
| 442 | m1pom+=(columns); |
---|
| 443 | } |
---|
| 444 | } |
---|
[1294] | 445 | |
---|
| 446 | |
---|
| 447 | void givens_fast(int16 *Ch, int16 *Q, unsigned int16 dimx) |
---|
| 448 | { |
---|
| 449 | int16 i,j,k; |
---|
| 450 | int16 rho,s,c,tau; |
---|
| 451 | int32 tmp_long; |
---|
| 452 | |
---|
| 453 | int16 A[25];//beware |
---|
| 454 | |
---|
| 455 | int16 *A_ij, *Q_i, *Ch_ki, *Ch_kj, *Ch_ii, *Ch_ij, *A_kj; |
---|
| 456 | |
---|
| 457 | A_ij=A; |
---|
| 458 | Q_i=Q; |
---|
| 459 | // copy Q to A |
---|
| 460 | for (i=0;i<dimx*dimx;i++) |
---|
| 461 | { |
---|
| 462 | // A[i]=Q[i]>>(15-qCh); |
---|
| 463 | *A_ij++=(*Q_i++)>>(15-qCh); |
---|
| 464 | } |
---|
| 465 | |
---|
| 466 | for (i=dimx-1; i>=0; i--) |
---|
| 467 | { |
---|
| 468 | Ch_ii=Ch+i*dimx+i; |
---|
| 469 | A_ij=A+i*dimx; |
---|
| 470 | |
---|
| 471 | for (j=0; j<dimx; j++) |
---|
| 472 | { |
---|
| 473 | // tmp_long=(long)Ch[i*dimx+i]*Ch[i*dimx+i]+(long)A[i*dimx+j]*A[i*dimx+j]; |
---|
| 474 | |
---|
| 475 | tmp_long=(int32)*Ch_ii**Ch_ii+(int32)*A_ij**A_ij; |
---|
| 476 | |
---|
| 477 | if (tmp_long>0) |
---|
| 478 | { |
---|
| 479 | // rho=qsqrt(tmp_long); // verze pro DSP |
---|
| 480 | rho=(int16)(sqrt((double)tmp_long)); // verze pro PC |
---|
| 481 | s=((int32)*A_ij<<15)/rho; |
---|
| 482 | c=((int32)*Ch_ii<<15)/rho; |
---|
| 483 | |
---|
| 484 | Ch_ki=Ch+i; |
---|
| 485 | A_kj=A+j; |
---|
| 486 | |
---|
| 487 | for (k=0;k<=i; k++) |
---|
| 488 | { |
---|
| 489 | tau=((int32)c**A_kj-(int32)s**Ch_ki)>>15; |
---|
| 490 | *Ch_ki=((int32)s**A_kj+(int32)c**Ch_ki)>>15; |
---|
| 491 | *A_kj=tau; |
---|
| 492 | |
---|
| 493 | Ch_ki+=dimx; |
---|
| 494 | A_kj+=dimx; |
---|
| 495 | } |
---|
| 496 | } |
---|
| 497 | A_ij++; |
---|
| 498 | } |
---|
| 499 | |
---|
| 500 | Ch_ij = Ch+i*dimx; |
---|
| 501 | |
---|
| 502 | for (j=0; j<i; j++) |
---|
| 503 | { |
---|
| 504 | tmp_long=(int32)*Ch_ii**Ch_ii+(int32)*Ch_ij**Ch_ij; |
---|
| 505 | |
---|
| 506 | if (tmp_long>0) |
---|
| 507 | { |
---|
| 508 | // rho=qsqrt(tmp_long); // verze pro DSP |
---|
| 509 | rho=(int16)(sqrt((double)tmp_long)); // verze pro PC |
---|
| 510 | s=((int32)*Ch_ij<<15)/rho; |
---|
| 511 | c=((int32)*Ch_ii<<15)/rho; |
---|
| 512 | |
---|
| 513 | Ch_kj = Ch + j; |
---|
| 514 | Ch_ki = Ch + i; |
---|
| 515 | |
---|
| 516 | for (k=0; k<=i; k++) |
---|
| 517 | { |
---|
| 518 | tau=((int32)c**Ch_kj-(int32)s**Ch_ki)>>15; |
---|
| 519 | *Ch_ki =((int32)s**Ch_kj+(int32)c**Ch_ki)>>15; |
---|
| 520 | *Ch_kj=tau; |
---|
| 521 | |
---|
| 522 | Ch_kj += dimx; |
---|
| 523 | Ch_ki += dimx; |
---|
| 524 | } |
---|
| 525 | } |
---|
| 526 | Ch_ij++; |
---|
| 527 | } |
---|
| 528 | } |
---|
| 529 | } |
---|
| 530 | |
---|
| 531 | void carlson_fast(int16 *difz, int16 *xp, int16 *Ch, int16 *R, unsigned int16 dimy, unsigned int16 dimx ) { |
---|
| 532 | int16 alpha,beta,gamma; |
---|
| 533 | int16 delta, eta,epsilon,zeta,sigma,tau; |
---|
| 534 | int16 i,j,iy; |
---|
| 535 | int16 w[5]; |
---|
| 536 | int32 tmp_long; |
---|
| 537 | |
---|
| 538 | int16 *Ch_ij, *w_i, *x_i; |
---|
| 539 | |
---|
| 540 | |
---|
| 541 | for (iy=0; iy<dimy; iy++) |
---|
| 542 | { |
---|
| 543 | alpha=R[iy]; |
---|
| 544 | delta = difz[iy]; |
---|
| 545 | |
---|
| 546 | for (j=0;j<dimx;j++) |
---|
| 547 | { |
---|
| 548 | sigma=Ch[iy*dimx+j]; |
---|
| 549 | beta=alpha; |
---|
| 550 | // alpha+=((long)sigma*sigma)>>15; |
---|
| 551 | alpha=(((int32)alpha<<15)+(int32)sigma*sigma)>>15; // vyssi presnost |
---|
| 552 | // gamma= qsqrt(((long)alpha*beta)); // verze pro DSP |
---|
| 553 | gamma= (int16)(sqrt((double)((int32)alpha*beta))); // verze pro PC |
---|
| 554 | |
---|
| 555 | w[j]=0; |
---|
| 556 | |
---|
| 557 | Ch_ij=Ch+j; |
---|
| 558 | w_i=w; |
---|
| 559 | |
---|
| 560 | for (i=0;i<=j;i++) |
---|
| 561 | { |
---|
| 562 | // tau=Ch[i*dimx+j]; |
---|
| 563 | tau=*Ch_ij; |
---|
| 564 | // tmp_long=((long)beta*Ch[i*dimx+j] -(long)sigma*w[i])/gamma; |
---|
| 565 | tmp_long=((int32)beta**Ch_ij -(int32)sigma**w_i)/gamma; |
---|
| 566 | |
---|
| 567 | if (tmp_long>32767) |
---|
| 568 | tmp_long=32767; |
---|
| 569 | if (tmp_long<-32768) |
---|
| 570 | tmp_long=-32768; |
---|
| 571 | *Ch_ij=tmp_long; |
---|
| 572 | |
---|
| 573 | // w_i+=((long)tau*sigma)>>15; |
---|
| 574 | *w_i=(((int32)*w_i<<15)+(int32)tau*sigma)>>15; |
---|
| 575 | |
---|
| 576 | w_i++; |
---|
| 577 | Ch_ij+=dimx; |
---|
| 578 | } |
---|
| 579 | } |
---|
| 580 | |
---|
| 581 | x_i=xp; |
---|
| 582 | w_i=w; |
---|
| 583 | for (i=0;i<dimx;i++) { |
---|
| 584 | // xp[i]+=((long)w[i]*delta)/alpha; |
---|
| 585 | // *x_i+=((long)*w_i*delta)/alpha; |
---|
| 586 | *x_i=((int32)*x_i*alpha+(int32)*w_i*delta)/alpha; // vyssi presnost |
---|
| 587 | x_i++; |
---|
| 588 | w_i++; |
---|
| 589 | } |
---|
| 590 | } |
---|
| 591 | } |
---|