David A. Huffman
- 1 SHANNON, C. E., A Symbolic Analysis of Relay and Switching Circuits, A.LE.E. Trans. actiona, 59 (1938), 713-722. ~, The Synthesis of Two-Terminal Switching Circuits, Bell System Technical Journal, 28, Jan. 1949.Google Scholar
- 2 STAFF OF THE COMPUTATION LABORATORY, The Synthesis of Electronic Computing and Control Circuits, Harvard University Press., Cambridge, Mass., 1951.Google Scholar
- 3 KEISTER, W., RITCHXE, A. E., and WASHBURN, S. H., The Design of Switching Cireuils, D. Van Nostrand Co., Inc., New York, 1951, 151-171.Google Scholar
- 4 HUFF~_N, D. A., The Synthesis of Sequential Switching Circuits, Journal of the Franklin Institute, 257, nos. 3 and 4, March and Apr. 1954, 294--295.Google Scholar
- 5 K.ARNA~GH, M., The Map Method for Synthesis of Combinational Logic Circuits, A.I. E.E. Technical Paper $53-217, Apr. 1953.Google Scholar
- 6 HUFFMAN, D. A., A Study of the Memory Requirements of Sequential Switching Circuits, Technical Report $ 293, Research Lab. of Electronics, Mass. Inst. of Tech., Apr. 1955.Google Scholar
- 7 BETER, R. H., BRAnL~Y, W. E., BROWN, R. H., and RU~INOFF, M., Surface-Barrier Transistor Switching Circuits, I.R.E. Convention Record, part 4, March, 1955, 139-145.Google Scholar
- 8 QUXNE, W. V., The Problem of Simplifying Truth-Functions, Amer. Math. Monthly, 59, Oct., 1952.Google Scholar
Index Terms
- The Design and Use of Hazard-Free Switching Networks
Recommendations
On the complexity of hazard-free circuits
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingThe problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded ...
On the Complexity of Hazard-free Circuits
Networking, Computational Complexity, Design and Analysis of Algorithms, Real Computation, Algorithms, Online Algorithms and Computer-aided VerificationThe problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded ...
PLA based synthesis and testing of hazard free logic
VLSID '95: Proceedings of the 8th International Conference on VLSI DesignThis paper presents a divide and conquer approach for the hazard-free realization of combinational networks. The circuit is partitioned into a set of supergates which are individually made hazard-free. Since each supergate has to be implemented in two-...
Comments