/* compile with cc -DTESTING_FFTPACK fftpack.c in order to build the test application. This is an f2c translation of the full fftpack sources as found on http://www.netlib.org/fftpack/ The translated code has been slightlty edited to remove the ugliest artefacts of the translation (a hundred of wild GOTOs were wiped during that operation). The original fftpack file was written by Paul N. Swarztrauber (Version 4, 1985), in fortran 77. FFTPACK license: http://www.cisl.ucar.edu/css/software/fftpack5/ftpk.html Copyright (c) 2004 the University Corporation for Atmospheric Research ("UCAR"). All rights reserved. Developed by NCAR's Computational and Information Systems Laboratory, UCAR, www.cisl.ucar.edu. Redistribution and use of the Software in source and binary forms, with or without modification, is permitted provided that the following conditions are met: - Neither the names of NCAR's Computational and Information Systems Laboratory, the University Corporation for Atmospheric Research, nor the names of its sponsors or contributors may be used to endorse or promote products derived from this Software without specific prior written permission. - Redistributions of source code must retain the above copyright notices, this list of conditions, and the disclaimer below. - Redistributions in binary form must reproduce the above copyright notice, this list of conditions, and the disclaimer below in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING, BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE SOFTWARE. ChangeLog: 2011/10/02: this is my first release of this file. */ #include "fftpack.h" #include <math.h> real; integer; f77complex; #ifdef TESTING_FFTPACK static real c_abs(f77complex *c) { return sqrt(c->r*c->r + c->i*c->i); } static double dmax(double a, double b) { return a < b ? b : a; } #endif /* translated by f2c (version 20061008), and slightly edited */ static void passfb(integer *nac, integer ido, integer ip, integer l1, integer idl1, real *cc, real *c1, real *c2, real *ch, real *ch2, const real *wa, real fsign) { … } /* passb */ #undef ch2_ref #undef ch_ref #undef cc_ref #undef c2_ref #undef c1_ref static void passb2(integer ido, integer l1, const real *cc, real *ch, const real *wa1) { … } /* passb2 */ #undef ch_ref #undef cc_ref static void passb3(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2) { … } /* passb3 */ #undef ch_ref #undef cc_ref static void passb4(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2, const real *wa3) { … } /* passb4 */ #undef ch_ref #undef cc_ref /* passf5 and passb5 merged */ static void passfb5(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2, const real *wa3, const real *wa4, real fsign) { … } /* passb5 */ #undef ch_ref #undef cc_ref static void passf2(integer ido, integer l1, const real *cc, real *ch, const real *wa1) { … } /* passf2 */ #undef ch_ref #undef cc_ref static void passf3(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2) { … } /* passf3 */ #undef ch_ref #undef cc_ref static void passf4(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2, const real *wa3) { … } /* passf4 */ #undef ch_ref #undef cc_ref static void radb2(integer ido, integer l1, const real *cc, real *ch, const real *wa1) { … } /* radb2 */ #undef ch_ref #undef cc_ref static void radb3(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2) { … } /* radb3 */ #undef ch_ref #undef cc_ref static void radb4(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2, const real *wa3) { … } /* radb4 */ #undef ch_ref #undef cc_ref static void radb5(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2, const real *wa3, const real *wa4) { … } /* radb5 */ #undef ch_ref #undef cc_ref static void radbg(integer ido, integer ip, integer l1, integer idl1, const real *cc, real *c1, real *c2, real *ch, real *ch2, const real *wa) { … } /* radbg */ #undef ch2_ref #undef ch_ref #undef cc_ref #undef c2_ref #undef c1_ref static void radf2(integer ido, integer l1, const real *cc, real *ch, const real *wa1) { … } /* radf2 */ #undef ch_ref #undef cc_ref static void radf3(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2) { … } /* radf3 */ #undef ch_ref #undef cc_ref static void radf4(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2, const real *wa3) { … } /* radf4 */ #undef ch_ref #undef cc_ref static void radf5(integer ido, integer l1, const real *cc, real *ch, const real *wa1, const real *wa2, const real *wa3, const real *wa4) { … } /* radf5 */ #undef ch_ref #undef cc_ref static void radfg(integer ido, integer ip, integer l1, integer idl1, real *cc, real *c1, real *c2, real *ch, real *ch2, const real *wa) { … } /* radfg */ #undef ch2_ref #undef ch_ref #undef cc_ref #undef c2_ref #undef c1_ref static void cfftb1(integer n, real *c, real *ch, const real *wa, integer *ifac) { … } /* cfftb1 */ void cfftb(integer n, real *c, real *wsave) { … } /* cfftb */ static void cfftf1(integer n, real *c, real *ch, const real *wa, integer *ifac) { … } /* cfftf1 */ void cfftf(integer n, real *c, real *wsave) { … } /* cfftf */ static int decompose(integer n, integer *ifac, integer ntryh[4]) { … } static void cffti1(integer n, real *wa, integer *ifac) { … } /* cffti1 */ void cffti(integer n, real *wsave) { … } /* cffti */ static void rfftb1(integer n, real *c, real *ch, const real *wa, integer *ifac) { … } /* rfftb1 */ static void rfftf1(integer n, real *c, real *ch, const real *wa, integer *ifac) { … } void rfftb(integer n, real *r, real *wsave) { … } /* rfftb */ static void rffti1(integer n, real *wa, integer *ifac) { … } /* rffti1 */ void rfftf(integer n, real *r, real *wsave) { … } /* rfftf */ void rffti(integer n, real *wsave) { … } /* rffti */ static void cosqb1(integer n, real *x, real *w, real *xh) { … } /* cosqb1 */ void cosqb(integer n, real *x, real *wsave) { … } /* cosqb */ static void cosqf1(integer n, real *x, real *w, real *xh) { … } /* cosqf1 */ void cosqf(integer n, real *x, real *wsave) { … } /* cosqf */ void cosqi(integer n, real *wsave) { … } /* cosqi */ void cost(integer n, real *x, real *wsave) { … } /* cost */ void costi(integer n, real *wsave) { … } /* costi */ void sinqb(integer n, real *x, real *wsave) { … } /* sinqb */ void sinqf(integer n, real *x, real *wsave) { … } /* sinqf */ void sinqi(integer n, real *wsave) { … } /* sinqi */ static void sint1(integer n, real *war, real *was, real *xh, real * x, integer *ifac) { … } /* sint1 */ void sinti(integer n, real *wsave) { … } /* sinti */ void sint(integer n, real *x, real *wsave) { … } /* sint */ #ifdef TESTING_FFTPACK #include <stdio.h> int main(void) { static integer nd[] = { 120,91,54,49,32,28,24,8,4,3,2 }; /* System generated locals */ real r1, r2, r3; f77complex q1, q2, q3; /* Local variables */ integer i, j, k, n; real w[2000], x[200], y[200], cf, fn, dt; f77complex cx[200], cy[200]; real xh[200]; integer nz, nm1, np1, ns2; real arg, tfn; real sum, arg1, arg2; real sum1, sum2, dcfb; integer modn; real rftb, rftf; real sqrt2; real rftfb; real costt, sintt, dcfftb, dcfftf, cosqfb, costfb; real sinqfb; real sintfb; real cosqbt, cosqft, sinqbt, sinqft; /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* VERSION 4 APRIL 1985 */ /* A TEST DRIVER FOR */ /* A PACKAGE OF FORTRAN SUBPROGRAMS FOR THE FAST FOURIER */ /* TRANSFORM OF PERIODIC AND OTHER SYMMETRIC SEQUENCES */ /* BY */ /* PAUL N SWARZTRAUBER */ /* NATIONAL CENTER FOR ATMOSPHERIC RESEARCH BOULDER,COLORADO 80307 */ /* WHICH IS SPONSORED BY THE NATIONAL SCIENCE FOUNDATION */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* THIS PROGRAM TESTS THE PACKAGE OF FAST FOURIER */ /* TRANSFORMS FOR BOTH COMPLEX AND REAL PERIODIC SEQUENCES AND */ /* CERTIAN OTHER SYMMETRIC SEQUENCES THAT ARE LISTED BELOW. */ /* 1. RFFTI INITIALIZE RFFTF AND RFFTB */ /* 2. RFFTF FORWARD TRANSFORM OF A REAL PERIODIC SEQUENCE */ /* 3. RFFTB BACKWARD TRANSFORM OF A REAL COEFFICIENT ARRAY */ /* 4. EZFFTI INITIALIZE EZFFTF AND EZFFTB */ /* 5. EZFFTF A SIMPLIFIED REAL PERIODIC FORWARD TRANSFORM */ /* 6. EZFFTB A SIMPLIFIED REAL PERIODIC BACKWARD TRANSFORM */ /* 7. SINTI INITIALIZE SINT */ /* 8. SINT SINE TRANSFORM OF A REAL ODD SEQUENCE */ /* 9. COSTI INITIALIZE COST */ /* 10. COST COSINE TRANSFORM OF A REAL EVEN SEQUENCE */ /* 11. SINQI INITIALIZE SINQF AND SINQB */ /* 12. SINQF FORWARD SINE TRANSFORM WITH ODD WAVE NUMBERS */ /* 13. SINQB UNNORMALIZED INVERSE OF SINQF */ /* 14. COSQI INITIALIZE COSQF AND COSQB */ /* 15. COSQF FORWARD COSINE TRANSFORM WITH ODD WAVE NUMBERS */ /* 16. COSQB UNNORMALIZED INVERSE OF COSQF */ /* 17. CFFTI INITIALIZE CFFTF AND CFFTB */ /* 18. CFFTF FORWARD TRANSFORM OF A COMPLEX PERIODIC SEQUENCE */ /* 19. CFFTB UNNORMALIZED INVERSE OF CFFTF */ sqrt2 = sqrt(2.f); int all_ok = 1; for (nz = 1; nz <= (int)(sizeof nd/sizeof nd[0]); ++nz) { n = nd[nz - 1]; modn = n % 2; fn = (real) n; tfn = fn + fn; np1 = n + 1; nm1 = n - 1; for (j = 1; j <= np1; ++j) { x[j - 1] = sin((real) j * sqrt2); y[j - 1] = x[j - 1]; xh[j - 1] = x[j - 1]; } /* TEST SUBROUTINES RFFTI,RFFTF AND RFFTB */ rffti(n, w); dt = (2*M_PI) / fn; ns2 = (n + 1) / 2; if (ns2 < 2) { goto L104; } for (k = 2; k <= ns2; ++k) { sum1 = 0.f; sum2 = 0.f; arg = (real) (k - 1) * dt; for (i = 1; i <= n; ++i) { arg1 = (real) (i - 1) * arg; sum1 += x[i - 1] * cos(arg1); sum2 += x[i - 1] * sin(arg1); } y[(k << 1) - 3] = sum1; y[(k << 1) - 2] = -sum2; } L104: sum1 = 0.f; sum2 = 0.f; for (i = 1; i <= nm1; i += 2) { sum1 += x[i - 1]; sum2 += x[i]; } if (modn == 1) { sum1 += x[n - 1]; } y[0] = sum1 + sum2; if (modn == 0) { y[n - 1] = sum1 - sum2; } rfftf(n, x, w); rftf = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = rftf, r3 = (r1 = x[i - 1] - y[i - 1], fabs(r1)); rftf = dmax(r2,r3); x[i - 1] = xh[i - 1]; } rftf /= fn; for (i = 1; i <= n; ++i) { sum = x[0] * .5f; arg = (real) (i - 1) * dt; if (ns2 < 2) { goto L108; } for (k = 2; k <= ns2; ++k) { arg1 = (real) (k - 1) * arg; sum = sum + x[(k << 1) - 3] * cos(arg1) - x[(k << 1) - 2] * sin(arg1); } L108: if (modn == 0) { sum += (real)pow(-1, i-1) * .5f * x[n - 1]; } y[i - 1] = sum + sum; } rfftb(n, x, w); rftb = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = rftb, r3 = (r1 = x[i - 1] - y[i - 1], fabs(r1)); rftb = dmax(r2,r3); x[i - 1] = xh[i - 1]; y[i - 1] = xh[i - 1]; } rfftb(n, y, w); rfftf(n, y, w); cf = 1.f / fn; rftfb = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = rftfb, r3 = (r1 = cf * y[i - 1] - x[i - 1], fabs( r1)); rftfb = dmax(r2,r3); } /* TEST SUBROUTINES SINTI AND SINT */ dt = M_PI / fn; for (i = 1; i <= nm1; ++i) { x[i - 1] = xh[i - 1]; } for (i = 1; i <= nm1; ++i) { y[i - 1] = 0.f; arg1 = (real) i * dt; for (k = 1; k <= nm1; ++k) { y[i - 1] += x[k - 1] * sin((real) k * arg1); } y[i - 1] += y[i - 1]; } sinti(nm1, w); sint(nm1, x, w); cf = .5f / fn; sintt = 0.f; for (i = 1; i <= nm1; ++i) { /* Computing MAX */ r2 = sintt, r3 = (r1 = x[i - 1] - y[i - 1], fabs(r1)); sintt = dmax(r2,r3); x[i - 1] = xh[i - 1]; y[i - 1] = x[i - 1]; } sintt = cf * sintt; sint(nm1, x, w); sint(nm1, x, w); sintfb = 0.f; for (i = 1; i <= nm1; ++i) { /* Computing MAX */ r2 = sintfb, r3 = (r1 = cf * x[i - 1] - y[i - 1], fabs( r1)); sintfb = dmax(r2,r3); } /* TEST SUBROUTINES COSTI AND COST */ for (i = 1; i <= np1; ++i) { x[i - 1] = xh[i - 1]; } for (i = 1; i <= np1; ++i) { y[i - 1] = (x[0] + (real) pow(-1, i+1) * x[n]) * .5f; arg = (real) (i - 1) * dt; for (k = 2; k <= n; ++k) { y[i - 1] += x[k - 1] * cos((real) (k - 1) * arg); } y[i - 1] += y[i - 1]; } costi(np1, w); cost(np1, x, w); costt = 0.f; for (i = 1; i <= np1; ++i) { /* Computing MAX */ r2 = costt, r3 = (r1 = x[i - 1] - y[i - 1], fabs(r1)); costt = dmax(r2,r3); x[i - 1] = xh[i - 1]; y[i - 1] = xh[i - 1]; } costt = cf * costt; cost(np1, x, w); cost(np1, x, w); costfb = 0.f; for (i = 1; i <= np1; ++i) { /* Computing MAX */ r2 = costfb, r3 = (r1 = cf * x[i - 1] - y[i - 1], fabs( r1)); costfb = dmax(r2,r3); } /* TEST SUBROUTINES SINQI,SINQF AND SINQB */ cf = .25f / fn; for (i = 1; i <= n; ++i) { y[i - 1] = xh[i - 1]; } dt = M_PI / (fn + fn); for (i = 1; i <= n; ++i) { x[i - 1] = 0.f; arg = dt * (real) i; for (k = 1; k <= n; ++k) { x[i - 1] += y[k - 1] * sin((real) (k + k - 1) * arg); } x[i - 1] *= 4.f; } sinqi(n, w); sinqb(n, y, w); sinqbt = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = sinqbt, r3 = (r1 = y[i - 1] - x[i - 1], fabs(r1)) ; sinqbt = dmax(r2,r3); x[i - 1] = xh[i - 1]; } sinqbt = cf * sinqbt; for (i = 1; i <= n; ++i) { arg = (real) (i + i - 1) * dt; y[i - 1] = (real) pow(-1, i+1) * .5f * x[n - 1]; for (k = 1; k <= nm1; ++k) { y[i - 1] += x[k - 1] * sin((real) k * arg); } y[i - 1] += y[i - 1]; } sinqf(n, x, w); sinqft = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = sinqft, r3 = (r1 = x[i - 1] - y[i - 1], fabs(r1)) ; sinqft = dmax(r2,r3); y[i - 1] = xh[i - 1]; x[i - 1] = xh[i - 1]; } sinqf(n, y, w); sinqb(n, y, w); sinqfb = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = sinqfb, r3 = (r1 = cf * y[i - 1] - x[i - 1], fabs( r1)); sinqfb = dmax(r2,r3); } /* TEST SUBROUTINES COSQI,COSQF AND COSQB */ for (i = 1; i <= n; ++i) { y[i - 1] = xh[i - 1]; } for (i = 1; i <= n; ++i) { x[i - 1] = 0.f; arg = (real) (i - 1) * dt; for (k = 1; k <= n; ++k) { x[i - 1] += y[k - 1] * cos((real) (k + k - 1) * arg); } x[i - 1] *= 4.f; } cosqi(n, w); cosqb(n, y, w); cosqbt = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = cosqbt, r3 = (r1 = x[i - 1] - y[i - 1], fabs(r1)) ; cosqbt = dmax(r2,r3); x[i - 1] = xh[i - 1]; } cosqbt = cf * cosqbt; for (i = 1; i <= n; ++i) { y[i - 1] = x[0] * .5f; arg = (real) (i + i - 1) * dt; for (k = 2; k <= n; ++k) { y[i - 1] += x[k - 1] * cos((real) (k - 1) * arg); } y[i - 1] += y[i - 1]; } cosqf(n, x, w); cosqft = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = cosqft, r3 = (r1 = y[i - 1] - x[i - 1], fabs(r1)) ; cosqft = dmax(r2,r3); x[i - 1] = xh[i - 1]; y[i - 1] = xh[i - 1]; } cosqft = cf * cosqft; cosqb(n, x, w); cosqf(n, x, w); cosqfb = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ r2 = cosqfb, r3 = (r1 = cf * x[i - 1] - y[i - 1], fabs(r1)); cosqfb = dmax(r2,r3); } /* TEST CFFTI,CFFTF,CFFTB */ for (i = 1; i <= n; ++i) { r1 = cos(sqrt2 * (real) i); r2 = sin(sqrt2 * (real) (i * i)); q1.r = r1, q1.i = r2; cx[i-1].r = q1.r, cx[i-1].i = q1.i; } dt = (2*M_PI) / fn; for (i = 1; i <= n; ++i) { arg1 = -((real) (i - 1)) * dt; cy[i-1].r = 0.f, cy[i-1].i = 0.f; for (k = 1; k <= n; ++k) { arg2 = (real) (k - 1) * arg1; r1 = cos(arg2); r2 = sin(arg2); q3.r = r1, q3.i = r2; q2.r = q3.r * cx[k-1].r - q3.i * cx[k-1].i, q2.i = q3.r * cx[k-1].i + q3.i * cx[k-1].r; q1.r = cy[i-1].r + q2.r, q1.i = cy[i-1].i + q2.i; cy[i-1].r = q1.r, cy[i-1].i = q1.i; } } cffti(n, w); cfftf(n, (real*)cx, w); dcfftf = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ q1.r = cx[i-1].r - cy[i-1].r, q1.i = cx[i-1].i - cy[i-1] .i; r1 = dcfftf, r2 = c_abs(&q1); dcfftf = dmax(r1,r2); q1.r = cx[i-1].r / fn, q1.i = cx[i-1].i / fn; cx[i-1].r = q1.r, cx[i-1].i = q1.i; } dcfftf /= fn; for (i = 1; i <= n; ++i) { arg1 = (real) (i - 1) * dt; cy[i-1].r = 0.f, cy[i-1].i = 0.f; for (k = 1; k <= n; ++k) { arg2 = (real) (k - 1) * arg1; r1 = cos(arg2); r2 = sin(arg2); q3.r = r1, q3.i = r2; q2.r = q3.r * cx[k-1].r - q3.i * cx[k-1].i, q2.i = q3.r * cx[k-1].i + q3.i * cx[k-1].r; q1.r = cy[i-1].r + q2.r, q1.i = cy[i-1].i + q2.i; cy[i-1].r = q1.r, cy[i-1].i = q1.i; } } cfftb(n, (real*)cx, w); dcfftb = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ q1.r = cx[i-1].r - cy[i-1].r, q1.i = cx[i-1].i - cy[i-1].i; r1 = dcfftb, r2 = c_abs(&q1); dcfftb = dmax(r1,r2); cx[i-1].r = cy[i-1].r, cx[i-1].i = cy[i-1].i; } cf = 1.f / fn; cfftf(n, (real*)cx, w); cfftb(n, (real*)cx, w); dcfb = 0.f; for (i = 1; i <= n; ++i) { /* Computing MAX */ q2.r = cf * cx[i-1].r, q2.i = cf * cx[i-1].i; q1.r = q2.r - cy[i-1].r, q1.i = q2.i - cy[i-1].i; r1 = dcfb, r2 = c_abs(&q1); dcfb = dmax(r1,r2); } printf("%d\tRFFTF %10.3g\tRFFTB %10.ge\tRFFTFB %10.3g", n, rftf, rftb, rftfb); printf( "\tSINT %10.3g\tSINTFB %10.ge\tCOST %10.3g\n", sintt, sintfb, costt); printf( "\tCOSTFB %10.3g\tSINQF %10.ge\tSINQB %10.3g", costfb, sinqft, sinqbt); printf( "\tSINQFB %10.3g\tCOSQF %10.ge\tCOSQB %10.3g\n", sinqfb, cosqft, cosqbt); printf( "\tCOSQFB %10.3g\t", cosqfb); printf( "\tCFFTF %10.ge\tCFFTB %10.3g\n", dcfftf, dcfftb); printf( "\tCFFTFB %10.3g\n", dcfb); #define CHECK … CHECK(rftf); CHECK(rftb); CHECK(rftfb); CHECK(sintt); CHECK(sintfb); CHECK(costt); CHECK(costfb); CHECK(sinqft); CHECK(sinqbt); CHECK(sinqfb); CHECK(cosqft); CHECK(cosqbt); CHECK(cosqfb); CHECK(dcfftf); CHECK(dcfftb); } if (all_ok) printf("Everything looks fine.\n"); else printf("ERRORS WERE DETECTED.\n"); /* expected: 120 RFFTF 2.786e-06 RFFTB 6.847e-04 RFFTFB 2.795e-07 SINT 1.312e-06 SINTFB 1.237e-06 COST 1.319e-06 COSTFB 4.355e-06 SINQF 3.281e-04 SINQB 1.876e-06 SINQFB 2.198e-07 COSQF 6.199e-07 COSQB 2.193e-06 COSQFB 2.300e-07 DEZF 5.573e-06 DEZB 1.363e-05 DEZFB 1.371e-06 CFFTF 5.590e-06 CFFTB 4.751e-05 CFFTFB 4.215e-07 54 RFFTF 4.708e-07 RFFTB 3.052e-05 RFFTFB 3.439e-07 SINT 3.532e-07 SINTFB 4.145e-07 COST 3.002e-07 COSTFB 6.343e-07 SINQF 4.959e-05 SINQB 4.415e-07 SINQFB 2.882e-07 COSQF 2.826e-07 COSQB 2.472e-07 COSQFB 3.439e-07 DEZF 9.388e-07 DEZB 5.066e-06 DEZFB 5.960e-07 CFFTF 1.426e-06 CFFTB 9.482e-06 CFFTFB 2.980e-07 49 RFFTF 4.476e-07 RFFTB 5.341e-05 RFFTFB 2.574e-07 SINT 9.196e-07 SINTFB 9.401e-07 COST 8.174e-07 COSTFB 1.331e-06 SINQF 4.005e-05 SINQB 9.342e-07 SINQFB 3.057e-07 COSQF 2.530e-07 COSQB 6.228e-07 COSQFB 4.826e-07 DEZF 9.071e-07 DEZB 4.590e-06 DEZFB 5.960e-07 CFFTF 2.095e-06 CFFTB 1.414e-05 CFFTFB 7.398e-07 32 RFFTF 4.619e-07 RFFTB 2.861e-05 RFFTFB 1.192e-07 SINT 3.874e-07 SINTFB 4.172e-07 COST 4.172e-07 COSTFB 1.699e-06 SINQF 2.551e-05 SINQB 6.407e-07 SINQFB 2.980e-07 COSQF 1.639e-07 COSQB 1.714e-07 COSQFB 2.384e-07 DEZF 1.013e-06 DEZB 2.339e-06 DEZFB 7.749e-07 CFFTF 1.127e-06 CFFTB 6.744e-06 CFFTFB 2.666e-07 4 RFFTF 1.490e-08 RFFTB 1.490e-07 RFFTFB 5.960e-08 SINT 7.451e-09 SINTFB 0.000e+00 COST 2.980e-08 COSTFB 1.192e-07 SINQF 4.768e-07 SINQB 2.980e-08 SINQFB 5.960e-08 COSQF 2.608e-08 COSQB 5.960e-08 COSQFB 1.192e-07 DEZF 2.980e-08 DEZB 5.960e-08 DEZFB 0.000e+00 CFFTF 6.664e-08 CFFTB 5.960e-08 CFFTFB 6.144e-08 3 RFFTF 3.974e-08 RFFTB 1.192e-07 RFFTFB 3.303e-08 SINT 1.987e-08 SINTFB 1.069e-08 COST 4.967e-08 COSTFB 5.721e-08 SINQF 8.941e-08 SINQB 2.980e-08 SINQFB 1.259e-07 COSQF 7.451e-09 COSQB 4.967e-08 COSQFB 7.029e-08 DEZF 1.192e-07 DEZB 5.960e-08 DEZFB 5.960e-08 CFFTF 7.947e-08 CFFTB 8.429e-08 CFFTFB 9.064e-08 2 RFFTF 0.000e+00 RFFTB 0.000e+00 RFFTFB 0.000e+00 SINT 0.000e+00 SINTFB 0.000e+00 COST 0.000e+00 COSTFB 0.000e+00 SINQF 1.192e-07 SINQB 2.980e-08 SINQFB 5.960e-08 COSQF 7.451e-09 COSQB 1.490e-08 COSQFB 0.000e+00 DEZF 0.000e+00 DEZB 0.000e+00 DEZFB 0.000e+00 CFFTF 0.000e+00 CFFTB 5.960e-08 CFFTFB 5.960e-08 Everything looks fine. */ return all_ok ? 0 : 1; } #endif //TESTING_FFTPACK
Codebase Browser
chromium