| commit | 3df43eb0f0a9c3c826eaa330a4099e0024f49f8d | |
| author | Dennis Francis <dennis.francis@collabora.com> | |
| Sun, 24 Feb 2019 12:44:20 +0000 (24 18:14 +0530) | ||
| committer | Dennis Francis <dennis.francis@collabora.com> | |
| Sun, 24 Feb 2019 14:20:15 +0000 (24 15:20 +0100) | ||
| tree | 87d6492c6dd7533f6aa18b913127aa54e7680c78 | treesnapshot (tar.gz zip) |
| parent | 460e5fb43c14ee7caf913a7592ed1a346cbf9af8 | commitdiff |
tdf#74664 : Unit test for FOURIER formula
This adds test cases for N(data length) in {1, 2, 4, 32}.
This tests real and complex input cases. It also tests polar and
non-polar output case. The reference(expected) numbers were obtained
using fft() of Matlab R2018b. Finally the inverse transform is
compared is compared with original inputs for correctness.
No tests are there for non powers of 2 data length cases yet as
the implementation is going to change for such cases to behave
exactly like Matlab/Octave.
Change-Id: I580e70c0e30a8bc4a5d388aaa522e4583283be67
Reviewed-on: https://gerrit.libreoffice.org/68285
Tested-by: Jenkins
Reviewed-by: Dennis Francis <dennis.francis@collabora.com>
This adds test cases for N(data length) in {1, 2, 4, 32}.
This tests real and complex input cases. It also tests polar and
non-polar output case. The reference(expected) numbers were obtained
using fft() of Matlab R2018b. Finally the inverse transform is
compared is compared with original inputs for correctness.
No tests are there for non powers of 2 data length cases yet as
the implementation is going to change for such cases to behave
exactly like Matlab/Octave.
Change-Id: I580e70c0e30a8bc4a5d388aaa522e4583283be67
Reviewed-on: https://gerrit.libreoffice.org/68285
Tested-by: Jenkins
Reviewed-by: Dennis Francis <dennis.francis@collabora.com>
| sc/qa/unit/data/functions/array/fods/fourier.fods | [new file with mode: 0644] | blob |