This is the java implementation of performing Discrete Fourier Transform using Fast Fourier Transform algorithm. This class finds the DFT of N (power of 2) complex elements, generated randomly, using FFT. The input to the class is a two dimensional array of sequence.
Here is the source code of the Java Perform to a 2D FFT Inplace Given a Complex 2D Array. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a sample program to perform 2D FFT inplace import java.util.Scanner; public class TwoD_FFT { static void twoDfft(double[][] inputData, double[][] realOut, double[][] imagOut, double[][] amplitudeOut) { int height = inputData.length; int width = inputData[0].length; // Two outer loops iterate on output data. for (int yWave = 0; yWave < height; yWave++) { for (int xWave = 0; xWave < width; xWave++) { // Two inner loops iterate on input data. for (int ySpace = 0; ySpace < height; ySpace++) { for (int xSpace = 0; xSpace < width; xSpace++) { // Compute real, imag, and ampltude. realOut[yWave][xWave] += (inputData[ySpace][xSpace] * Math .cos(2 * Math.PI * ((1.0 * xWave * xSpace / width) + (1.0 * yWave * ySpace / height)))) / Math.sqrt(width * height); imagOut[yWave][xWave] -= (inputData[ySpace][xSpace] * Math .sin(2 * Math.PI * ((1.0 * xWave * xSpace / width) + (1.0 * yWave * ySpace / height)))) / Math.sqrt(width * height); amplitudeOut[yWave][xWave] = Math .sqrt(realOut[yWave][xWave] * realOut[yWave][xWave] + imagOut[yWave][xWave] * imagOut[yWave][xWave]); } System.out.println(realOut[yWave][xWave] + " + " + imagOut[yWave][xWave] + " i"); } } } } public static void main(String args[]) { System.out.println("Enter the size: "); Scanner sc = new Scanner(System.in); int n = sc.nextInt(); double[][] input = new double[n][n]; double[][] real = new double[n][n]; double[][] img = new double[n][n]; double[][] amplitutude = new double[n][n]; System.out.println("Enter the 2D elements "); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) input[i][j] = sc.nextDouble(); twoDfft(input, real, img, amplitutude); sc.close(); } }
Output:
$ javac TwoD_FFT.java $ java TwoD_FFT Enter the size: 2 Enter the 2D elements 2 3 4 2 2.5 + 0.0 i 5.5 + 0.0 i -0.5 + -1.8369701987210297E-16 i 0.5 + -3.0616169978683826E-16 i 2.5 + 0.0 i -0.5 + -3.6739403974420594E-16 i -0.5 + -1.8369701987210297E-16 i -1.5 + -1.8369701987210297E-16 i
Related posts:
Java Program to Implement Variable length array
Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees
Hướng dẫn sử dụng Java Annotation
Java Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers
Spring Cloud – Adding Angular
Java Program to Implement Brent Cycle Algorithm
Spring Security with Maven
Introduction to Using FreeMarker in Spring MVC
Disable Spring Data Auto Configuration
Java Program to Implement Counting Sort
Java Program to implement Bit Set
Java Program to Find the Longest Subsequence Common to All Sequences in a Set of Sequences
Debugging Reactive Streams in Java
An Intro to Spring Cloud Security
Removing Elements from Java Collections
Java Program to Implement the RSA Algorithm
Java Web Services – JAX-WS – SOAP
Java Program to Print the Kind of Rotation the AVL Tree is Undergoing
Java Program to Perform Insertion in a BST
Spring Boot - Securing Web Applications
Spring Boot - Enabling Swagger2
LinkedHashSet trong Java hoạt động như thế nào?
Spring REST with a Zuul Proxy
Java 8 StringJoiner
The XOR Operator in Java
Java Program to Implement Flood Fill Algorithm
Java – Try with Resources
Anonymous Classes in Java
Guide to WeakHashMap in Java
Java Program to Find the Peak Element of an Array O(n) time (Naive Method)
Hướng dẫn sử dụng Java Reflection
Intersection of Two Lists in Java