bndi_var

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

# bndi 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
#
>PU NLNE; printf(" Iterates the bn decoding rule for an infinite loopless ") ;
>PU NLNE; printf(" belief network\n") ;
c->t			d	4 	-t t		- number per column
c->tr			d	8 	-tr tr 		- number per row
c->verbose 		d 	0 	-v verbose 	- verbose
c->f			f	0.05 	-f f		- noise level
c->loops		d	20	-l loops	- number of iterations
c->N			d	100	-n N		- number of states to keep
c->seed			ld	123	-seed seed	- seed
c->write_entropy	d	1	-we  we		- write entropy
c->write_state		d	1	-ws  ws		- write state vectors
c->write_period_a	d	1	-wpa p		- period for writing state until enda
c->write_enda		d	10	-enda e		- enda
c->write_period_b	d	10	-wpb p		- period for writing state until ...
c->write_endb		d	10	-endb e		- endb (no function)
c->hlim			f	0.0	-hlim lim	- zero point for entropy---terminates iteration
c->shannon_check	d	1	-sh sh		- whether to check that we are not attepting to decode beyond shannon limit 
>No CU
c->h			f	-	-	-	- -
c->h_non_zero		d	1	- 	- 	- -
c->efile		s	- 	-ef efile	- -
c->statefile		s	- 	-sf statefile	- -
c->loop			d	1	- 	-	- loop number
c->friends		d	0	-	-	- number of friends in each relationship = tr-1
c->up_rels		d	0	-	-	- number of relationships up the tree = t-1
c->tot_friends		d	0	-	-	- total number of friends up tree
>CU