misc

argmax.m

 function j = argmax(L)
 % ARGMAX Index j of the maximum value in L.
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
  
-[~,j] = max(L);
\ No newline at end of file
+[~,j] = max(L);

binaryfilter.m

@@ -18,6 +18,9 @@ function [b,h] = binaryfilter(f,f0,P,a0)
 % Output:
 %     b  - Bessel-weighted matched filter
 %     h  - Comb matched filter (not used in the current search)
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 c = 2*pi*a0*f0;
 % Take a wider range [-N N] for calculation (100 is a random extended width for c)

readfstats.m

@@ -19,6 +19,9 @@ function [f, X, N, T] = readfstats(dirName, bandIdx, steps)
 %     X         - F-stat values
 %     N         - Total number of bins
 %     T         - Total number of steps
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 X = [];
 for n = 1:steps

run_search.m

@@ -24,6 +24,9 @@ function run_search(bandIdx,bandOffset,fstatdir,outfile,a0median,a0uncert,a0delt
 %
 % Output:
 %     Save results to the specified output file.
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 format long g
 

viterbi_colFLT.m

@@ -16,7 +16,10 @@ function [path,delta,psi,score] = viterbi_colFLT(M, obslik)
 %                  and then go to state j
 %     psi(j,t)   - The best predecessor state, given that it ends up in state j at t
 %     score      - Number of standard deviations above the mean value of log 
-%                  likelihood of paths to all the states at the final step       
+%                  likelihood of paths to all the states at the final step
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 % If M is even, increase M by 1
 if round(M/2)==M/2