An Algorithm for the Synthesis of Large Sequential Switching Circuits

Le résumé fourni par la source

With the development and widespread use of large digital computers, which are switching circuits, there has been an increasing interest in switch ing circuit theory. Much effort has been spent in designing or synthesizing switching circuits, but unfortunately many of the procedures now in use are more of an art than a science in that much insight and experience are usually required on the part of the designer. Some systematic de sign methods have been introduced but these are only applicable to rather small circuits. This thesis develops and presents an algorithm for synthesizing asynchronous sequential switching circuits. The algorithm has certain properties which make it useful and applicable to large switching circuits such as the control unit of a digital computer. The steps in the algorithm are systematic and simple permitting a solution to be obtained in a relatively short amount of time. The resulting design is not optimum in that the circuit has the minimum number of states or minimum amount of logic. (Author)

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.