- Oct 18, 2008
-
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
use.
-
- Oct 15, 2008
-
-
Jean-Marc Valin authored
-
- Oct 11, 2008
-
-
Jean-Marc Valin authored
-
- Oct 09, 2008
-
-
Jean-Marc Valin authored
-
- Oct 08, 2008
-
-
- Oct 06, 2008
-
-
-
Jean-Marc Valin authored
-
- Oct 05, 2008
-
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
- Oct 04, 2008
-
-
- Oct 03, 2008
-
-
Jean-Marc Valin authored
-
-
Jean-Marc Valin authored
-
- Oct 01, 2008
-
-
Jean-Marc Valin authored
-
API: Change celt_encode and celt_encode_float so that they take an optional synthesis parameter after the PCM input. If optional_synthesis is null the encoder will be able to save some computation. If optional_synthesis is non-null if will be used to write the encoder's expectation of the decoder's output. Synthesis may alias the input pcm, so calling the encoder with the same buffer twice will achieve the old behavior. Remove 'restrict' from the CTL prototype.
-
- Sep 30, 2008
-
-
Jean-Marc Valin authored
-
- Sep 29, 2008
-
-
Jean-Marc Valin authored
-
- Sep 28, 2008
-
-
Fix support for sample rates between 32kHz and 40kHz (lower rates are currently rejected, but work okay).
-
Jean-Marc Valin authored
-
Allow all even frame sizes, change the selection of number of short MDCTs per frame to be more intelligent.
-
- Sep 25, 2008
-
-
- Sep 24, 2008
-
-
- Sep 22, 2008
-
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
Conflicts: libcelt/cwrs.c tests/cwrs32-test.c
-
It is no slower with a large number of pulses, and as much as 30% faster with a large number of dimensions.
-
Jean-Marc Valin authored
-
- Sep 19, 2008
-
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
Conflicts: libcelt/cwrs.c
-
This lets us encode and decode directly from the pulse vector without an intermediate transformation. This makes old streams undecodable. Additionally, ncwrs_u32() has been sped up for large N by using the sliding recurrence from Mohorko et al. ncwrs_u64 could be sped up in a similar manner, but would require a larger table of multiplicative inverses (or several 32x32->64 bit multiplies). Note that U(N,M) is now everywhere 1/2 the value it used to be.
-
- Sep 16, 2008
-
-
Jean-Marc Valin authored
-
- Sep 13, 2008
-
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
- Sep 11, 2008
-
-
Jean-Marc Valin authored
-
- Sep 10, 2008
-
-
Jean-Marc Valin authored
-