Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: #include "dft.h"
Chris@42: 
Chris@42: typedef struct {
Chris@42:      solver super;
Chris@42: } S;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_dft super;
Chris@42:      INT n;     /* problem size */
Chris@42:      INT nb;    /* size of convolution */
Chris@42:      R *w;      /* lambda k . exp(2*pi*i*k^2/(2*n)) */
Chris@42:      R *W;      /* DFT(w) */
Chris@42:      plan *cldf;
Chris@42:      INT is, os;
Chris@42: } P;
Chris@42: 
Chris@42: static void bluestein_sequence(enum wakefulness wakefulness, INT n, R *w)
Chris@42: {
Chris@42:      INT k, ksq, n2 = 2 * n;
Chris@42:      triggen *t = X(mktriggen)(wakefulness, n2);
Chris@42: 
Chris@42:      ksq = 0;
Chris@42:      for (k = 0; k < n; ++k) {
Chris@42: 	  t->cexp(t, ksq, w+2*k);
Chris@42:           /* careful with overflow */
Chris@42:           ksq += 2*k + 1; while (ksq > n2) ksq -= n2;
Chris@42:      }
Chris@42: 
Chris@42:      X(triggen_destroy)(t);
Chris@42: }
Chris@42: 
Chris@42: static void mktwiddle(enum wakefulness wakefulness, P *p)
Chris@42: {
Chris@42:      INT i;
Chris@42:      INT n = p->n, nb = p->nb;
Chris@42:      R *w, *W;
Chris@42:      E nbf = (E)nb;
Chris@42: 
Chris@42:      p->w = w = (R *) MALLOC(2 * n * sizeof(R), TWIDDLES);
Chris@42:      p->W = W = (R *) MALLOC(2 * nb * sizeof(R), TWIDDLES);
Chris@42: 
Chris@42:      bluestein_sequence(wakefulness, n, w);
Chris@42: 
Chris@42:      for (i = 0; i < nb; ++i)
Chris@42:           W[2*i] = W[2*i+1] = K(0.0);
Chris@42: 
Chris@42:      W[0] = w[0] / nbf;
Chris@42:      W[1] = w[1] / nbf;
Chris@42: 
Chris@42:      for (i = 1; i < n; ++i) {
Chris@42:           W[2*i] = W[2*(nb-i)] = w[2*i] / nbf;
Chris@42:           W[2*i+1] = W[2*(nb-i)+1] = w[2*i+1] / nbf;
Chris@42:      }
Chris@42: 
Chris@42:      {
Chris@42:           plan_dft *cldf = (plan_dft *)p->cldf;
Chris@42: 	  /* cldf must be awake */
Chris@42:           cldf->apply(p->cldf, W, W+1, W, W+1);
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static void apply(const plan *ego_, R *ri, R *ii, R *ro, R *io)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      INT i, n = ego->n, nb = ego->nb, is = ego->is, os = ego->os;
Chris@42:      R *w = ego->w, *W = ego->W;
Chris@42:      R *b = (R *) MALLOC(2 * nb * sizeof(R), BUFFERS);
Chris@42: 
Chris@42:      /* multiply input by conjugate bluestein sequence */
Chris@42:      for (i = 0; i < n; ++i) {
Chris@42: 	  E xr = ri[i*is], xi = ii[i*is];
Chris@42:           E wr = w[2*i], wi = w[2*i+1];
Chris@42:           b[2*i] = xr * wr + xi * wi;
Chris@42:           b[2*i+1] = xi * wr - xr * wi;
Chris@42:      }
Chris@42: 
Chris@42:      for (; i < nb; ++i) b[2*i] = b[2*i+1] = K(0.0);
Chris@42: 
Chris@42:      /* convolution: FFT */
Chris@42:      {
Chris@42:           plan_dft *cldf = (plan_dft *)ego->cldf;
Chris@42:           cldf->apply(ego->cldf, b, b+1, b, b+1);
Chris@42:      }
Chris@42: 
Chris@42:      /* convolution: pointwise multiplication */
Chris@42:      for (i = 0; i < nb; ++i) {
Chris@42: 	  E xr = b[2*i], xi = b[2*i+1];
Chris@42:           E wr = W[2*i], wi = W[2*i+1];
Chris@42:           b[2*i] = xi * wr + xr * wi;
Chris@42:           b[2*i+1] = xr * wr - xi * wi;
Chris@42:      }
Chris@42: 
Chris@42:      /* convolution: IFFT by FFT with real/imag input/output swapped */
Chris@42:      {
Chris@42:           plan_dft *cldf = (plan_dft *)ego->cldf;
Chris@42:           cldf->apply(ego->cldf, b, b+1, b, b+1);
Chris@42:      }
Chris@42: 
Chris@42:      /* multiply output by conjugate bluestein sequence */
Chris@42:      for (i = 0; i < n; ++i) {
Chris@42: 	  E xi = b[2*i], xr = b[2*i+1];
Chris@42:           E wr = w[2*i], wi = w[2*i+1];
Chris@42:           ro[i*os] = xr * wr + xi * wi;
Chris@42:           io[i*os] = xi * wr - xr * wi;
Chris@42:      }
Chris@42: 
Chris@42:      X(ifree)(b);	  
Chris@42: }
Chris@42: 
Chris@42: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42: 
Chris@42:      X(plan_awake)(ego->cldf, wakefulness);
Chris@42: 
Chris@42:      switch (wakefulness) {
Chris@42: 	 case SLEEPY:
Chris@42: 	      X(ifree0)(ego->w); ego->w = 0;
Chris@42: 	      X(ifree0)(ego->W); ego->W = 0;
Chris@42: 	      break;
Chris@42: 	 default:
Chris@42: 	      A(!ego->w);
Chris@42: 	      mktwiddle(wakefulness, ego);
Chris@42: 	      break;
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static int applicable(const solver *ego, const problem *p_, 
Chris@42: 		      const planner *plnr)
Chris@42: {
Chris@42:      const problem_dft *p = (const problem_dft *) p_;
Chris@42:      UNUSED(ego);
Chris@42:      return (1
Chris@42: 	     && p->sz->rnk == 1
Chris@42: 	     && p->vecsz->rnk == 0
Chris@42: 	     /* FIXME: allow other sizes */
Chris@42: 	     && X(is_prime)(p->sz->dims[0].n)
Chris@42: 
Chris@42: 	     /* FIXME: avoid infinite recursion of bluestein with itself.
Chris@42: 		This works because all factors in child problems are 2, 3, 5 */
Chris@42: 	     && p->sz->dims[0].n > 16
Chris@42: 
Chris@42: 	     && CIMPLIES(NO_SLOWP(plnr), p->sz->dims[0].n > BLUESTEIN_MAX_SLOW)
Chris@42: 	  );
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(plan_destroy_internal)(ego->cldf);
Chris@42: }
Chris@42: 
Chris@42: static void print(const plan *ego_, printer *p)
Chris@42: {
Chris@42:      const P *ego = (const P *)ego_;
Chris@42:      p->print(p, "(dft-bluestein-%D/%D%(%p%))",
Chris@42:               ego->n, ego->nb, ego->cldf);
Chris@42: }
Chris@42: 
Chris@42: static INT choose_transform_size(INT minsz)
Chris@42: {
Chris@42:      while (!X(factors_into_small_primes)(minsz))
Chris@42: 	  ++minsz;
Chris@42:      return minsz;
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const problem_dft *p = (const problem_dft *) p_;
Chris@42:      P *pln;
Chris@42:      INT n, nb;
Chris@42:      plan *cldf = 0;
Chris@42:      R *buf = (R *) 0;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(dft_solve), awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      if (!applicable(ego, p_, plnr))
Chris@42: 	  return (plan *) 0;
Chris@42: 
Chris@42:      n = p->sz->dims[0].n;
Chris@42:      nb = choose_transform_size(2 * n - 1);
Chris@42:      buf = (R *) MALLOC(2 * nb * sizeof(R), BUFFERS);
Chris@42: 
Chris@42:      cldf = X(mkplan_f_d)(plnr, 
Chris@42: 			  X(mkproblem_dft_d)(X(mktensor_1d)(nb, 2, 2),
Chris@42: 					     X(mktensor_1d)(1, 0, 0),
Chris@42: 					     buf, buf+1, 
Chris@42: 					     buf, buf+1),
Chris@42: 			  NO_SLOW, 0, 0);
Chris@42:      if (!cldf) goto nada;
Chris@42: 
Chris@42:      X(ifree)(buf);
Chris@42: 
Chris@42:      pln = MKPLAN_DFT(P, &padt, apply);
Chris@42: 
Chris@42:      pln->n = n;
Chris@42:      pln->nb = nb;
Chris@42:      pln->w = 0;
Chris@42:      pln->W = 0;
Chris@42:      pln->cldf = cldf;
Chris@42:      pln->is = p->sz->dims[0].is;
Chris@42:      pln->os = p->sz->dims[0].os;
Chris@42: 
Chris@42:      X(ops_add)(&cldf->ops, &cldf->ops, &pln->super.super.ops);
Chris@42:      pln->super.super.ops.add += 4 * n + 2 * nb;
Chris@42:      pln->super.super.ops.mul += 8 * n + 4 * nb;
Chris@42:      pln->super.super.ops.other += 6 * (n + nb);
Chris@42: 
Chris@42:      return &(pln->super.super);
Chris@42: 
Chris@42:  nada:
Chris@42:      X(ifree0)(buf);
Chris@42:      X(plan_destroy_internal)(cldf);
Chris@42:      return (plan *)0;
Chris@42: }
Chris@42: 
Chris@42: 
Chris@42: static solver *mksolver(void)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_DFT, mkplan, 0 };
Chris@42:      S *slv = MKSOLVER(S, &sadt);
Chris@42:      return &(slv->super);
Chris@42: }
Chris@42: 
Chris@42: void X(dft_bluestein_register)(planner *p)
Chris@42: {
Chris@42:      REGISTER_SOLVER(p, mksolver());
Chris@42: }