wendykierp / JTransforms

JTransforms is the first, open source, multithreaded FFT library written in pure Java.
Other
368 stars 89 forks source link

Where is API documentation ? #24

Open SamGinrich opened 5 months ago

SamGinrich commented 5 months ago

Web Site http://sites.google.com/site/piotrwendykier/software/jtransforms is not reachable.

biziclop commented 5 months ago

Hi, this seems to be the last archived version:

https://web.archive.org/web/20230528055919/https://sites.google.com/site/piotrwendykier/software/jtransforms

SamGinrich commented 5 months ago

Thank you!

So, DoubleFFT_1D.complexForward(double[] a) expects a sequence of complex numbers as array of double-pairs and returns with the spectrum in same format?

biziclop commented 5 months ago

@SamGinrich Hi, you should also download the javadoc zip too for convenience, here is the un-archive.org-ed link: http://search.maven.org/remotecontent?filepath=com/github/wendykierp/JTransforms/3.1/JTransforms-3.1-javadoc.jar
Anyway, you're right, except it doesn't return anything, the result is put back/calculated in place in your input array:

public void complexForward(double[] a) Computes 1D forward DFT of complex data leaving the result in a. Complex number is stored as two double values in sequence: the real and imaginary part, i.e. the size of the input array must be greater or equal 2*n. The physical layout of the input data has to be as follows:

 a[2*k] = Re[k], 
 a[2*k+1] = Im[k], 0<=k<n

http://search.maven.org/remotecontent?filepath=com/github/wendykierp/JTransforms/3.1/JTransforms-3.1-with-dependencies.jar
https://web.archive.org/web/20230528055919/http://search.maven.org/remotecontent?filepath=com/github/wendykierp/JTransforms/3.1/JTransforms-3.1-sources.jar

SamGinrich commented 5 months ago

Thank ou very much for the accurate response!