<div>
I am using an implementation very similar to <a href="https://github.com/xcore/sc_dsp_transforms/blob/master/module_fft_simple/src/fftcomplex.xc" rel="ugc">https://github.com/xcore/sc_dsp_transforms/blob/master/module_fft_simple/src/fftcomplex.xc</a><br />
<br />
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.
</div>


I am using an implementation very similar to https://github.com/xcore/sc_dsp_transforms/blob/master/module_fft_simple/src/fftcomplex.xc [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.

<div>
It is possible. &nbsp;Whether a given implementation offers such a possibility depends on the implementation.
</div>


It is possible.  Whether a given implementation offers such a possibility depends on the implementation.

<div>
I understand.<br />
<br />
Question as stated is considered answered.<br />
<br />
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)?
</div>


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)?

<div>
<div class="content wysiwyg-content">
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.<br />
<br />
Thus it would be trivial to calculate the second half, given the first half.<br />
<br />
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?
</div>
</div>


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?

Calculate only first half of IFFT

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

Algorithms

The Math / Science topic primarily includes discussions of mathematics, physics, statistics and economic analysis, but also biology, chemistry and other sciences.