search for: subvect_size

...nding what exactly the codebook search works like. If you have the time to to that, Jean-Marc, I would appreciate some hints on the following: 1. What is the point in multiplying a codebook index with some number ant adding a loop variable to it as done in the exc unquant function. for (j=0;j<subvect_size;j++) exc[subvect_size*i+j]+=s*0.03125*shape_cb[ind[i]*subvect_size+j]; 2. How does the CB search function split_cb_search_shape_sign work? I know the parameter N defines the number of candidates for each of the nb_subvect CB line numbers which are later on written into the stream. B...

...nding what exactly the codebook search works like. If you have the time to to that, Jean-Marc, I would appreciate some hints on the following: 1. What is the point in multiplying a codebook index with some number ant adding a loop variable to it as done in the exc unquant function. for (j=0;j<subvect_size;j++) exc[subvect_size*i+j]+=s*0.03125*shape_cb[ind[i]*subvect_size+j]; 2. How does the CB search function split_cb_search_shape_sign work? I know the parameter N defines the number of candidates for each of the nb_subvect CB line numbers which are later on written into the stream. B...

...ind this discrepancy in \libspeex\cb_search.c : ".\libspeex\cb_search.c", line 185: cc0167: error: argument of type "spx_word16_t *" is incompatible with parameter of type "float *" compute_weighted_codebook(shape_cb, r, resp, resp2, E, shape_cb_size, subvect_size, stack); The function definition defines resp2 as a float in line 47: static void compute_weighted_codebook(const signed char *shape_cb, const spx_sig_t *r, spx_word16_t *resp, float *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack) But then calls it with resp2 being defi...

Hi, Jean-Marc Valin wrote: >> 1. What is the point in multiplying a codebook index with some number >> ant adding a loop variable to it as done in the exc unquant function. >> for (j=0;j<subvect_size;j++) >> exc[subvect_size*i+j]+=s*0.03125*shape_cb[ind[i]*subvect_size+j]; > > That's just how you represent a 2D array in C: the codebook has > shape_cb_size entries and subvect_size samples per entry. Ok, that helps. Thanks. >> PS: for me personally, I...

> 1. What is the point in multiplying a codebook index with some number > ant adding a loop variable to it as done in the exc unquant function. > for (j=0;j<subvect_size;j++) > exc[subvect_size*i+j]+=s*0.03125*shape_cb[ind[i]*subvect_size+j]; That's just how you represent a 2D array in C: the codebook has shape_cb_size entries and subvect_size samples per entry. > 2. How does the CB search function split_cb_search_shape_sign work? I >...

...recting codes are for. Jean-Marc Bj?rn Thalheim a ?crit : > Hi, > > Jean-Marc Valin wrote: >>> 1. What is the point in multiplying a codebook index with some number >>> ant adding a loop variable to it as done in the exc unquant function. >>> for (j=0;j<subvect_size;j++) >>> exc[subvect_size*i+j]+=s*0.03125*shape_cb[ind[i]*subvect_size+j]; >> That's just how you represent a 2D array in C: the codebook has >> shape_cb_size entries and subvect_size samples per entry. > > Ok, that helps. Thanks. > >>> P...

...debook search > works like. If you have the time to to that, Jean-Marc, I would > appreciate some hints on the following: > 1. What is the point in multiplying a codebook index with some number > ant adding a loop variable to it as done in the exc unquant function. > for (j=0;j<subvect_size;j++) > exc[subvect_size*i+j]+=s*0.03125*shape_cb[ind[i]*subvect_size+j]; > 2. How does the CB search function split_cb_search_shape_sign work? I > know the parameter N defines the number of candidates for each of the > nb_subvect CB line numbers which are later on writte...

...s leads to: (gdb) list *0x6d5c2213 0x6d5c2213 is in split_cb_search_shape_sign (cb_search.c:414). 409 break; 410 } 411 for (j=0;j<N;j++) 412 { 413 /*previous target (we don't care what happened before*/ 414 for (m=(i+1)*subvect_size;m<nsf;m++) 415 nt[j][m]=ot[best_ntarget[j]][m]; 416 417 /* New code: update the rest of the target only if it's worth it */ 418 for (m=0;m<subvect_size;m++) And the crash is at line 414. Digging through the disassembly, the crash seems to be th...

...debook search > works like. If you have the time to to that, Jean-Marc, I would > appreciate some hints on the following: > 1. What is the point in multiplying a codebook index with some number > ant adding a loop variable to it as done in the exc unquant function. > for (j=0;j<subvect_size;j++) > exc[subvect_size*i+j]+=s*0.03125*shape_cb[ind[i]*subvect_size+j]; > 2. How does the CB search function split_cb_search_shape_sign work? I > know the parameter N defines the number of candidates for each of the > nb_subvect CB line numbers which are later on writte...

Hi, Jean-Marc Valin wrote: > Not sure I understand your question. Change the order of what within what? In cb_search, we iterate nb_subvect times over a codebook, finding nb_subvect codebook entries to quantize the excitation signal. After finding these nb_subvect codebook entries, they're written into the stream: /*save indices*/ for (i=0;i<nb_subvect;i++) {

...> 0x6d5c2213 is in split_cb_search_shape_sign (cb_search.c:414). > 409 break; > 410 } > 411 for (j=0;j<N;j++) > 412 { > 413 /*previous target (we don't care what happened before*/ > 414 for (m=(i+1)*subvect_size;m<nsf;m++) > 415 nt[j][m]=ot[best_ntarget[j]][m]; > 416 > 417 /* New code: update the rest of the target only if it's > worth it */ > 418 for (m=0;m<subvect_size;m++) > > And the crash is at line 414. Digging through the disa...

..., EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ +#include "bfin.h" + #define OVERRIDE_COMPUTE_WEIGHTED_CODEBOOK void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack) { @@ -73,10 +75,7 @@ void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t * : : "m" (subvect_size), "m" (shape_cb), "m" (r), "m" (resp), "m" (E) : "A0", "P0", &quot...

...b_nb_med, QCONST16(.45,15), 220 }; /* Parameters for Long-Term Prediction (LTP)*/ static const ltp_params ltp_params_lbr = { gain_cdbk_lbr, 5, 7 }; /* Split-VQ innovation parameters narrowband */ static const split_cb_params split_cb_nb_med = { 8, /*subvect_size*/ 5, /*nb_subvect*/ exc_8_128_table, /*shape_cb*/ 7, /*shape_bits*/ 0, I have three problems. 1. My DSP has 24 bits register and memory with a 24 X 24 = 48 bit multiply and a 56 bit accumulator. I see scaling shifts when using 32 bit registe...

Hi, here is a patch making the function compute_weighted_codebook a little bit faster. Not so impressive but avoid a loop and is really faster on small platforms like the MIPS I'm working on. Enjoy, Matthieu Poullet -------------- next part -------------- A non-text attachment was scrubbed... Name: cwc_patch Type: application/octet-stream Size: 1226 bytes Desc: not available Url :

...P)*/ > > static const ltp_params ltp_params_lbr = { > > gain_cdbk_lbr, > > 5, > > 7 > > }; > > > > /* Split-VQ innovation parameters narrowband */ > > static const split_cb_params split_cb_nb_med = { > > 8, /*subvect_size*/ > > 5, /*nb_subvect*/ > > exc_8_128_table, /*shape_cb*/ > > 7, /*shape_bits*/ > > 0, > > > > > > > > I have three problems. > > > > 1. My DSP has 24 bits register and memory with...