Lines Matching full:radix
223 int digits[34], radix[34];
258 // radix[] is initialized from index 'nf' down to zero
260 radix[nf] = 1;
265 radix[nf-i-1] = radix[nf-i]*factors[nf-i-1];
273 int a = radix[1], na2 = n*a>>1, na4 = na2 >> 1;
311 for( i = n, j = radix[2]; i < n0; )
317 j += radix[2];
321 j += radix[k+2] - radix[k];
333 j += radix[1];
337 j += radix[k+2] - radix[k];
431 // mixed-radix complex discrete Fourier transform: double-precision version
549 // radix-4 transform
611 // do the remaining radix-2 transform
650 // radix-3
686 // radix-5
741 // radix-"factor" - an odd number
854 // mixed-radix complex discrete Fourier transform: single-precision version
975 // radix-4 transform
1037 // do the remaining radix-2 transform
1076 // radix-3
1112 // radix-5
1167 // radix-"factor" - an odd number
