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
|
/*
* Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
* Copyright (C) 2008 - INRIA - Allan SIMON
*
* This file must be used under the terms of the CeCILL.
* This source file is licensed as described in the file COPYING, which
* you should have received as part of this distribution. The terms
* are also available at
* http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
*
*/
#define FFT842 1
#define DFFT2 0
#include "fft.h"
#include <stdio.h>
void zfftma ( doubleComplex* in , int rows, int cols, doubleComplex* out)
{
int choosenAlgo = DFFT2 ;
int size = rows*cols ;
int sizeTemp = 0;
/*
int sizeWorkSpace = size *2;
*/
int rowsTemp = 0 ;
int colsTemp = 0 ;
int ierr = 0 ;
int isn = -1;
int i = 0;
double* realIn = (double*) malloc ( sizeof (double) * (unsigned int) size );
double* imagIn = (double*) malloc ( sizeof (double) * (unsigned int) size );
doubleComplex* inTemp = (doubleComplex*) malloc ( sizeof (doubleComplex) * (unsigned int) size );
/*
double* workSpace = (double*) malloc ( sizeof (double) * (unsigned int) sizeWorkSpace );
*/
zimaga ( in , size , imagIn) ;
zreala ( in , size , realIn) ;
if ( rows == 1 || cols == 1 )
{
/* vector case */
sizeTemp = (int) pow ( 2 , (int ) (log( size + 0.5 ) /log ( 2 ))) ;
if ( size == sizeTemp )
{
if ( size <= pow ( 2 , 15 ))
{
/* if the size is a power of 2 and inferior to 2^15 */
fft842 ( in , size , 0 );
choosenAlgo = FFT842 ;
}
else
{
/* if the size is a power of 2 and superior to 2^15 */
dfft2 ( realIn , imagIn , 1 , size , 1 , isn , ierr /*, workSpace , sizeWorkSpace*/ );
}
}
else
{
/* all other case of vector */
dfft2 ( realIn , imagIn , 1 , size , 1 , isn , ierr /*, workSpace , sizeWorkSpace */);
}
}
/* matrix case */
else
{
rowsTemp = (int) pow ( 2 , log( rows + 0.5) /log ( 2 )) ;
colsTemp = (int) pow ( 2 , log( cols + 0.5) /log ( 2 )) ;
if ( cols == colsTemp)
{
if ( cols <= pow ( 2 , 15 ))
{
for ( i = 0 ; i < rows ; i++ )
{
fft842 ( &in[ cols*i] , cols , 0);
choosenAlgo = FFT842 ;
}
}
else
{
dfft2 ( realIn, imagIn ,rows , cols , 1 , isn , ierr/* ,workSpace , sizeWorkSpace */);
}
}
else
{
dfft2 ( realIn, imagIn ,rows , cols , 1 , isn , ierr/* ,workSpace , sizeWorkSpace*/ );
}
/*second call*/
if ( 2*rows <= 0 /* sizeWorkSpace*/ )
{
if ( rowsTemp == rows )
{
if ( rows <= pow ( 2 ,15) )
{
/*compute the fft on each line of the matrix */
for (i = 0 ; i < cols ; i++ )
{
C2F(zcopy) ( rows, in + i, cols, inTemp , 1 );
fft842( inTemp , rows , 0);
choosenAlgo = FFT842 ;
C2F(zcopy) ( rows, inTemp , cols, in + i, 1 );
}
}
else
{
dfft2 ( realIn, imagIn, 1, rows, cols, isn, ierr/*, workSpace, sizeWorkSpace*/);
}
}
else
{
dfft2 ( realIn, imagIn, 1, rows, cols, isn, ierr/*, workSpace, sizeWorkSpace*/);
}
}
else
{
dfft2 ( realIn, imagIn, 1, rows, cols, isn, ierr/*, workSpace, sizeWorkSpace*/);
}
}
/* here we copy the result into the output , there are two cases because fft842 take a the complex matrix in one block
and dfft2 separate real and imaginary part */
if ( choosenAlgo == FFT842 )
{
for ( i = 0 ; i < size ; i++)
{
out[i] = DoubleComplex ( zreals(in[i]) , zimags(in[i]) );
}
}
else
{
for ( i = 0 ; i < size ; i++)
{
out[i] = DoubleComplex ( realIn[i] , imagIn[i] );
}
}
}
|
