00001
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035 #define OVERRIDE_VQ_NBEST
00036 void vq_nbest(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
00037 {
00038 int i,j,k,used;
00039 VARDECL(float *dist);
00040 VARDECL(__m128 *in);
00041 __m128 half;
00042 used = 0;
00043 ALLOC(dist, entries, float);
00044 half = _mm_set_ps1(.5f);
00045 ALLOC(in, len, __m128);
00046 for (i=0;i<len;i++)
00047 in[i] = _mm_set_ps1(_in[i]);
00048 for (i=0;i<entries>>2;i++)
00049 {
00050 __m128 d = _mm_mul_ps(E[i], half);
00051 for (j=0;j<len;j++)
00052 d = _mm_sub_ps(d, _mm_mul_ps(in[j], *codebook++));
00053 _mm_storeu_ps(dist+4*i, d);
00054 }
00055 for (i=0;i<entries;i++)
00056 {
00057 if (i<N || dist[i]<best_dist[N-1])
00058 {
00059 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
00060 {
00061 best_dist[k]=best_dist[k-1];
00062 nbest[k] = nbest[k-1];
00063 }
00064 best_dist[k]=dist[i];
00065 nbest[k]=i;
00066 used++;
00067 }
00068 }
00069 }
00070
00071
00072
00073
00074 #define OVERRIDE_VQ_NBEST_SIGN
00075 void vq_nbest_sign(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
00076 {
00077 int i,j,k,used;
00078 VARDECL(float *dist);
00079 VARDECL(__m128 *in);
00080 __m128 half;
00081 used = 0;
00082 ALLOC(dist, entries, float);
00083 half = _mm_set_ps1(.5f);
00084 ALLOC(in, len, __m128);
00085 for (i=0;i<len;i++)
00086 in[i] = _mm_set_ps1(_in[i]);
00087 for (i=0;i<entries>>2;i++)
00088 {
00089 __m128 d = _mm_setzero_ps();
00090 for (j=0;j<len;j++)
00091 d = _mm_add_ps(d, _mm_mul_ps(in[j], *codebook++));
00092 _mm_storeu_ps(dist+4*i, d);
00093 }
00094 for (i=0;i<entries;i++)
00095 {
00096 int sign;
00097 if (dist[i]>0)
00098 {
00099 sign=0;
00100 dist[i]=-dist[i];
00101 } else
00102 {
00103 sign=1;
00104 }
00105 dist[i] += .5f*((float*)E)[i];
00106 if (i<N || dist[i]<best_dist[N-1])
00107 {
00108 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
00109 {
00110 best_dist[k]=best_dist[k-1];
00111 nbest[k] = nbest[k-1];
00112 }
00113 best_dist[k]=dist[i];
00114 nbest[k]=i;
00115 used++;
00116 if (sign)
00117 nbest[k]+=entries;
00118 }
00119 }
00120 }