MCPcopy Create free account
hub / github.com/dhale/jtk / complexToComplex

Method complexToComplex

core/src/main/java/edu/mines/jtk/dsp/FftComplex.java:102–109  ·  view source on GitHub ↗

Computes a complex-to-complex fast Fourier transform. Transforms a 1-D input array cx[2 nfft] of nfft complex numbers to a 1-D output array cy[2 nfft] of nfft complex numbers. @param sign the sign (1 or -1) of the exponent used in the FFT. @param cx the input array. @param cy the output array.

(int sign, float[] cx, float[] cy)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 6

test1Method · 0.95
test1RandomMethod · 0.95
timeMethod · 0.95
complexToComplex1Method · 0.95
applyForwardMethod · 0.80
applyInverseMethod · 0.80

Calls 4

checkSignMethod · 0.95
checkArrayMethod · 0.95
transformMethod · 0.95
ccopyMethod · 0.80

Tested by 2

test1Method · 0.76
test1RandomMethod · 0.76