The Synthesis of Cascade Switching Circuits.

Roger Eli Levien

ResearchPublished 1962

A consideration of the problem of synthesizing switching circuits that compute completely specified switching functions. A restricted class of algorithms--the cascade algorithms--is defined, and it is shown that many classes of switching circuits are realizations of such algorithms. Algorithm synthesis techniques are introduced that may be used to synthesize collapsed-tree, iterative, multiple-iterative, sequential, and cascaded-sequential switching circuits. The procedures may be executed by a digital computer

Document Details

Citation

Chicago Manual of Style

Levien, Roger Eli, The Synthesis of Cascade Switching Circuits. Santa Monica, CA: RAND Corporation, 1962. https://www.rand.org/pubs/research_memoranda/RM3269.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.