Viewing Issue Simple Details
[ Jump to Notes ]
|
[ View Advanced ]
[ Issue History ]
[ Print ]
|
ID |
Category |
Severity |
Reproducibility |
Date Submitted |
Last Update |
0000092 |
[ALGLIB] Fast transforms |
feature |
N/A |
2009-07-24 12:59 |
2009-08-30 19:57 |
|
Reporter |
SergeyB |
View Status |
public |
|
Assigned To |
SergeyB |
Priority |
normal |
Resolution |
implemented |
|
Status |
resolved |
|
Product Version |
|
|
Summary |
0000092: IMPLEMENTED: fast complex cross-corrrelation |
Description |
Circular and non-circular fast complex cross-corrrelation.
FFT-based algorithm with O(N*logN) complexity for any N (composite or prime) is used to calculate general length corrrelations. 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-save algorithm is used. |
Additional Information |
|
|
Programming language |
Unspecified |
|
Attached Files |
|
|