fe_var6

快速傅立叶变换程序代码,学信号的同学,可要注意了

# fe variables
#
# file to be read by commander.p
# each line is turned into a structure entry   	(str)
#     	a default-setting entry			(def)
#     	a usage-printing entry			(usg)
# 	and a command line reading entry	(clr)
# of these, the S, U and C can be disabled by >No S, etc.
# and the D can be disabled by -.
#
# variable    		type deflt flag  short_name extra_action long_name
#
c->gamma		d	-1 -gamma gamma		-	Power that modifies E_L to discourage violations if set to 0,1,2
>No CU
c->dgamma		f	-	-	-	-	(double) (gamma)
> CU
c->metric		d	1  -metric m(0/1)	-	Whether to include the q(1-q) factor in the gradient
c->writelog		d	0	-log	l	-	write every value of x at which function is evaluated. First l components.
c->logfile		s	-	-logfile file   -	file for log
>No S
c->macarg.stepmax	f     0.1  -o5smax step 	-	max step size, optimizer 6 (not 5)
>S
c->second		d	0 -second 0/1 		-	whether to use 2nd backup strategy
c->third		d	0 -third 0/1		-	whether to use a third
# if there are multiple runs with different settings, some things 
#   stay the same:
>No CU
c->init_given	d	0 - - - whether an initial condition has been given in the accompanying fe_min_param
>CU
c->sdx		f	0 -sdx sdx - initial standard deviation
c->verbose	d	0 -fv fv   - - 
c->seqverbose	d	0 -sv sv   - - 
c->CG		d	0 -fcg cg  - check gradient
c->outappend	d	1 -oappend (0/1) - whether to append to the outfile; if this is zero, then it is overwritten every time instead
c->outfile	s	- -o outfile if(!(c->printout))c->printout=1; write reports to this file
>No CU
c->printout	d	0 -    -   -  -
>CU
# added feb 96
c->totoutfile	s	- -to totoutfile if(!(c->printtot))c->printtot=1;  write totals to file
c->histofile   s       - -ho histofile if(!(c->printhisto))c->printhisto=1; histogram of stop times
>No CU
c->printtot     d       0 -    -   -  -
c->printhisto   d       0 -    -   -  -
>CU
c->seed		ld	135 -fseed fseed - used for randomization of the initial condition of the optimization
c->epsilon	f	0.0001 -e epsilon - for cg
c->DEMO		d	0 -fdemo demo - - 
c->NORDER	d	0 -norder norder - (for seqopt - 0/1/2 = 1..N / random / suspicion )
c->betap	f	1.0  -betap betap	- prior's beta
# and some things change
>No CU
c->beta0	f	1.0 - - - - 
c->beta1	f	1.0 - - - - 
c->betastyle	d	0   - - - - - 
>CU 
>PU DNT; printf(" if annealing is used then ");
>PU DNT; printf(" beta goes from beta0 to beta1 by uniform steps ");
>PU DNT; printf(" either arithmetic or geometric");
>No CU
c->betaf	f 	1.0 - - - - 
c->nl		d	0 - - - - 
>CU
c->NL		d	1 -nl loops - Number of loops. (annealing happens within these)
c->rich		d	0 -rich rich - - 
c->opt		d	3 -opt opt - seq_opt is 3 ; no other supported? (0=frp,1=macopt,2=jumpopt,3=seqopt,4=?,5=strangeopt,6=creepy)
>No CU
c->iter		d 	0 - - - -
>CU
c->itmax	d	100 -itmax itmax - num of linmins or jumps per optimization
c->ftol		f	0.0001	-ftol	ftol     - - 
c->flintol	f	0.001	-flintol flintol - -
c->seq_period	d 	10	-seqp seqp - how frequently the free energy is evaluated to decide whether to stop the sequential optimizer 
>No CU
c->zero_temperature d 0 - - - whether we are at zero temperature, in which case, the entropy and prior are ignored, and only the likelihood term is evaluated
c->mega_needed 	d	0 - - whether mega probability structure created
>CU