asserts to reflect the actual limits. Update the cwrs test to cover
the complete n,k range used by opus/opus_custom.

Gregory Maxwell authored 13 years ago and Jean-Marc Valin committed 13 years ago

non-ascii characters from the source.

Timothy B. Terriberry authored 14 years ago and Jean-Marc Valin committed 14 years ago

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.

Got authorization from all copyright holders

Fixed a few minor bugs in the process.

Timothy B. Terriberry authored 14 years ago and Jean-Marc Valin committed 14 years ago

Use a closed-form formula for the search instead.
This requires an integer sqrt, so it is not actually closed-form,
 but the number of iterations is O(qb) instead of O(2**qb).

Adding one more level of band splitting so that splitting at the
PVQ encoding level is no longer necessary.

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.

Gregory Maxwell authored 15 years ago and Jean-Marc Valin committed 15 years ago

This avoids the need for 64-bit addition and is faster on x86_64.
It may be slower on some platforms so the direct solution is still
available in the source.

Timothy B. Terriberry authored 15 years ago and Jean-Marc Valin committed 15 years ago

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.

Timothy B. Terriberry authored 15 years ago and Jean-Marc Valin committed 15 years ago

reported by Bjoern Rasmussen.

adjustable frame size. Indentation fix in cwrs.c.

Timothy B. Terriberry authored 16 years ago and Jean-Marc Valin committed 16 years ago

This version has actually been tested for all 32-bit inputs.

Timothy B. Terriberry authored 16 years ago and Jean-Marc Valin committed 16 years ago

It is no slower with a large number of pulses, and as much as 30% faster with
 a large number of dimensions.

Timothy B. Terriberry authored 16 years ago and Jean-Marc Valin committed 16 years ago

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.

pulse split. Also, added an allocation line for even higher bit-rates