Fast Fourier Borland c++

  • C/++/#
  • Thread starter orstats
  • Start date
  • #1
14
0

Main Question or Discussion Point

Dear All:

I am finding that for the computational estimation that I need, I would not be able to do this in MATLAB. Is there a good tutorial that you would recommend for writing and running our own functions, such as inversion of fast fourier transforms and linear optimization, in C++?


Thanks so much!
 

Answers and Replies

  • #2
28,869
5,135
I would not recommend writing your own FFT, inversion, or linear optimization algorithms. (unless of course it is required for a class). There are lots of libraries available to do those in C++ that will probably be much better than anything you would code yourself.
 
  • #3
14
0
Ok, sounds encouraging. Which ones are they? Or is there a repository that I can look at? I am more familiar w. MATLAB. When I last programmed in C, I don't remember libraries we had access to other than the standard simple math functions. Does C++ offer more libraries then? Please kindly point where I may locate these libraries. The compiler is Borland 5.5...does that make a difference in the libraries I have available from the free download?
 
  • #4
28,869
5,135
Or is there a repository that I can look at?
Uhh, Google?

Sorry, just teasing.

I would recommend the fftw library (fastest Fourier transform in the west) for a really good set of FFT algorithms as well as being my favorite name of any library I know :smile:. For linear algebra functions probably BLAS or LAPACK++ will be sufficient. If you are running on an AMD chipset then you could look at the ACML which has BLAS, LAPACK, FFT, random number generators, and basic math functions all in one package. I am sure that Intel has a similar library, but I haven't used it.
 
Last edited:
  • #5
14
0
Thanks! I am running Intel Pentium duo-Core. I will check if they have these libraries. FFTW library won nice accolades. We are interested in the fwrd FT of this function at specific values of k. In our case, to be Fourier transformed function Xj is a complex expression that is a ratio of trig functions of i*sqrt(j). Being that my Xj is a function of the index j of the discrete summation I am not sure how this can be written as input for FFTW...
 
  • #6
14
0
FYI: Intel also has MLK...its compiler compatibility is limited to MS C++ Visual Studio and Intel C++ Compiler and GCC. No Borland it looks like.
 
  • #7
28,869
5,135
Being that my Xj is a function of the index j of the discrete summation I am not sure how this can be written as input for FFTW...
The FFT always takes an array (of complex numbers) as an input. So simply compute the value of your input function and store it in an array. It doesn't matter if computing your function involves a summation or not.
 
  • #8
28,869
5,135
FYI: Intel also has MLK...its compiler compatibility is limited to MS C++ Visual Studio and Intel C++ Compiler and GCC. No Borland it looks like.
Typical of Microsoft.
 
  • #9
Hurkyl
Staff Emeritus
Science Advisor
Gold Member
14,916
17
Typical of Microsoft.
To be fair, I recall that the Borland compilers have generally been lagging behind others in its support of more advanced C++ features.
 
  • #10
14
0
Okay, great. Which is better to download for compiler: MS C++ Visual Studio vs. Intel C++ Compiler when we're running on MS XP Duo-Core?
 

Related Threads for: Fast Fourier Borland c++

  • Last Post
Replies
3
Views
26K
  • Last Post
Replies
1
Views
3K
Replies
2
Views
2K
Replies
3
Views
4K
  • Last Post
Replies
2
Views
2K
Replies
2
Views
861
Replies
9
Views
60K
  • Last Post
Replies
5
Views
1K
Top