This is the java implementation of calculating coefficients of the given function performing the Discrete-Fourier Transform. Formula for calculating the coefficient is X(k) = Sum(x(n)*cos(2*PI*k*n/N) – iSum(x(n)*sin(2*PI*k*n/N)) over 0 to N-1
Here is the source code of the Java Program to Compute DFT Coefficients Directly. 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 calculate a DFT Coefficients using the formula
import java.util.Scanner;
public class DFT_Coefficient
{
double real, img;
public DFT_Coefficient()
{
this.real = 0.0;
this.img = 0.0;
}
public static void main(String args[])
{
int N = 10;
Scanner sc = new Scanner(System.in);
System.out.println("Calculation DFT Coefficients");
System.out.println("Enter the coefficient of simple linear funtion:");
System.out.println("ax + by = c");
double a = sc.nextDouble();
double b = sc.nextDouble();
double c = sc.nextDouble();
double []function = new double[N];
for(int i=0; i<N; i++)
{
function[i] = (((a*(double)i) + (b*(double)i)) - c);
//System.out.print( " "+function[i] + " ");
}
System.out.println("Enter the max K value: ");
int k = sc.nextInt();
double []cos = new double[N];
double []sin = new double[N];
for(int i=0; i<N; i++)
{
cos[i] = Math.cos((2 * i * k * Math.PI) / N);
sin[i] = Math.sin((2 * i * k * Math.PI) / N);
}
DFT_Coefficient dft_val = new DFT_Coefficient();
System.out.println("The coefficients are: ");
for(int i=0; i<N; i++)
{
dft_val.real += function[i] * cos[i];
dft_val.img += function[i] * sin[i];
}
System.out.println("("+dft_val.real + ") - " + "("+dft_val.img + " i)");
sc.close();
}
}
Output:
$ javac DFT_Coefficient.java $ java DFT_Coefficient Calculation DFT Coefficients Enter the coefficient of simple linear funtion: ax + by = c 1 2 3 Enter the max K value: 2 The coefficients are: (-15.00000000000001) - (-20.6457288070676 i)
Related posts:
Java Program to Implement Max Heap
Java Program to Perform LU Decomposition of any Matrix
Java Program to Implement Bucket Sort
Guide to Java 8 groupingBy Collector
Guide to UUID in Java
The Dining Philosophers Problem in Java
More Jackson Annotations
Java Program to Use Above Below Primitive to Test Whether Two Lines Intersect
Java Program to Solve Set Cover Problem assuming at max 2 Elements in a Subset
Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search
Java Program to Implement Segment Tree
Mảng (Array) trong Java
Java Program to Implement Ternary Tree
Java Program to Check for balanced parenthesis by using Stacks
Lớp Collectors trong Java 8
A Custom Data Binder in Spring MVC
Java Program to Implement D-ary-Heap
LinkedHashSet trong Java hoạt động như thế nào?
Java Program to find the number of occurrences of a given number using Binary Search approach
Java Program to Implement Gale Shapley Algorithm
Introduction to the Java NIO2 File API
Java Program to Implement the Bin Packing Algorithm
Converting Strings to Enums in Java
Examine the internal DNS cache
Dynamic Proxies in Java
Spring Cloud – Adding Angular
A Guide to HashSet in Java
Java 14 Record Keyword
Tránh lỗi NullPointerException trong Java như thế nào?
Extract network card address
Quick Guide to Spring MVC with Velocity
A Guide to Queries in Spring Data MongoDB