-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfft.f
More file actions
3033 lines (3032 loc) · 229 KB
/
fft.f
File metadata and controls
3033 lines (3032 loc) · 229 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
C
C FFTPACK
C
C* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
C
C version 4 april 1985
C
C a package of fortran subprograms for the fast fourier
C transform of periodic and other symmetric sequences
C
C by
C
C paul n swarztrauber
C
C national center for atmospheric research boulder,colorado 80307
C
C which is sponsored by the national science foundation
C
C* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
C
C
C SUBROUTINE CFFTB(N,C,WSAVE)
C
C SUBROUTINE CFFTB COMPUTES THE BACKWARD COMPLEX DISCRETE FOURIER
C TRANSFORM (THE FOURIER SYNTHESIS). EQUIVALENTLY , CFFTB COMPUTES
C A COMPLEX PERIODIC SEQUENCE FROM ITS FOURIER COEFFICIENTS.
C THE TRANSFORM IS DEFINED BELOW AT OUTPUT PARAMETER C.
C
C A CALL OF CFFTF FOLLOWED BY A CALL OF CFFTB WILL MULTIPLY THE
C SEQUENCE BY N.
C
C THE ARRAY WSAVE WHICH IS USED BY SUBROUTINE CFFTB MUST BE
C INITIALIZED BY CALLING SUBROUTINE CFFTI(N,WSAVE).
C
C INPUT PARAMETERS
C
C
C N THE LENGTH OF THE COMPLEX SEQUENCE C. THE METHOD IS
C MORE EFFICIENT WHEN N IS THE PRODUCT OF SMALL PRIMES.
C
C C A COMPLEX ARRAY OF LENGTH N WHICH CONTAINS THE SEQUENCE
C
C WSAVE A REAL WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 4N+15
C IN THE PROGRAM THAT CALLS CFFTB. THE WSAVE ARRAY MUST BE
C INITIALIZED BY CALLING SUBROUTINE CFFTI(N,WSAVE) AND A
C DIFFERENT WSAVE ARRAY MUST BE USED FOR EACH DIFFERENT
C VALUE OF N. THIS INITIALIZATION DOES NOT HAVE TO BE
C REPEATED SO LONG AS N REMAINS UNCHANGED THUS SUBSEQUENT
C TRANSFORMS CAN BE OBTAINED FASTER THAN THE FIRST.
C THE SAME WSAVE ARRAY CAN BE USED BY CFFTF AND CFFTB.
C
C OUTPUT PARAMETERS
C
C C FOR J=1,...,N
C
C C(J)=THE SUM FROM K=1,...,N OF
C
C C(K)*EXP(I*(J-1)*(K-1)*2*PI/N)
C
C WHERE I=SQRT(-1)
C
C WSAVE CONTAINS INITIALIZATION CALCULATIONS WHICH MUST NOT BE
C DESTROYED BETWEEN CALLS OF SUBROUTINE CFFTF OR CFFTB
C
SUBROUTINE CFFTB (N,C,WSAVE)
DIMENSION C(*) ,WSAVE(*)
C
IF (N .EQ. 1) RETURN
IW1 = N+N+1
IW2 = IW1+N+N
CALL CFFTB1 (N,C,WSAVE,WSAVE(IW1),WSAVE(IW2))
RETURN
END
SUBROUTINE CFFTB1 (N,C,CH,WA,IFAC)
DIMENSION CH(*) ,C(*) ,WA(*) ,IFAC(*)
NF = IFAC(2)
NA = 0
L1 = 1
IW = 1
DO 116 K1=1,NF
IP = IFAC(K1+2)
L2 = IP*L1
IDO = N/L2
IDOT = IDO+IDO
IDL1 = IDOT*L1
IF (IP .NE. 4) GO TO 103
IX2 = IW+IDOT
IX3 = IX2+IDOT
IF (NA .NE. 0) GO TO 101
CALL PASSB4 (IDOT,L1,C,CH,WA(IW),WA(IX2),WA(IX3))
GO TO 102
101 CALL PASSB4 (IDOT,L1,CH,C,WA(IW),WA(IX2),WA(IX3))
102 NA = 1-NA
GO TO 115
103 IF (IP .NE. 2) GO TO 106
IF (NA .NE. 0) GO TO 104
CALL PASSB2 (IDOT,L1,C,CH,WA(IW))
GO TO 105
104 CALL PASSB2 (IDOT,L1,CH,C,WA(IW))
105 NA = 1-NA
GO TO 115
106 IF (IP .NE. 3) GO TO 109
IX2 = IW+IDOT
IF (NA .NE. 0) GO TO 107
CALL PASSB3 (IDOT,L1,C,CH,WA(IW),WA(IX2))
GO TO 108
107 CALL PASSB3 (IDOT,L1,CH,C,WA(IW),WA(IX2))
108 NA = 1-NA
GO TO 115
109 IF (IP .NE. 5) GO TO 112
IX2 = IW+IDOT
IX3 = IX2+IDOT
IX4 = IX3+IDOT
IF (NA .NE. 0) GO TO 110
CALL PASSB5 (IDOT,L1,C,CH,WA(IW),WA(IX2),WA(IX3),WA(IX4))
GO TO 111
110 CALL PASSB5 (IDOT,L1,CH,C,WA(IW),WA(IX2),WA(IX3),WA(IX4))
111 NA = 1-NA
GO TO 115
112 IF (NA .NE. 0) GO TO 113
CALL PASSB (NAC,IDOT,IP,L1,IDL1,C,C,C,CH,CH,WA(IW))
GO TO 114
113 CALL PASSB (NAC,IDOT,IP,L1,IDL1,CH,CH,CH,C,C,WA(IW))
114 IF (NAC .NE. 0) NA = 1-NA
115 L1 = L2
IW = IW+(IP-1)*IDOT
116 CONTINUE
IF (NA .EQ. 0) RETURN
N2 = N+N
DO 117 I=1,N2
C(I) = CH(I)
117 CONTINUE
RETURN
END
C SUBROUTINE CFFTF(N,C,WSAVE)
C
C SUBROUTINE CFFTF COMPUTES THE FORWARD COMPLEX DISCRETE FOURIER
C TRANSFORM (THE FOURIER ANALYSIS). EQUIVALENTLY , CFFTF COMPUTES
C THE FOURIER COEFFICIENTS OF A COMPLEX PERIODIC SEQUENCE.
C THE TRANSFORM IS DEFINED BELOW AT OUTPUT PARAMETER C.
C
C THE TRANSFORM IS NOT NORMALIZED. TO OBTAIN A NORMALIZED TRANSFORM
C THE OUTPUT MUST BE DIVIDED BY N. OTHERWISE A CALL OF CFFTF
C FOLLOWED BY A CALL OF CFFTB WILL MULTIPLY THE SEQUENCE BY N.
C
C THE ARRAY WSAVE WHICH IS USED BY SUBROUTINE CFFTF MUST BE
C INITIALIZED BY CALLING SUBROUTINE CFFTI(N,WSAVE).
C
C INPUT PARAMETERS
C
C
C N THE LENGTH OF THE COMPLEX SEQUENCE C. THE METHOD IS
C MORE EFFICIENT WHEN N IS THE PRODUCT OF SMALL PRIMES. N
C
C C A COMPLEX ARRAY OF LENGTH N WHICH CONTAINS THE SEQUENCE
C
C WSAVE A REAL WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 4N+15
C IN THE PROGRAM THAT CALLS CFFTF. THE WSAVE ARRAY MUST BE
C INITIALIZED BY CALLING SUBROUTINE CFFTI(N,WSAVE) AND A
C DIFFERENT WSAVE ARRAY MUST BE USED FOR EACH DIFFERENT
C VALUE OF N. THIS INITIALIZATION DOES NOT HAVE TO BE
C REPEATED SO LONG AS N REMAINS UNCHANGED THUS SUBSEQUENT
C TRANSFORMS CAN BE OBTAINED FASTER THAN THE FIRST.
C THE SAME WSAVE ARRAY CAN BE USED BY CFFTF AND CFFTB.
C
C OUTPUT PARAMETERS
C
C C FOR J=1,...,N
C
C C(J)=THE SUM FROM K=1,...,N OF
C
C C(K)*EXP(-I*(J-1)*(K-1)*2*PI/N)
C
C WHERE I=SQRT(-1)
C
C WSAVE CONTAINS INITIALIZATION CALCULATIONS WHICH MUST NOT BE
C DESTROYED BETWEEN CALLS OF SUBROUTINE CFFTF OR CFFTB
C
SUBROUTINE CFFTF (N,C,WSAVE)
DIMENSION C(*) ,WSAVE(*)
C
IF (N .EQ. 1) RETURN
IW1 = N+N+1
IW2 = IW1+N+N
CALL CFFTF1 (N,C,WSAVE,WSAVE(IW1),WSAVE(IW2))
RETURN
END
SUBROUTINE CFFTF1 (N,C,CH,WA,IFAC)
DIMENSION CH(*) ,C(*) ,WA(*) ,IFAC(*)
NF = IFAC(2)
NA = 0
L1 = 1
IW = 1
DO 116 K1=1,NF
IP = IFAC(K1+2)
L2 = IP*L1
IDO = N/L2
IDOT = IDO+IDO
IDL1 = IDOT*L1
IF (IP .NE. 4) GO TO 103
IX2 = IW+IDOT
IX3 = IX2+IDOT
IF (NA .NE. 0) GO TO 101
CALL PASSF4 (IDOT,L1,C,CH,WA(IW),WA(IX2),WA(IX3))
GO TO 102
101 CALL PASSF4 (IDOT,L1,CH,C,WA(IW),WA(IX2),WA(IX3))
102 NA = 1-NA
GO TO 115
103 IF (IP .NE. 2) GO TO 106
IF (NA .NE. 0) GO TO 104
CALL PASSF2 (IDOT,L1,C,CH,WA(IW))
GO TO 105
104 CALL PASSF2 (IDOT,L1,CH,C,WA(IW))
105 NA = 1-NA
GO TO 115
106 IF (IP .NE. 3) GO TO 109
IX2 = IW+IDOT
IF (NA .NE. 0) GO TO 107
CALL PASSF3 (IDOT,L1,C,CH,WA(IW),WA(IX2))
GO TO 108
107 CALL PASSF3 (IDOT,L1,CH,C,WA(IW),WA(IX2))
108 NA = 1-NA
GO TO 115
109 IF (IP .NE. 5) GO TO 112
IX2 = IW+IDOT
IX3 = IX2+IDOT
IX4 = IX3+IDOT
IF (NA .NE. 0) GO TO 110
CALL PASSF5 (IDOT,L1,C,CH,WA(IW),WA(IX2),WA(IX3),WA(IX4))
GO TO 111
110 CALL PASSF5 (IDOT,L1,CH,C,WA(IW),WA(IX2),WA(IX3),WA(IX4))
111 NA = 1-NA
GO TO 115
112 IF (NA .NE. 0) GO TO 113
CALL PASSF (NAC,IDOT,IP,L1,IDL1,C,C,C,CH,CH,WA(IW))
GO TO 114
113 CALL PASSF (NAC,IDOT,IP,L1,IDL1,CH,CH,CH,C,C,WA(IW))
114 IF (NAC .NE. 0) NA = 1-NA
115 L1 = L2
IW = IW+(IP-1)*IDOT
116 CONTINUE
IF (NA .EQ. 0) RETURN
N2 = N+N
DO 117 I=1,N2
C(I) = CH(I)
117 CONTINUE
RETURN
END
C SUBROUTINE CFFTI(N,WSAVE)
C
C SUBROUTINE CFFTI INITIALIZES THE ARRAY WSAVE WHICH IS USED IN
C BOTH CFFTF AND CFFTB. THE PRIME FACTORIZATION OF N TOGETHER WITH
C A TABULATION OF THE TRIGONOMETRIC FUNCTIONS ARE COMPUTED AND
C STORED IN WSAVE.
C
C INPUT PARAMETER
C
C N THE LENGTH OF THE SEQUENCE TO BE TRANSFORMED
C
C OUTPUT PARAMETER
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 4*N+15
C THE SAME WORK ARRAY CAN BE USED FOR BOTH CFFTF AND CFFTB
C AS LONG AS N REMAINS UNCHANGED. DIFFERENT WSAVE ARRAYS
C ARE REQUIRED FOR DIFFERENT VALUES OF N. THE CONTENTS OF
C WSAVE MUST NOT BE CHANGED BETWEEN CALLS OF CFFTF OR CFFTB.
C
SUBROUTINE CFFTI (N,WSAVE)
DIMENSION WSAVE(*)
C
IF (N .EQ. 1) RETURN
IW1 = N+N+1
IW2 = IW1+N+N
CALL CFFTI1 (N,WSAVE(IW1),WSAVE(IW2))
RETURN
END
SUBROUTINE CFFTI1 (N,WA,IFAC)
DIMENSION WA(*) ,IFAC(*) ,NTRYH(4)
DATA NTRYH(1),NTRYH(2),NTRYH(3),NTRYH(4)/3,4,2,5/
NL = N
NF = 0
J = 0
101 J = J+1
IF (J-4) 102,102,103
102 NTRY = NTRYH(J)
GO TO 104
103 NTRY = NTRY+2
104 NQ = NL/NTRY
NR = NL-NTRY*NQ
IF (NR) 101,105,101
105 NF = NF+1
IFAC(NF+2) = NTRY
NL = NQ
IF (NTRY .NE. 2) GO TO 107
IF (NF .EQ. 1) GO TO 107
DO 106 I=2,NF
IB = NF-I+2
IFAC(IB+2) = IFAC(IB+1)
106 CONTINUE
IFAC(3) = 2
107 IF (NL .NE. 1) GO TO 104
IFAC(1) = N
IFAC(2) = NF
TPI = 2.*PIMACH(DUM)
ARGH = TPI/FLOAT(N)
I = 2
L1 = 1
DO 110 K1=1,NF
IP = IFAC(K1+2)
LD = 0
L2 = L1*IP
IDO = N/L2
IDOT = IDO+IDO+2
IPM = IP-1
DO 109 J=1,IPM
I1 = I
WA(I-1) = 1.
WA(I) = 0.
LD = LD+L1
FI = 0.
ARGLD = FLOAT(LD)*ARGH
DO 108 II=4,IDOT,2
I = I+2
FI = FI+1.
ARG = FI*ARGLD
WA(I-1) = COS(ARG)
WA(I) = SIN(ARG)
108 CONTINUE
IF (IP .LE. 5) GO TO 109
WA(I1-1) = WA(I-1)
WA(I1) = WA(I)
109 CONTINUE
L1 = L2
110 CONTINUE
RETURN
END
C SUBROUTINE COSQB(N,X,WSAVE)
C
C SUBROUTINE COSQB COMPUTES THE FAST FOURIER TRANSFORM OF QUARTER
C WAVE DATA. THAT IS , COSQB COMPUTES A SEQUENCE FROM ITS
C REPRESENTATION IN TERMS OF A COSINE SERIES WITH ODD WAVE NUMBERS.
C THE TRANSFORM IS DEFINED BELOW AT OUTPUT PARAMETER X.
C
C COSQB IS THE UNNORMALIZED INVERSE OF COSQF SINCE A CALL OF COSQB
C FOLLOWED BY A CALL OF COSQF WILL MULTIPLY THE INPUT SEQUENCE X
C BY 4*N.
C
C THE ARRAY WSAVE WHICH IS USED BY SUBROUTINE COSQB MUST BE
C INITIALIZED BY CALLING SUBROUTINE COSQI(N,WSAVE).
C
C
C INPUT PARAMETERS
C
C N THE LENGTH OF THE ARRAY X TO BE TRANSFORMED. THE METHOD
C IS MOST EFFICIENT WHEN N IS A PRODUCT OF SMALL PRIMES.
C
C X AN ARRAY WHICH CONTAINS THE SEQUENCE TO BE TRANSFORMED
C
C WSAVE A WORK ARRAY THAT MUST BE DIMENSIONED AT LEAST 3*N+15
C IN THE PROGRAM THAT CALLS COSQB. THE WSAVE ARRAY MUST BE
C INITIALIZED BY CALLING SUBROUTINE COSQI(N,WSAVE) AND A
C DIFFERENT WSAVE ARRAY MUST BE USED FOR EACH DIFFERENT
C VALUE OF N. THIS INITIALIZATION DOES NOT HAVE TO BE
C REPEATED SO LONG AS N REMAINS UNCHANGED THUS SUBSEQUENT
C TRANSFORMS CAN BE OBTAINED FASTER THAN THE FIRST.
C
C OUTPUT PARAMETERS
C
C X FOR I=1,...,N
C
C X(I)= THE SUM FROM K=1 TO K=N OF
C
C 4*X(K)*COS((2*K-1)*(I-1)*PI/(2*N))
C
C A CALL OF COSQB FOLLOWED BY A CALL OF
C COSQF WILL MULTIPLY THE SEQUENCE X BY 4*N.
C THEREFORE COSQF IS THE UNNORMALIZED INVERSE
C OF COSQB.
C
C WSAVE CONTAINS INITIALIZATION CALCULATIONS WHICH MUST NOT
C BE DESTROYED BETWEEN CALLS OF COSQB OR COSQF.
C
SUBROUTINE COSQB (N,X,WSAVE)
DIMENSION X(*) ,WSAVE(*)
DATA TSQRT2 /2.82842712474619/
C
IF (N-2) 101,102,103
101 X(1) = 4.*X(1)
RETURN
102 X1 = 4.*(X(1)+X(2))
X(2) = TSQRT2*(X(1)-X(2))
X(1) = X1
RETURN
103 CALL COSQB1 (N,X,WSAVE,WSAVE(N+1))
RETURN
END
SUBROUTINE COSQB1 (N,X,W,XH)
DIMENSION X(*) ,W(*) ,XH(*)
NS2 = (N+1)/2
NP2 = N+2
DO 101 I=3,N,2
XIM1 = X(I-1)+X(I)
X(I) = X(I)-X(I-1)
X(I-1) = XIM1
101 CONTINUE
X(1) = X(1)+X(1)
MODN = MOD(N,2)
IF (MODN .EQ. 0) X(N) = X(N)+X(N)
CALL RFFTB (N,X,XH)
DO 102 K=2,NS2
KC = NP2-K
XH(K) = W(K-1)*X(KC)+W(KC-1)*X(K)
XH(KC) = W(K-1)*X(K)-W(KC-1)*X(KC)
102 CONTINUE
IF (MODN .EQ. 0) X(NS2+1) = W(NS2)*(X(NS2+1)+X(NS2+1))
DO 103 K=2,NS2
KC = NP2-K
X(K) = XH(K)+XH(KC)
X(KC) = XH(K)-XH(KC)
103 CONTINUE
X(1) = X(1)+X(1)
RETURN
END
C SUBROUTINE COSQF(N,X,WSAVE)
C
C SUBROUTINE COSQF COMPUTES THE FAST FOURIER TRANSFORM OF QUARTER
C WAVE DATA. THAT IS , COSQF COMPUTES THE COEFFICIENTS IN A COSINE
C SERIES REPRESENTATION WITH ONLY ODD WAVE NUMBERS. THE TRANSFORM
C IS DEFINED BELOW AT OUTPUT PARAMETER X
C
C COSQF IS THE UNNORMALIZED INVERSE OF COSQB SINCE A CALL OF COSQF
C FOLLOWED BY A CALL OF COSQB WILL MULTIPLY THE INPUT SEQUENCE X
C BY 4*N.
C
C THE ARRAY WSAVE WHICH IS USED BY SUBROUTINE COSQF MUST BE
C INITIALIZED BY CALLING SUBROUTINE COSQI(N,WSAVE).
C
C
C INPUT PARAMETERS
C
C N THE LENGTH OF THE ARRAY X TO BE TRANSFORMED. THE METHOD
C IS MOST EFFICIENT WHEN N IS A PRODUCT OF SMALL PRIMES.
C
C X AN ARRAY WHICH CONTAINS THE SEQUENCE TO BE TRANSFORMED
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 3*N+15
C IN THE PROGRAM THAT CALLS COSQF. THE WSAVE ARRAY MUST BE
C INITIALIZED BY CALLING SUBROUTINE COSQI(N,WSAVE) AND A
C DIFFERENT WSAVE ARRAY MUST BE USED FOR EACH DIFFERENT
C VALUE OF N. THIS INITIALIZATION DOES NOT HAVE TO BE
C REPEATED SO LONG AS N REMAINS UNCHANGED THUS SUBSEQUENT
C TRANSFORMS CAN BE OBTAINED FASTER THAN THE FIRST.
C
C OUTPUT PARAMETERS
C
C X FOR I=1,...,N
C
C X(I) = X(1) PLUS THE SUM FROM K=2 TO K=N OF
C
C 2*X(K)*COS((2*I-1)*(K-1)*PI/(2*N))
C
C A CALL OF COSQF FOLLOWED BY A CALL OF
C COSQB WILL MULTIPLY THE SEQUENCE X BY 4*N.
C THEREFORE COSQB IS THE UNNORMALIZED INVERSE
C OF COSQF.
C
C WSAVE CONTAINS INITIALIZATION CALCULATIONS WHICH MUST NOT
C BE DESTROYED BETWEEN CALLS OF COSQF OR COSQB.
C
SUBROUTINE COSQF (N,X,WSAVE)
DIMENSION X(*) ,WSAVE(*)
DATA SQRT2 /1.4142135623731/
C
IF (N-2) 102,101,103
101 TSQX = SQRT2*X(2)
X(2) = X(1)-TSQX
X(1) = X(1)+TSQX
102 RETURN
103 CALL COSQF1 (N,X,WSAVE,WSAVE(N+1))
RETURN
END
SUBROUTINE COSQF1 (N,X,W,XH)
DIMENSION X(*) ,W(*) ,XH(*)
NS2 = (N+1)/2
NP2 = N+2
DO 101 K=2,NS2
KC = NP2-K
XH(K) = X(K)+X(KC)
XH(KC) = X(K)-X(KC)
101 CONTINUE
MODN = MOD(N,2)
IF (MODN .EQ. 0) XH(NS2+1) = X(NS2+1)+X(NS2+1)
DO 102 K=2,NS2
KC = NP2-K
X(K) = W(K-1)*XH(KC)+W(KC-1)*XH(K)
X(KC) = W(K-1)*XH(K)-W(KC-1)*XH(KC)
102 CONTINUE
IF (MODN .EQ. 0) X(NS2+1) = W(NS2)*XH(NS2+1)
CALL RFFTF (N,X,XH)
DO 103 I=3,N,2
XIM1 = X(I-1)-X(I)
X(I) = X(I-1)+X(I)
X(I-1) = XIM1
103 CONTINUE
RETURN
END
C SUBROUTINE COSQI(N,WSAVE)
C
C SUBROUTINE COSQI INITIALIZES THE ARRAY WSAVE WHICH IS USED IN
C BOTH COSQF AND COSQB. THE PRIME FACTORIZATION OF N TOGETHER WITH
C A TABULATION OF THE TRIGONOMETRIC FUNCTIONS ARE COMPUTED AND
C STORED IN WSAVE.
C
C INPUT PARAMETER
C
C N THE LENGTH OF THE ARRAY TO BE TRANSFORMED. THE METHOD
C IS MOST EFFICIENT WHEN N IS A PRODUCT OF SMALL PRIMES.
C
C OUTPUT PARAMETER
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 3*N+15.
C THE SAME WORK ARRAY CAN BE USED FOR BOTH COSQF AND COSQB
C AS LONG AS N REMAINS UNCHANGED. DIFFERENT WSAVE ARRAYS
C ARE REQUIRED FOR DIFFERENT VALUES OF N. THE CONTENTS OF
C WSAVE MUST NOT BE CHANGED BETWEEN CALLS OF COSQF OR COSQB.
C
SUBROUTINE COSQI (N,WSAVE)
DIMENSION WSAVE(*)
C
PIH = 0.5*PIMACH(DUM)
DT = PIH/FLOAT(N)
FK = 0.
DO 101 K=1,N
FK = FK+1.
WSAVE(K) = COS(FK*DT)
101 CONTINUE
CALL RFFTI (N,WSAVE(N+1))
RETURN
END
C SUBROUTINE COST(N,X,WSAVE)
C
C SUBROUTINE COST COMPUTES THE DISCRETE FOURIER COSINE TRANSFORM
C OF AN EVEN SEQUENCE X(I). THE TRANSFORM IS DEFINED BELOW AT OUTPUT
C PARAMETER X.
C
C COST IS THE UNNORMALIZED INVERSE OF ITSELF SINCE A CALL OF COST
C FOLLOWED BY ANOTHER CALL OF COST WILL MULTIPLY THE INPUT SEQUENCE
C X BY 2*(N-1). THE TRANSFORM IS DEFINED BELOW AT OUTPUT PARAMETER X
C
C THE ARRAY WSAVE WHICH IS USED BY SUBROUTINE COST MUST BE
C INITIALIZED BY CALLING SUBROUTINE COSTI(N,WSAVE).
C
C INPUT PARAMETERS
C
C N THE LENGTH OF THE SEQUENCE X. N MUST BE GREATER THAN 1.
C THE METHOD IS MOST EFFICIENT WHEN N-1 IS A PRODUCT OF
C SMALL PRIMES.
C
C X AN ARRAY WHICH CONTAINS THE SEQUENCE TO BE TRANSFORMED
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 3*N+15
C IN THE PROGRAM THAT CALLS COST. THE WSAVE ARRAY MUST BE
C INITIALIZED BY CALLING SUBROUTINE COSTI(N,WSAVE) AND A
C DIFFERENT WSAVE ARRAY MUST BE USED FOR EACH DIFFERENT
C VALUE OF N. THIS INITIALIZATION DOES NOT HAVE TO BE
C REPEATED SO LONG AS N REMAINS UNCHANGED THUS SUBSEQUENT
C TRANSFORMS CAN BE OBTAINED FASTER THAN THE FIRST.
C
C OUTPUT PARAMETERS
C
C X FOR I=1,...,N
C
C X(I) = X(1)+(-1)**(I-1)*X(N)
C
C + THE SUM FROM K=2 TO K=N-1
C
C 2*X(K)*COS((K-1)*(I-1)*PI/(N-1))
C
C A CALL OF COST FOLLOWED BY ANOTHER CALL OF
C COST WILL MULTIPLY THE SEQUENCE X BY 2*(N-1)
C HENCE COST IS THE UNNORMALIZED INVERSE
C OF ITSELF.
C
C WSAVE CONTAINS INITIALIZATION CALCULATIONS WHICH MUST NOT BE
C DESTROYED BETWEEN CALLS OF COST.
C
SUBROUTINE COST (N,X,WSAVE)
DIMENSION X(*) ,WSAVE(*)
C
NM1 = N-1
NP1 = N+1
NS2 = N/2
IF (N-2) 106,101,102
101 X1H = X(1)+X(2)
X(2) = X(1)-X(2)
X(1) = X1H
RETURN
102 IF (N .GT. 3) GO TO 103
X1P3 = X(1)+X(3)
TX2 = X(2)+X(2)
X(2) = X(1)-X(3)
X(1) = X1P3+TX2
X(3) = X1P3-TX2
RETURN
103 C1 = X(1)-X(N)
X(1) = X(1)+X(N)
DO 104 K=2,NS2
KC = NP1-K
T1 = X(K)+X(KC)
T2 = X(K)-X(KC)
C1 = C1+WSAVE(KC)*T2
T2 = WSAVE(K)*T2
X(K) = T1-T2
X(KC) = T1+T2
104 CONTINUE
MODN = MOD(N,2)
IF (MODN .NE. 0) X(NS2+1) = X(NS2+1)+X(NS2+1)
CALL RFFTF (NM1,X,WSAVE(N+1))
XIM2 = X(2)
X(2) = C1
DO 105 I=4,N,2
XI = X(I)
X(I) = X(I-2)-X(I-1)
X(I-1) = XIM2
XIM2 = XI
105 CONTINUE
IF (MODN .NE. 0) X(N) = XIM2
106 RETURN
END
C SUBROUTINE COSTI(N,WSAVE)
C
C SUBROUTINE COSTI INITIALIZES THE ARRAY WSAVE WHICH IS USED IN
C SUBROUTINE COST. THE PRIME FACTORIZATION OF N TOGETHER WITH
C A TABULATION OF THE TRIGONOMETRIC FUNCTIONS ARE COMPUTED AND
C STORED IN WSAVE.
C
C INPUT PARAMETER
C
C N THE LENGTH OF THE SEQUENCE TO BE TRANSFORMED. THE METHOD
C IS MOST EFFICIENT WHEN N-1 IS A PRODUCT OF SMALL PRIMES.
C
C OUTPUT PARAMETER
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 3*N+15.
C DIFFERENT WSAVE ARRAYS ARE REQUIRED FOR DIFFERENT VALUES
C OF N. THE CONTENTS OF WSAVE MUST NOT BE CHANGED BETWEEN
C CALLS OF COST.
C
SUBROUTINE COSTI (N,WSAVE)
DIMENSION WSAVE(*)
C
PI = PIMACH(DUM)
IF (N .LE. 3) RETURN
NM1 = N-1
NP1 = N+1
NS2 = N/2
DT = PI/FLOAT(NM1)
FK = 0.
DO 101 K=2,NS2
KC = NP1-K
FK = FK+1.
WSAVE(K) = 2.*SIN(FK*DT)
WSAVE(KC) = 2.*COS(FK*DT)
101 CONTINUE
CALL RFFTI (NM1,WSAVE(N+1))
RETURN
END
SUBROUTINE EZFFT1 (N,WA,IFAC)
DIMENSION WA(*) ,IFAC(*) ,NTRYH(4)
DATA NTRYH(1),NTRYH(2),NTRYH(3),NTRYH(4)/4,2,3,5/
TPI = 2.0*PIMACH(DUM)
NL = N
NF = 0
J = 0
101 J = J+1
IF (J-4) 102,102,103
102 NTRY = NTRYH(J)
GO TO 104
103 NTRY = NTRY+2
104 NQ = NL/NTRY
NR = NL-NTRY*NQ
IF (NR) 101,105,101
105 NF = NF+1
IFAC(NF+2) = NTRY
NL = NQ
IF (NTRY .NE. 2) GO TO 107
IF (NF .EQ. 1) GO TO 107
DO 106 I=2,NF
IB = NF-I+2
IFAC(IB+2) = IFAC(IB+1)
106 CONTINUE
IFAC(3) = 2
107 IF (NL .NE. 1) GO TO 104
IFAC(1) = N
IFAC(2) = NF
ARGH = TPI/FLOAT(N)
IS = 0
NFM1 = NF-1
L1 = 1
IF (NFM1 .EQ. 0) RETURN
DO 111 K1=1,NFM1
IP = IFAC(K1+2)
L2 = L1*IP
IDO = N/L2
IPM = IP-1
ARG1 = FLOAT(L1)*ARGH
CH1 = 1.
SH1 = 0.
DCH1 = COS(ARG1)
DSH1 = SIN(ARG1)
DO 110 J=1,IPM
CH1H = DCH1*CH1-DSH1*SH1
SH1 = DCH1*SH1+DSH1*CH1
CH1 = CH1H
I = IS+2
WA(I-1) = CH1
WA(I) = SH1
IF (IDO .LT. 5) GO TO 109
DO 108 II=5,IDO,2
I = I+2
WA(I-1) = CH1*WA(I-3)-SH1*WA(I-2)
WA(I) = CH1*WA(I-2)+SH1*WA(I-3)
108 CONTINUE
109 IS = IS+IDO
110 CONTINUE
L1 = L2
111 CONTINUE
RETURN
END
C SUBROUTINE EZFFTB(N,R,AZERO,A,B,WSAVE)
C
C SUBROUTINE EZFFTB COMPUTES A REAL PERODIC SEQUENCE FROM ITS
C FOURIER COEFFICIENTS (FOURIER SYNTHESIS). THE TRANSFORM IS
C DEFINED BELOW AT OUTPUT PARAMETER R. EZFFTB IS A SIMPLIFIED
C BUT SLOWER VERSION OF RFFTB.
C
C INPUT PARAMETERS
C
C N THE LENGTH OF THE OUTPUT ARRAY R. THE METHOD IS MOST
C EFFICIENT WHEN N IS THE PRODUCT OF SMALL PRIMES.
C
C AZERO THE CONSTANT FOURIER COEFFICIENT
C
C A,B ARRAYS WHICH CONTAIN THE REMAINING FOURIER COEFFICIENTS
C THESE ARRAYS ARE NOT DESTROYED.
C
C THE LENGTH OF THESE ARRAYS DEPENDS ON WHETHER N IS EVEN OR
C ODD.
C
C IF N IS EVEN N/2 LOCATIONS ARE REQUIRED
C IF N IS ODD (N-1)/2 LOCATIONS ARE REQUIRED
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 3*N+15.
C IN THE PROGRAM THAT CALLS EZFFTB. THE WSAVE ARRAY MUST BE
C INITIALIZED BY CALLING SUBROUTINE EZFFTI(N,WSAVE) AND A
C DIFFERENT WSAVE ARRAY MUST BE USED FOR EACH DIFFERENT
C VALUE OF N. THIS INITIALIZATION DOES NOT HAVE TO BE
C REPEATED SO LONG AS N REMAINS UNCHANGED THUS SUBSEQUENT
C TRANSFORMS CAN BE OBTAINED FASTER THAN THE FIRST.
C THE SAME WSAVE ARRAY CAN BE USED BY EZFFTF AND EZFFTB.
C
C
C OUTPUT PARAMETERS
C
C R IF N IS EVEN DEFINE KMAX=N/2
C IF N IS ODD DEFINE KMAX=(N-1)/2
C
C THEN FOR I=1,...,N
C
C R(I)=AZERO PLUS THE SUM FROM K=1 TO K=KMAX OF
C
C A(K)*COS(K*(I-1)*2*PI/N)+B(K)*SIN(K*(I-1)*2*PI/N)
C
C ********************* COMPLEX NOTATION **************************
C
C FOR J=1,...,N
C
C R(J) EQUALS THE SUM FROM K=-KMAX TO K=KMAX OF
C
C C(K)*EXP(I*K*(J-1)*2*PI/N)
C
C WHERE
C
C C(K) = .5*CMPLX(A(K),-B(K)) FOR K=1,...,KMAX
C
C C(-K) = CONJG(C(K))
C
C C(0) = AZERO
C
C AND I=SQRT(-1)
C
C *************** AMPLITUDE - PHASE NOTATION ***********************
C
C FOR I=1,...,N
C
C R(I) EQUALS AZERO PLUS THE SUM FROM K=1 TO K=KMAX OF
C
C ALPHA(K)*COS(K*(I-1)*2*PI/N+BETA(K))
C
C WHERE
C
C ALPHA(K) = SQRT(A(K)*A(K)+B(K)*B(K))
C
C COS(BETA(K))=A(K)/ALPHA(K)
C
C SIN(BETA(K))=-B(K)/ALPHA(K)
C
SUBROUTINE EZFFTB (N,R,AZERO,A,B,WSAVE)
DIMENSION R(*) ,A(*) ,B(*) ,WSAVE(*)
C
IF (N-2) 101,102,103
101 R(1) = AZERO
RETURN
102 R(1) = AZERO+A(1)
R(2) = AZERO-A(1)
RETURN
103 NS2 = (N-1)/2
DO 104 I=1,NS2
R(2*I) = .5*A(I)
R(2*I+1) = -.5*B(I)
104 CONTINUE
R(1) = AZERO
IF (MOD(N,2) .EQ. 0) R(N) = A(NS2+1)
CALL RFFTB (N,R,WSAVE(N+1))
RETURN
END
C SUBROUTINE EZFFTF(N,R,AZERO,A,B,WSAVE)
C
C SUBROUTINE EZFFTF COMPUTES THE FOURIER COEFFICIENTS OF A REAL
C PERODIC SEQUENCE (FOURIER ANALYSIS). THE TRANSFORM IS DEFINED
C BELOW AT OUTPUT PARAMETERS AZERO,A AND B. EZFFTF IS A SIMPLIFIED
C BUT SLOWER VERSION OF RFFTF.
C
C INPUT PARAMETERS
C
C N THE LENGTH OF THE ARRAY R TO BE TRANSFORMED. THE METHOD
C IS MUST EFFICIENT WHEN N IS THE PRODUCT OF SMALL PRIMES.
C
C R A REAL ARRAY OF LENGTH N WHICH CONTAINS THE SEQUENCE
C TO BE TRANSFORMED. R IS NOT DESTROYED.
C
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 3*N+15.
C IN THE PROGRAM THAT CALLS EZFFTF. THE WSAVE ARRAY MUST BE
C INITIALIZED BY CALLING SUBROUTINE EZFFTI(N,WSAVE) AND A
C DIFFERENT WSAVE ARRAY MUST BE USED FOR EACH DIFFERENT
C VALUE OF N. THIS INITIALIZATION DOES NOT HAVE TO BE
C REPEATED SO LONG AS N REMAINS UNCHANGED THUS SUBSEQUENT
C TRANSFORMS CAN BE OBTAINED FASTER THAN THE FIRST.
C THE SAME WSAVE ARRAY CAN BE USED BY EZFFTF AND EZFFTB.
C
C OUTPUT PARAMETERS
C
C AZERO THE SUM FROM I=1 TO I=N OF R(I)/N
C
C A,B FOR N EVEN B(N/2)=0. AND A(N/2) IS THE SUM FROM I=1 TO
C I=N OF (-1)**(I-1)*R(I)/N
C
C FOR N EVEN DEFINE KMAX=N/2-1
C FOR N ODD DEFINE KMAX=(N-1)/2
C
C THEN FOR K=1,...,KMAX
C
C A(K) EQUALS THE SUM FROM I=1 TO I=N OF
C
C 2./N*R(I)*COS(K*(I-1)*2*PI/N)
C
C B(K) EQUALS THE SUM FROM I=1 TO I=N OF
C
C 2./N*R(I)*SIN(K*(I-1)*2*PI/N)
C
C
SUBROUTINE EZFFTF (N,R,AZERO,A,B,WSAVE)
DIMENSION R(*) ,A(*) ,B(*) ,WSAVE(*)
C
IF (N-2) 101,102,103
101 AZERO = R(1)
RETURN
102 AZERO = .5*(R(1)+R(2))
A(1) = .5*(R(1)-R(2))
RETURN
103 DO 104 I=1,N
WSAVE(I) = R(I)
104 CONTINUE
CALL RFFTF (N,WSAVE,WSAVE(N+1))
CF = 2./FLOAT(N)
CFM = -CF
AZERO = .5*CF*WSAVE(1)
NS2 = (N+1)/2
NS2M = NS2-1
DO 105 I=1,NS2M
A(I) = CF*WSAVE(2*I)
B(I) = CFM*WSAVE(2*I+1)
105 CONTINUE
IF (MOD(N,2) .EQ. 1) RETURN
A(NS2) = .5*CF*WSAVE(N)
B(NS2) = 0.
RETURN
END
C SUBROUTINE EZFFTI(N,WSAVE)
C
C SUBROUTINE EZFFTI INITIALIZES THE ARRAY WSAVE WHICH IS USED IN
C BOTH EZFFTF AND EZFFTB. THE PRIME FACTORIZATION OF N TOGETHER WITH
C A TABULATION OF THE TRIGONOMETRIC FUNCTIONS ARE COMPUTED AND
C STORED IN WSAVE.
C
C INPUT PARAMETER
C
C N THE LENGTH OF THE SEQUENCE TO BE TRANSFORMED.
C
C OUTPUT PARAMETER
C
C WSAVE A WORK ARRAY WHICH MUST BE DIMENSIONED AT LEAST 3*N+15.
C THE SAME WORK ARRAY CAN BE USED FOR BOTH EZFFTF AND EZFFTB
C AS LONG AS N REMAINS UNCHANGED. DIFFERENT WSAVE ARRAYS
C ARE REQUIRED FOR DIFFERENT VALUES OF N.
C
SUBROUTINE EZFFTI (N,WSAVE)
DIMENSION WSAVE(*)
C
IF (N .EQ. 1) RETURN
CALL EZFFT1 (N,WSAVE(2*N+1),WSAVE(3*N+1))
RETURN
END
SUBROUTINE PASSB (NAC,IDO,IP,L1,IDL1,CC,C1,C2,CH,CH2,WA)
DIMENSION CH(IDO,L1,IP) ,CC(IDO,IP,L1) ,
1 C1(IDO,L1,IP) ,WA(*) ,C2(IDL1,IP),
2 CH2(IDL1,IP)
IDOT = IDO/2
NT = IP*IDL1
IPP2 = IP+2
IPPH = (IP+1)/2
IDP = IP*IDO
C
IF (IDO .LT. L1) GO TO 106
DO 103 J=2,IPPH
JC = IPP2-J
DO 102 K=1,L1
DO 101 I=1,IDO
CH(I,K,J) = CC(I,J,K)+CC(I,JC,K)
CH(I,K,JC) = CC(I,J,K)-CC(I,JC,K)
101 CONTINUE
102 CONTINUE
103 CONTINUE
DO 105 K=1,L1
DO 104 I=1,IDO
CH(I,K,1) = CC(I,1,K)
104 CONTINUE
105 CONTINUE
GO TO 112
106 DO 109 J=2,IPPH
JC = IPP2-J
DO 108 I=1,IDO
DO 107 K=1,L1
CH(I,K,J) = CC(I,J,K)+CC(I,JC,K)
CH(I,K,JC) = CC(I,J,K)-CC(I,JC,K)
107 CONTINUE
108 CONTINUE
109 CONTINUE
DO 111 I=1,IDO
DO 110 K=1,L1
CH(I,K,1) = CC(I,1,K)
110 CONTINUE
111 CONTINUE
112 IDL = 2-IDO
INC = 0
DO 116 L=2,IPPH
LC = IPP2-L
IDL = IDL+IDO
DO 113 IK=1,IDL1
C2(IK,L) = CH2(IK,1)+WA(IDL-1)*CH2(IK,2)
C2(IK,LC) = WA(IDL)*CH2(IK,IP)
113 CONTINUE
IDLJ = IDL
INC = INC+IDO
DO 115 J=3,IPPH
JC = IPP2-J
IDLJ = IDLJ+INC
IF (IDLJ .GT. IDP) IDLJ = IDLJ-IDP
WAR = WA(IDLJ-1)
WAI = WA(IDLJ)
DO 114 IK=1,IDL1
C2(IK,L) = C2(IK,L)+WAR*CH2(IK,J)
C2(IK,LC) = C2(IK,LC)+WAI*CH2(IK,JC)
114 CONTINUE
115 CONTINUE
116 CONTINUE
DO 118 J=2,IPPH
DO 117 IK=1,IDL1
CH2(IK,1) = CH2(IK,1)+CH2(IK,J)
117 CONTINUE
118 CONTINUE
DO 120 J=2,IPPH
JC = IPP2-J
DO 119 IK=2,IDL1,2
CH2(IK-1,J) = C2(IK-1,J)-C2(IK,JC)
CH2(IK-1,JC) = C2(IK-1,J)+C2(IK,JC)
CH2(IK,J) = C2(IK,J)+C2(IK-1,JC)
CH2(IK,JC) = C2(IK,J)-C2(IK-1,JC)