package fft;
//Title:        2-d mixed radix IFFT.
//Version:
//Copyright:    Copyright (c) 1998
//Author:       Dongyan Wang
//Company:      University of Wisconsin-Milwaukee.
//Description:
//              . Use IFFT1d to perform IFFT2d.



public class IFFT2d {

  // Input of IFFT, 2-d matrix.
  double dataRe[][], dataIm[][];

  // Width and height of 2-d matrix inputRe or inputIm.
  int width, height;

  // Constructor: 2-d IFFT of Complex data.
  public IFFT2d(double inputRe[], double inputIm[], int inputWidth) {
    // First make sure inputRe & inputIm are of the same length.
    if(inputRe.length != inputIm.length){
       System.out.println("Error: the length of real part & imaginary part "+
                          "of the input to 2-d IFFT are different");
       return;
    }
    else{
       width  = inputWidth;
       height = inputRe.length/width;
       dataRe = new double[height][width];
       dataIm = new double[height][width];

       for(int i=0;i<height;i++)
         for(int j=0;j<width;j++){
           dataRe[i][j] = inputRe[i*width + j];
           dataIm[i][j] = inputIm[i*width + j];
         }

       // Calculate IFFT for each row of the data.
       IFFT1d ifft1 = new IFFT1d(width);
       for(int i=0; i<height; i++)
         ifft1.ifft(dataRe[i], dataIm[i]);

       // Tranpose data.
       // Calculate IFFT for each column of the data.
       double temRe[][] = transpose(dataRe);
       double temIm[][] = transpose(dataIm);

       IFFT1d ifft2 = new IFFT1d(height);
       for(int j=0; j<width; j++)
         ifft2.ifft(temRe[j], temIm[j]);

       // Tranpose data.
       // Copy the result to input[], so the output can be
       // returned in the input array.
       for(int i=0;i<height;i++)
         for(int j=0;j<width;j++){
           inputRe[i*width + j] = temRe[j][i];
           inputIm[i*width + j] = temIm[j][i];
         }
    }
  }

  // Transpose matrix input.
  private double[][] transpose(double [][] input)
  {
    double[][] output = new double[width][height];

    for(int j=0; j<width; j++)
       for(int i=0; i<height; i++)
          output[j][i] = input[i][j];

      return output;
  } // End of function transpose().
} // End of class IFFT2d.