|
Viewing Issue Simple Details
[ Jump to Notes ]
|
[ View Advanced ]
[ Issue History ]
[ Print ]
|
|
ID |
Category |
Severity |
Reproducibility |
Date Submitted |
Last Update |
|
0000091 |
[ALGLIB] Fast transforms |
feature |
N/A |
2009-07-24 12:52 |
2009-07-27 14:20 |
|
|
Reporter |
SergeyB |
View Status |
public |
|
|
Assigned To |
SergeyB |
|
Priority |
normal |
Resolution |
implemented |
|
|
Status |
resolved |
|
Product Version |
|
|
|
Summary |
0000091: IMPLEMENTED: Fast real convolution |
|
Description |
Circular and non-circular fast real 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. |
|
Additional Information |
|
|
|
Programming language |
Unspecified |
|
|
Attached Files |
|
|
|
Relationships 
