// Copyright (C) 1999 Jean-Marc Valin

#include "BufferedNode.h"
#include "Buffer.h"
#include "Vector.h"
#include <map>
#include "FFTWrap.h"
#include <complex>

using namespace std;

namespace FD {

class IRFFT;

DECLARE_NODE(IRFFT)
/*Node
 *
 * @name IRFFT
 * @category DSP:TimeFreq
 * @require FFT
 * @description Inverse FFT, half complex to real vector
 *
 * @input_name INPUT
 * @input_type Vector<complex>
 * @input_description Half complex vector
 *
 * @output_name OUTPUT
 * @output_type Vector<float>
 * @output_description Real inverse FFT output
 *
END*/


class IRFFT : public BufferedNode {
   
   int inputID;
   int outputID;

public:
   IRFFT(string nodeName, ParameterSet params)
   : BufferedNode(nodeName, params)
   {
      inputID = addInput("INPUT");
      outputID = addOutput("OUTPUT");
   }

   void calculate(int output_id, int count, Buffer &out)
   {
      ObjectRef inputValue = getInput(inputID, count);

      const Vector<complex<float> > &in = object_cast<Vector<complex<float> > > (inputValue);
      int inputLength = in.size();

      Vector<float> &output = *Vector<float>::alloc(inputLength<<1);
      out[count] = &output;
      
      DYN_VEC(float, inputLength<<1, fft_in);
      //float fft_in[inputLength<<1];

      fft_in[0] = in[0].real();
      fft_in[inputLength] = 0;
      for (int i=1;i<inputLength;i++)
      {
	 fft_in[i] = in[i].real();
	 fft_in[(inputLength<<1)-i] = in[i].imag();
      }

      FFTWrap.irfft(fft_in, &output[0], inputLength<<1);
      
   }

};
}//namespace FD