Home | History | Annotate | Download | only in generic

Lines Matching refs:omega

376 	  N=n*GMP_NUMB_BITS, and 2^omega is a primitive root mod 2^N+1
377    output: A[inc*l[k][i]] <- \sum (2^omega)^(ij) A[inc*j] mod 2^N+1 */
381 	     mp_size_t omega, mp_size_t n, mp_size_t inc, mp_ptr tp)
403       mpn_fft_fft (Ap,     K2, ll-1, 2 * omega, n, inc * 2, tp);
404       mpn_fft_fft (Ap+inc, K2, ll-1, 2 * omega, n, inc * 2, tp);
405       /* A[2*j*inc]   <- A[2*j*inc] + omega^l[k][2*j*inc] A[(2j+1)inc]
406 	 A[(2j+1)inc] <- A[2*j*inc] + omega^l[k][(2j+1)inc] A[(2j+1)inc] */
409 	  /* Ap[inc] <- Ap[0] + Ap[inc] * 2^(lk[1] * omega)
410 	     Ap[0]   <- Ap[0] + Ap[inc] * 2^(lk[0] * omega) */
411 	  mpn_fft_mul_2exp_modF (tp, Ap[inc], lk[0] * omega, n);
423 	  N=n*GMP_NUMB_BITS, and 2^omega is a primitive root mod 2^N+1
424    output: A[inc*l[k][i]] <- \sum (2^omega)^(ij) A[inc*j] mod 2^N+1
576 mpn_fft_fftinv (mp_ptr *Ap, mp_size_t K, mp_size_t omega, mp_size_t n, mp_ptr tp)
597       mpn_fft_fftinv (Ap,      K2, 2 * omega, n, tp);
598       mpn_fft_fftinv (Ap + K2, K2, 2 * omega, n, tp);
599       /* A[j]     <- A[j] + omega^j A[j+K/2]
600 	 A[j+K/2] <- A[j] + omega^(j+K/2) A[j+K/2] */
603 	  /* Ap[K2] <- Ap[0] + Ap[K2] * 2^((j + K2) * omega)
604 	     Ap[0]  <- Ap[0] + Ap[K2] * 2^(j * omega) */
605 	  mpn_fft_mul_2exp_modF (tp, Ap[K2], j * omega, n);