Quote:
|
Originally Posted by meynaf
I already know what's going on. The main problem for me is that dct trick, I know what it does, but I want the quickest way to do it without significantly losing precision - and the haskell code, not quite readable, apparently contains direct square roots and cosinus computations, which I do not want to do.
|
The haskell code does suck, doesn't it? And I don't suppose you want to make your own algorithm based on the formula
Quote:
|
Originally Posted by meynaf
Hopefully you know what I feel about those formulas  |
The same as me, I suppose. Math in pretty much un-cool, and it always looks like it could be done just about 10 million times simpler.
Quote:
|
Originally Posted by meynaf
Maybe not source code, but a detailed algorithm to efficiently perform the computations. Of course, a correctly commented source code will do 
Things such as sqr/sin/cos are to avoid at all costs, muls should be reduced to the bare minimum. Else we'll end up with something sloooooow  |
I guess I'll try again then. How difficult is it to find what you need on the net
