Ticket #726 (closed: fixed)

Opened 11 years ago

Last modified 5 years ago

Create a FFT algorithm

Reported by: Nick Draper Owned by: Roman Tolchenov
Priority: minor Milestone: Iteration 18
Component: Keywords:
Cc: Blocked By:
Blocking: Tester:

Description

to do fast fourier transforms. QTIPlot has some code that does this, we should be able to crib.

Spencer Howels wants to be able to get at the real and imaginary parts.

Change History

comment:1 Changed 11 years ago by Roman Tolchenov

(In [2728]) Added the fast Fourier Transform algorithm + small changes to ParameterMap. re #726

comment:2 Changed 11 years ago by Roman Tolchenov

(In [2765]) FFT assumes now that the x axis origin is in the centre of the spectrum at the bin with index i = nomberOfBins/2. re #726

comment:3 Changed 11 years ago by Roman Tolchenov

(In [2767]) FFT test. re #726

comment:4 Changed 11 years ago by Roman Tolchenov

  • Status changed from new to closed
  • Resolution set to fixed

comment:5 Changed 5 years ago by Stuart Campbell

This ticket has been transferred to github issue ​1574

Note: See TracTickets for help on using tickets.