Description: Implementation of both the use of FFT polynomial multiplication algorithms. Input file: the first act (n-1) the second act of the first polynomial coefficient sequence of the third act of the second polynomial coefficient sequence coefficient sequence format: an, an-1, an-2, ..., a1, a0 output file: result5.txt format for the results of polynomial coefficient sequence. Sequence format: an, an-1, an-2, ..., a1, a0 (the n with the input of the n different)
File list (Check if you may need any files):
data5.dat
FFT.c
FFT.h
main.c
Download