Mantis - ALGLIB
Viewing Issue Advanced Details
53 Fast transforms feature N/A 2009-05-18 12:22 2009-07-27 14:20
SergeyB  
SergeyB  
normal  
resolved  
implemented  
none    
none 2.1.0  
Unspecified
0000053: IMPLEMENTED: Fast complex convolution
Circular and non-circular fast complex convolution.

Transforms implemented:
* forward (convolution)
* backward (deconvolution)

FFT-based algorithm with O(N*logN) complexity for any N (composite or prime) is used to calculate general length convolutions. Two important special cases are handled differently:
* when response is very short - straightforward O(M*N) formula is used
* when responce is relatively long, but significantly sorter than signal - overlap-add algorithm is used.
Issue History
2009-05-18 12:22 SergeyB New Issue
2009-05-18 12:22 SergeyB Status new => assigned
2009-05-18 12:22 SergeyB Assigned To => SergeyB
2009-05-18 12:22 SergeyB Programming language => Unspecified
2009-05-26 09:40 SergeyB Target Version Next minor release => Next major release
2009-05-26 09:43 SergeyB Summary FEATURE: fast convolution/correlation using FFT => fast convolution/correlation using FFT
2009-07-14 21:40 SergeyB Target Version Next major release => Near future
2009-07-14 21:43 SergeyB Target Version Near future => Next major release
2009-07-23 12:33 SergeyB Category => Fast transforms
2009-07-24 12:52 SergeyB Summary fast convolution/correlation using FFT => Fast complex convolution
2009-07-24 12:52 SergeyB Description Updated
2009-07-24 12:52 SergeyB Issue cloned 0000091
2009-07-24 12:59 SergeyB Issue cloned 0000092
2009-07-27 10:49 SergeyB Status assigned => resolved
2009-07-27 10:49 SergeyB Fixed in Version => [NOT RELEASED YET] Next major release
2009-07-27 10:49 SergeyB Resolution open => implemented
2009-07-27 10:50 SergeyB Summary Fast complex convolution => IMPLEMENTED: Fast complex convolution
2009-07-27 14:20 SergeyB Description Updated

There are no notes attached to this issue.