Author: Ratko V Tomic
Date: 05:59:03 01/04/06
Go up one level in this thread
I don't know if they can test it. The only code which is high enough level would be permutation coder or radix coders. The general entropy coding stuff is very low level, just the basic inner loop coder gear (where the essential differences from the arithmetic coding are), which one needs to combine into a full coder which serializes entire output into a single package. If they want to run benchmarks, I would probably need to extract and clean up for public consumption the code I used for benchmarking in the main research prototype program. Or if they set up arithmetic coder under the same conditions and time just its inner coder loops and use the size of its raw index (removing thus the model info, data sizes or adaptation), they could compare apples with apples. Readme.txt has some tips on this kind of test. I guess, I'll wait and see what they need or ask for the testing.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.