1 subroutine cmf2kb ( lot, ido, l1, na, cc, im1, in1, ch, im2, in2, wa )
3 !*****************************************************************************80
5 !! CMF2KB 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(2,in1,l1,ido,2)
42 real ( kind = 4 ) ch(2,in2,l1,2,ido)
43 real ( kind = 4 ) chold1
44 real ( kind = 4 ) chold2
45 integer ( kind = 4 ) i
46 integer ( kind = 4 ) im1
47 integer ( kind = 4 ) im2
48 integer ( kind = 4 ) k
49 integer ( kind = 4 ) lot
50 integer ( kind = 4 ) m1
51 integer ( kind = 4 ) m1d
52 integer ( kind = 4 ) m2
53 integer ( kind = 4 ) m2s
54 integer ( kind = 4 ) na
57 real ( kind = 4 ) wa(ido,1,2)
59 m1d = ( lot - 1 ) * im1 + 1
62 if ( 1 < ido .or. na == 1 ) then
68 ch(1,m2,k,1,1) = cc(1,m1,k,1,1) + cc(1,m1,k,1,2)
69 ch(1,m2,k,2,1) = cc(1,m1,k,1,1) - cc(1,m1,k,1,2)
70 ch(2,m2,k,1,1) = cc(2,m1,k,1,1) + cc(2,m1,k,1,2)
71 ch(2,m2,k,2,1) = cc(2,m1,k,1,1) - cc(2,m1,k,1,2)
80 ch(1,m2,k,1,i) = cc(1,m1,k,i,1)+cc(1,m1,k,i,2)
81 tr2 = cc(1,m1,k,i,1)-cc(1,m1,k,i,2)
82 ch(2,m2,k,1,i) = cc(2,m1,k,i,1)+cc(2,m1,k,i,2)
83 ti2 = cc(2,m1,k,i,1)-cc(2,m1,k,i,2)
85 ch(2,m2,k,2,i) = wa(i,1,1) * ti2 + wa(i,1,2) * tr2
86 ch(1,m2,k,2,i) = wa(i,1,1) * tr2 - wa(i,1,2) * ti2
97 chold1 = cc(1,m1,k,1,1) + cc(1,m1,k,1,2)
98 cc(1,m1,k,1,2) = cc(1,m1,k,1,1) - cc(1,m1,k,1,2)
99 cc(1,m1,k,1,1) = chold1
101 chold2 = cc(2,m1,k,1,1) + cc(2,m1,k,1,2)
102 cc(2,m1,k,1,2) = cc(2,m1,k,1,1) - cc(2,m1,k,1,2)
103 cc(2,m1,k,1,1) = chold2