1 subroutine r1f2kb ( ido, l1, cc, in1, ch, in2, wa1 )
3 !*****************************************************************************80
5 !! R1F2KB 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,ido,2,l1)
42 real ( kind = 4 ) ch(in2,ido,l1,2)
43 integer ( kind = 4 ) i
44 integer ( kind = 4 ) ic
45 integer ( kind = 4 ) idp2
46 integer ( kind = 4 ) k
47 real ( kind = 4 ) wa1(ido)
50 ch(1,1,k,1) = cc(1,1,1,k) + cc(1,ido,2,k)
51 ch(1,1,k,2) = cc(1,1,1,k) - cc(1,ido,2,k)
65 ch(1,i-1,k,1) = cc(1,i-1,1,k) + cc(1,ic-1,2,k)
66 ch(1,i,k,1) = cc(1,i,1,k) - cc(1,ic,2,k)
68 ch(1,i-1,k,2) = wa1(i-2) * ( cc(1,i-1,1,k) - cc(1,ic-1,2,k) ) &
69 - wa1(i-1) * ( cc(1,i,1,k) + cc(1,ic,2,k) )
70 ch(1,i,k,2) = wa1(i-2) * ( cc(1,i,1,k) + cc(1,ic,2,k) ) &
71 + wa1(i-1) * ( cc(1,i-1,1,k) - cc(1,ic-1,2,k) )
76 if ( mod ( ido, 2 ) == 1 ) then
83 ch(1,ido,k,1) = cc(1,ido,1,k) + cc(1,ido,1,k)
84 ch(1,ido,k,2) = - ( cc(1,1,2,k) + cc(1,1,2,k) )