creating the mode. This means that the same mode can be shared for mono and
stereo.

Making it so all the information encoded directly with ec_enc_bits() gets
stored at the end of the stream, without going through the range coder. This
should be both faster and reduce the effects of bit errors.

Conflicts:

	tests/ectest.c

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

"tandem-test" which tests the encoder and decoder in
many modes.

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.

problems when building shared libraries only.

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

When I removed the special case for EC_ILOG(0) in commit
 06390d08, it broke ec_dec_uint() with _ft=1
 (which should encode the value 0 using 0 bits).
This feature was tested by ectest.c, but not actually used by libcelt.
An assert has been added to ec_dec_uint() to ensure that we don't try to use
 this feature by accident.
ec_enc_uint() was actually correct, but support for this feature has been
 removed and the assert put in its place.

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.

attempt to reduce copying.

allocated

need to iterate at least once.

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

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.

find_spectral_pitch instead of using celt_rcp(celt_sqrt(x))

variable instead of the angle. Should now be both less CPU-intensive and
makes fixed-point code simpler.

cos() and sin() functions.