Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/mumble-voip/celt-0.7.0.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
path: root/tests
AgeCommit message (Collapse)Author
2009-07-01Fix compilation of test cases with fixed-debug enabledGregory Maxwell
2009-06-29Additional mathops.h tests.Gregory Maxwell
2009-06-05Fixes for the tests in pseudo-stack mode.Gregory Maxwell
2009-05-27Make ectest use random random numbers. Add a new testGregory Maxwell
"tandem-test" which tests the encoder and decoder in many modes.
2009-05-27CWRS clean-ups and optimizations.Timothy B. Terriberry
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.
2008-12-23Unit tests now #include the relevant source files to prevent symbol visibilityJean-Marc Valin
problems when building shared libraries only.
2008-12-21Fix ectest to not check a case which isn't guaranteed to work, and which we ↵Timothy B. Terriberry
don't use. When I removed the special case for EC_ILOG(0) in commit 06390d082dcdfa8addb3dde337543bc0f0ebae44, 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.
2008-11-11fixed test for cases where M_PI isn't definedJean-Marc Valin
2008-10-05Removing the 64-bit part of the range coder.Jean-Marc Valin
2008-09-22Merge branch 'cwrs_speedup'Jean-Marc Valin
Conflicts: libcelt/cwrs.c tests/cwrs32-test.c
2008-09-22Change cwrsi() to operate on rows of U instead of columns.Timothy B.B Terriberry
It is no slower with a large number of pulses, and as much as 30% faster with a large number of dimensions.
2008-09-19Fixing the manual stack handling codeJean-Marc Valin
2008-09-19Merge branch 'cwrs_speedup' (derf's cwrs changes)Jean-Marc Valin
Conflicts: libcelt/cwrs.c
2008-09-19Change CWRS indexing to use Pyramid VQ's magnitude ordering.Timothy B.B Terriberry
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.
2008-09-13Converted everything to 32-bit CWRS (using split after that)Jean-Marc Valin
2008-05-27Making the Laplace test case pass againJean-Marc Valin
2008-05-05Disabled pulse spreading until I can show it actually helpsJean-Marc Valin
2008-04-25Brought the mdct test-case with the recent changes to the mdct semanticJean-Marc Valin
2008-04-22Moved the windowing from compute_inv_mdcts() to mdct_backward()Jean-Marc Valin
2008-04-21Moved the windowing operation from compute_mdcts() to mdct_forward() in anJean-Marc Valin
attempt to reduce copying.
2008-04-21Further simplifications to comb2pulses() to remove all conditional branches.Jean-Marc Valin
2008-04-18pseudo-stack no longer checks on every function entry whether it has beenJean-Marc Valin
allocated
2008-04-18optimisation: Removed a bunch of conditional branches from comb2pulse()Jean-Marc Valin
2008-04-16optimisation: Making it clear to the compiler that many of the loops in cwrsJean-Marc Valin
need to iterate at least once.
2008-04-11fixed a few warnings, no real changeJean-Marc Valin
2008-04-05Fixed rsqrt testcase for floatJean-Marc Valin
2008-04-05Rework CWRS code.Timothy B. Terriberry
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.
2008-03-26optimisation: defined a reciprocal square root (celt_rsqrt) for use inJean-Marc Valin
find_spectral_pitch instead of using celt_rcp(celt_sqrt(x))
2008-03-26Fixed the rcp() testcase for new assumptions (x is positive)Jean-Marc Valin
2008-03-19Random numbers should work on 16-bit archs.Jean-Marc Valin
2008-03-13Adjusting/fixing warningsJean-Marc Valin
2008-03-13Added mathops-testJean-Marc Valin
2008-03-12Testcases should now work even when symbols aren't visible in the dsoJean-Marc Valin
2008-03-07Changed the pulse spreading rotations so that the number of iterations isJean-Marc Valin
variable instead of the angle. Should now be both less CPU-intensive and makes fixed-point code simpler.
2008-03-05Defining RADIX_TWO_ONLY removes all butterflies, except for radix 2 and 4.Jean-Marc Valin
2008-03-04fixed-point: exp_rotation() now fully converted, using an approximation of theJean-Marc Valin
cos() and sin() functions.
2008-03-03cwrs32-test should be 16-bit clean now.Jean-Marc Valin
2008-03-03Laplace encoder now works with 16-bit frequenciesJean-Marc Valin
2008-03-02oops, fixed the Laplace testcaseJean-Marc Valin
2008-03-01Making it easier to debug laplace testcaseJean-Marc Valin
2008-02-27fixed-point: exp_rotation() mostly converted (still need to convert the cos/sin)Jean-Marc Valin
2008-02-26C90-fying ectestJean-Marc Valin
2008-02-25MDCT is in fixed-point nowJean-Marc Valin
2008-02-25MDCT conversion, part I.Jean-Marc Valin
2008-02-24real fft snr comparison testcase includes DCJean-Marc Valin
2008-02-24Float FFT now does the same scaling as the fixed-point FFTJean-Marc Valin
2008-02-24minor tweak to FFTJean-Marc Valin
2008-02-24Added a mixed-precision version of the FFT with 32-bit data and 16-bit twiddles.Jean-Marc Valin
2008-02-22MDCT now scales down by N/2 instead of N/4. The factor two is moved to theJean-Marc Valin
overlap-add during synthesis.
2008-02-22testcase for the MDCT and IMDCTJean-Marc Valin