Generic algorithms that could be implemented in almost any language, e.g. matrix operations and FFT.


Postby fuji3085 » Wed Dec 02, 2015 5:28 am

I want to program the FFT 32K in Parallella.
Input: 16bit 200Msps
Processing speed: latency <300nsec

Please tell me the structure and algorithms.
Posts: 1
Joined: Wed Dec 02, 2015 5:09 am

Re: FFT 32K

Postby nickoppen » Wed Dec 02, 2015 6:07 am

There is plenty of information about FFT here already on the forum and on the Parallella blog (http://www.adapteva.com/white-papers/using-a-scalable-parallel-2d-fft-for-image-enhancement/). There is also an example in parallella-examples on github (https://github.com/parallella/parallella-examples/tree/master/fft-xcorr).

The structure and the algorithm depends on what your input is and you want to do with it.
Sharing is what makes the internet Great!
User avatar
Posts: 266
Joined: Mon Dec 17, 2012 3:21 am
Location: Sydney NSW, Australia

Return to Algorithms

Who is online

Users browsing this forum: No registered users and 1 guest