article

Free access

The Design and Use of Hazard-Free Switching Networks

Author:

David A. HuffmanAuthors Info & Claims

Journal of the ACM (JACM), Volume 4, Issue 1

Pages 47 - 62

https://doi.org/10.1145/320856.320866

Published: 01 January 1957 Publication History

PDF eReader

References

[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

Cited By

View all

Jukna S(2021)Notes on Hazard-Free CircuitsSIAM Journal on Discrete Mathematics10.1137/20M135524035:2(770-787)Online publication date: 13-Apr-2021
https://doi.org/10.1137/20M1355240
Kushnerov AMedina MYakovlev A(2021)Towards Hazard-Free Multiplexer Based Implementation of Self-Timed Circuits2021 27th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)10.1109/ASYNC48570.2021.00011(17-24)Online publication date: Sep-2021
https://doi.org/10.1109/ASYNC48570.2021.00011
Buecherl LRoberts RFontanarrosa PThomas PMante JZhang ZMyers C(2021)Stochastic Hazard Analysis of Genetic Circuits in iBioSim and STAMINAACS Synthetic Biology10.1021/acssynbio.1c0015910:10(2532-2540)Online publication date: 4-Oct-2021
https://doi.org/10.1021/acssynbio.1c00159
Show More Cited By

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 Computing

The 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 Verification

The 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 Design

This 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

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of the ACM Volume 4, Issue 1

Jan. 1957

92 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/320856

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1957

Published in JACM Volume 4, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

92
Total Citations
View Citations
1,818
Total Downloads

Downloads (Last 12 months)397
Downloads (Last 6 weeks)42

Reflects downloads up to 31 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jukna S(2021)Notes on Hazard-Free CircuitsSIAM Journal on Discrete Mathematics10.1137/20M135524035:2(770-787)Online publication date: 13-Apr-2021
https://doi.org/10.1137/20M1355240
Kushnerov AMedina MYakovlev A(2021)Towards Hazard-Free Multiplexer Based Implementation of Self-Timed Circuits2021 27th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)10.1109/ASYNC48570.2021.00011(17-24)Online publication date: Sep-2021
https://doi.org/10.1109/ASYNC48570.2021.00011
Buecherl LRoberts RFontanarrosa PThomas PMante JZhang ZMyers C(2021)Stochastic Hazard Analysis of Genetic Circuits in iBioSim and STAMINAACS Synthetic Biology10.1021/acssynbio.1c0015910:10(2532-2540)Online publication date: 4-Oct-2021
https://doi.org/10.1021/acssynbio.1c00159
Komarath BSaurabh N(2020)On the complexity of detecting hazardsInformation Processing Letters10.1016/j.ipl.2020.105980(105980)Online publication date: Jun-2020
https://doi.org/10.1016/j.ipl.2020.105980
Ikenmeyer CKomarath BLenzen CLysikov VMokhov ASreenivasaiah K(2019)On the Complexity of Hazard-free CircuitsJournal of the ACM10.1145/332012366:4(1-20)Online publication date: 23-Aug-2019
https://dl.acm.org/doi/10.1145/3320123
Bund JLenzen CMedina M(2019)Optimal Metastability-Containing Sorting via Parallel Prefix ComputationIEEE Transactions on Computers10.1109/TC.2019.2939818(1-1)Online publication date: 2019
https://doi.org/10.1109/TC.2019.2939818
Ikenmeyer CKomarath BLenzen CLysikov VMokhov ASreenivasaiah KDiakonikolas IKempe DHenzinger M(2018)On the complexity of hazard-free circuitsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188912(878-889)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188912
Friedrichs SFugger MLenzen C(2018)Metastability-Containing CircuitsIEEE Transactions on Computers10.1109/TC.2018.2808185(1-1)Online publication date: 2018
https://doi.org/10.1109/TC.2018.2808185
Friedrichs SKinali A(2017)Efficient Metastability-Containing Multiplexers2017 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)10.1109/ISVLSI.2017.65(332-337)Online publication date: Jul-2017
https://doi.org/10.1109/ISVLSI.2017.65
Wang BFeng JMeng M(2017)Matrix approach to model matching of composite asynchronous sequential machinesIET Control Theory & Applications10.1049/iet-cta.2016.165111:13(2122-2130)Online publication date: 1-Sep-2017
https://doi.org/10.1049/iet-cta.2016.1651
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

On the complexity of hazard-free circuits

On the Complexity of Hazard-free Circuits

PLA based synthesis and testing of hazard free logic

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations