A STUDY OF HAZARDS IN THRESHOLD NETWORKS.
TEXAS UNIV AT AUSTIN LABS FOR ELECTRONICS AND RELATED SCIENCE RESEARCH
Pagination or Media Count:
This paper is concerned with the study of logic hazards in threshold gate networks. Eichelberger has proved that logic hazards are not present in a sum-of-product product-of-sum realization which realizes all of the possible 10 prime implicants of the given Boolean function. Logic gates of the AND or NOR OR or NAND variety realize single 10 prime implicante, therefore, a gate is required for each 10 prime implicant to be realized and the problem of eliminating logic hazards is straightforward. A single threshold gate, however, realizes a number of prime implicants. Moreover, the number of prime implicants realized by a network that incorporates more than a single threshold gate is not uniquely determined either by the Boolean function being realized or by the number of gates involved. As a result, it is often possible to control the prime implicants and hence the hazards without increasing the number of gates required. A method is first presented for determining if a given threshold realization contains any logic hazards within a particular prime implicant. Author
- Electrical and Electronic Equipment