Mitchell P. Marcus

Minimization of the Partially-Developed Transfer Tree

A transfer tree is a particular type of multiterminal network having a single input which may be connected to any one of a number of outputs. An n-relay transfer tree is partially developed if it has less than the 2n possible output terminals. Rearrangement of a partially-developed tree can lead to a reduction in the total number of transfers required. This paper presents a method of obtaining a required partially-developed transfer tree with the minimum number of transfers.

Cascaded Binary Counters with Feedback

A simple general method for analyzing any given cascaded binary counter feedback configuration is presented. The count can be determined directly from the diagram without the need of writing equations of any form. The synthesis of cascaded binary counter feedback configurations is also discussed, and a table of feedback configurations with the minimum number of feedback connections is presented.

S-R-T Flip-Flop

Two different definitions for the operating characteristics of the S-R-T flip-flop exist in the literature. These two definitions are discussed, and it is argued that one definition is unnecessarily restrictive while the second is not only more logically correct but leads to more economical circuitry.