Displaying 2 results from an estimated 2 matches for "floor0_inverse1".
2011 Apr 18
0
Error in floor0 decode specification
...11 11) if (length of vector [coefficients] is less than
[floor0_order], continue at step 6
If implemented as written, it would mean that [last] does nothing, since
the only time it is used it always equals to zero. I've looked at the
corresponding code in libvorbis (which seems to be floor0_inverse1 in
floor0.c), and it does this:
float last=0.f;
/* ... */
for(j=0;j<look->m;){
for(k=0;k<b->dim;k++,j++)lsp[j]+=last;
last=lsp[j-1];
}
which suggests that step 11 in the algorithm should say "continue at step
7" (sk...
2002 Sep 03
3
memory allocations in codec
Hi,
I was wondering why the decoder does so much malloc/alloca/free
within the inner decoding stages. Allocating everything at
the xxx_look() stages would:
- ensure that on exit of the look stage the decoder as grabbed
once and for all the resources required to decode the stream
to the end.
- allows to perform checks on memory allocations, something
which is completely lacking at the