Minimization of the Partially-Developed Transfer Tree
- 1 June 1957
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-6 (2) , 92-95
- https://doi.org/10.1109/TEC.1957.5221577
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- The map method for synthesis of combinational logic circuitsTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1953
- A chart method for simplifying truth functionsPublished by Association for Computing Machinery (ACM) ,1952
- Relay "trees" and symmetric circuitsTransactions of the American Institute of Electrical Engineers, 1949