Solved

Calculate only first half of IFFT

Posted on 2014-11-20
6
133 Views
Last Modified: 2015-02-02
When calculating the inverse fourier transform using IFFT on a data set where all phases are 0 you obtain a waveform that is symmetrical - the first half of the waveform is the same as the second half mirrored and inverted.

Thus it would be trivial to calculate the second half, given the first half.

Given these conditions, is it possible to calculate IFFT in a way that generates only the first half of the output data in order to reduce computation time?
0
Comment
Question by:JasonMewes
  • 2
  • 2
6 Comments
 
LVL 84

Accepted Solution

by:
ozo earned 500 total points
ID: 40455125
Are you now calculating it in a way that prevents you from generating only the first half?
Can you do only a sin transform and ignore cosine?
0
 

Author Comment

by:JasonMewes
ID: 40455260
I am using an implementation very similar to https://github.com/xcore/sc_dsp_transforms/blob/master/module_fft_simple/src/fftcomplex.xc

I cannot see a straight forward way to modify the algorithm for the purpose described, but given your response I assume it should be possible.
0
 
LVL 84

Expert Comment

by:ozo
ID: 40455287
It is possible.  Whether a given implementation offers such a possibility depends on the implementation.
0
 

Author Comment

by:JasonMewes
ID: 40455364
I understand.

Question as stated is considered answered.

Any chance though you would consider looking at the linked algorithm and give me a pointer in the right direction (knowing macs is multiply accumulate)?
0

Featured Post

Free Tool: Port Scanner

Check which ports are open to the outside world. Helps make sure that your firewall rules are working as intended.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Title # Comments Views Activity
algorithm 15 116
Math question 3 97
Auto Adjust Percent rate 5 56
Understanding factorial 4 19
Okay. So what exactly is the problem here? How often have we come across situations where we need to know if two strings are 'similar' but not necessarily the same? I have, plenty of times. Until recently, I thought any functionality like that wo…
Prime numbers are natural numbers greater than 1 that have only two divisors (the number itself and 1). By “divisible” we mean dividend % divisor = 0 (% indicates MODULAR. It gives the reminder of a division operation). We’ll follow multiple approac…
Although Jacob Bernoulli (1654-1705) has been credited as the creator of "Binomial Distribution Table", Gottfried Leibniz (1646-1716) did his dissertation on the subject in 1666; Leibniz you may recall is the co-inventor of "Calculus" and beat Isaac…
Finds all prime numbers in a range requested and places them in a public primes() array. I've demostrated a template size of 30 (2 * 3 * 5) but larger templates can be built such 210  (2 * 3 * 5 * 7) or 2310  (2 * 3 * 5 * 7 * 11). The larger templa…

861 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question