1 subroutine c1f2kf ( ido, l1, na, cc, in1, ch, in2, wa )
3 !*****************************************************************************80
5 !! C1F2KF is an FFTPACK5 auxiliary routine.
8 ! Copyright (C) 1995-2004, Scientific Computing Division,
9 ! University Corporation for Atmospheric Research
23 ! Vectorizing the Fast Fourier Transforms,
24 ! in Parallel Computations,
25 ! edited by G. Rodrigue,
26 ! Academic Press, 1982.
29 ! Fast Fourier Transform Algorithms for Vector Computers,
30 ! Parallel Computing, pages 45-63, 1984.
36 integer ( kind = 4 ) ido
37 integer ( kind = 4 ) in1
38 integer ( kind = 4 ) in2
39 integer ( kind = 4 ) l1
41 real ( kind = 4 ) cc(in1,l1,ido,2)
42 real ( kind = 4 ) ch(in2,l1,2,ido)
43 real ( kind = 4 ) chold1
44 real ( kind = 4 ) chold2
45 integer ( kind = 4 ) i
46 integer ( kind = 4 ) k
47 integer ( kind = 4 ) na
51 real ( kind = 4 ) wa(ido,1,2)
56 ch(1,k,1,1) = cc(1,k,1,1) + cc(1,k,1,2)
57 ch(1,k,2,1) = cc(1,k,1,1) - cc(1,k,1,2)
58 ch(2,k,1,1) = cc(2,k,1,1) + cc(2,k,1,2)
59 ch(2,k,2,1) = cc(2,k,1,1) - cc(2,k,1,2)
64 ch(1,k,1,i) = cc(1,k,i,1) + cc(1,k,i,2)
65 tr2 = cc(1,k,i,1) - cc(1,k,i,2)
66 ch(2,k,1,i) = cc(2,k,i,1) + cc(2,k,i,2)
67 ti2 = cc(2,k,i,1) - cc(2,k,i,2)
68 ch(2,k,2,i) = wa(i,1,1) * ti2 - wa(i,1,2) * tr2
69 ch(1,k,2,i) = wa(i,1,1) * tr2 + wa(i,1,2) * ti2
73 else if ( na == 1 ) then
75 sn = 1.0E+00 / real ( 2 * l1, kind = 4 )
78 ch(1,k,1,1) = sn * ( cc(1,k,1,1) + cc(1,k,1,2) )
79 ch(1,k,2,1) = sn * ( cc(1,k,1,1) - cc(1,k,1,2) )
80 ch(2,k,1,1) = sn * ( cc(2,k,1,1) + cc(2,k,1,2) )
81 ch(2,k,2,1) = sn * ( cc(2,k,1,1) - cc(2,k,1,2) )
86 sn = 1.0E+00 / real ( 2 * l1, kind = 4 )
90 chold1 = sn * ( cc(1,k,1,1) + cc(1,k,1,2) )
91 cc(1,k,1,2) = sn * ( cc(1,k,1,1) - cc(1,k,1,2) )
94 chold2 = sn * ( cc(2,k,1,1) + cc(2,k,1,2) )
95 cc(2,k,1,2) = sn * ( cc(2,k,1,1) - cc(2,k,1,2) )