w4kek/WSJT-X
1
0
Fork 0
mirror of https://github.com/saitohirga/WSJT-X.git synced 2024-11-21 19:55:20 -05:00
Code Issues Packages Projects Releases Wiki Activity

Some final(?) tweaks and additions to the chkfft mini-package.

Browse Source 
git-svn-id: svn+ssh://svn.code.sf.net/p/wsjt/wsjt/branches/wsjtx@4838 ab8295b8-cf94-4d9e-aec4-7959e3be5d79
This commit is contained in:
Joe Taylor 2014-12-18 21:06:21 +00:00
parent c628013582
commit d338885098
3 changed files with 2077 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2069
lib/all_fft.out Normal file
View File

File diff suppressed because it is too large Load Diff

2
lib/chkfft.f90
View File

@ -71,7 +71,7 @@ program chkfft
if(list .or. (nfft.gt.0)) then
n1=1
n2=1
if(nfft.eq.0) n2=999999
if(nfft.eq.-1) n2=999999
write(*,1020)
1020 format(' NFFT Time rms MHz MFlops iters', &
' tplan'/61('-'))

10
lib/chkfft.txt
View File

@ -114,7 +114,11 @@ standard deviation 1. Tabulated values of "rms" are the
root-mean-square differences between the original data and the
back-transfmred data.
File nfft.dat contains all numbers between 2^3 and 2^23 that have
no factor greater than 7, followed by their factors. These numbers
are good choices for FFT lengths.
File nfft.dat contains all numbers between 2^3 and 2^23 with no factor
greater than 7, followed by their factors. These numbers are good
choices for FFT lengths. File all_fft.out gives the result on one
machine of running the command
$ chkfft nfft.dat 0 1 1 2
Take note: this task may take as much as 24 hours, or even more!