Hi guys,

Great job. I was looking for exactly the same thing. Could u pls guide me
on how to compile FFTW on visualDSP environment

Greetings Andor. Our code allows to receive not only transformations
of number of points of a degree 2 (128, 256, 512, 1024...), and by
means of our product you can receive transformations made the number
of points received at multiplication of numbers 2, 3, 5. For example:
2*3 = 6, 2*3*5 = 30 points, 60, 120.....(5^3) * (2^6) = 8000 points.

Best regards,
Toma.

Hi guys,

nice work! Have you compared the FFTW code with the code available from
ADI?

http://www.analog.com/processors/processors/tigersharc/technicalLibrary/codeExamples.html

I would be interested in seeing cycle count comparisons for 128, 256,
512, 1024, 2048 and 4096 point real FFTs.

Best regards,
Andor

We're students from Saint Petersburg, from Russia. We had ported fftw
2.1.5 on digital signal processor Analog Devices TigerSHARC TS101.
C compiler for TS101 it's not so good as gcc or Intel C compiler, that
is why we have rewritten on the assembler 2, 3, 5, 6 and 12 points
transformations, and other transformations aren't included to a code.
And now we have got a good line of points with good throughput. 
In our opinion this library is useful to people and we're ready to
publish and support the project in the network. What do you think
about it?