- Aug 11, 2011
-
-
Jean-Marc Valin authored
-
- Jul 31, 2011
-
-
non-ascii characters from the source.
-
- Jul 29, 2011
-
-
Jean-Marc Valin authored
-
- Mar 03, 2011
-
-
These were used because the entropy coder originally came from outside libcelt, and thus did not have a common type system. It's now undergone enough modification that it's not ever likely to be used as-is in another codec without some porting effort, so there's no real reason to maintain the typedefs separately. Hopefully we'll replace these all again somedate with a common set of Opus typedefs, but for now this will do. This fixes an issue caused by commit 6c8acbf1, which moved the ec_ilog() prototype from entcode.h to ecintrin.h, where the ec_uint32 typedef was not yet available. Thanks to John Ridges for the report.
-
- Feb 10, 2011
-
-
Jean-Marc Valin authored
Got authorization from all copyright holders
-
- May 24, 2010
-
-
Jean-Marc Valin authored
-
- Oct 18, 2009
-
-
Jean-Marc Valin authored
-
- Oct 17, 2009
-
-
Jean-Marc Valin authored
by POSIX. The other _t types that are not part of the API are still there for now. Also, got rid of all that was left of the 64-bit types.
-
- May 26, 2009
-
-
Adds specialized O(N*log(K)) versions of cwrsi() and O(N) versions of icwrs() for N={3,4,5}, which allows them to operate all the way up to the theoretical pulse limit without serious performance degredation. Also substantially reduces the computation time and stack usage of get_required_bits(). On x86-64, this gives a 2% speed-up for 256 sample frames, and almost a 16% speed-up for 64 sample frames.
-
- Feb 09, 2009
-
-
Jean-Marc Valin authored
fine energy bits. Also, doing better rounding of the bits.
-
- Dec 17, 2008
-
-
- Sep 22, 2008
-
-
It is no slower with a large number of pulses, and as much as 30% faster with a large number of dimensions.
-
- Sep 19, 2008
-
-
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.
-
- Jun 10, 2008
-
-
Jean-Marc Valin authored
a few decoding errors.
-
Jean-Marc Valin authored
-
- Apr 18, 2008
-
-
Jean-Marc Valin authored
-
- Apr 05, 2008
-
-
This eliminates an extra O(nm) lookups on decode, and reduces the rate control from O(nm^2) to O(nm), in addition to eliminating O(m) lookups on both encode and decode. Although the interface is slightly more complex, the internal code is also simpler.
-
- Mar 15, 2008
-
-
Jean-Marc Valin authored
-
- Feb 14, 2008
-
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-
- Jan 31, 2008
-
-
Jean-Marc Valin authored
-
- Dec 11, 2007
-
-
Jean-Marc Valin authored
-
- Dec 03, 2007
-
-
Timothy B. Terriberry authored
VQ index.
-
- Nov 30, 2007
-
-
Jean-Marc Valin authored
-
Jean-Marc Valin authored
-