This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Andre Thayse, Philips Research Laboratory, Brussels, Belgium
This paper considers the realization of switching functions by programs composed of certain conditional transfers (binary programs). Methods exist for optimizing binary trees, i.e., binary programs without reconvergent instructions. This paper studies methods for optimizing binary simple programs (programs with possible reconvergent instructions, but where a variable may be tested only once during a computation) and binary programs. The hardware implementations of these programs involve either multiplexers or demultiplexers and OR-gates.
Index Terms:
software description,Binary decision programs or diagrams,hardware description languages,hardware realization of switching functions
Citation:
Andre Thayse, "P-functions: A new tool for the analysis and synthesis of binary programs," IEEE Transactions on Computers, vol. 30, no. 2, pp. 126-134, Feb. 1981, doi:10.1109/TC.1981.6312175
Usage of this product signifies your acceptance of the Terms of Use.