Cellular Interconnection Arrays
William H. Kautz, Karl Levitt, Abraham Waksman · IEEE Transactions on Computers · 1968
Abstract—A class of networks is described that has the capability of permuting in an arbitrary manner a set of n digital input lines onto a set of n digital output lines. The circuitry of the networks is arranged in cellular form, i. e., in a two-dimensional iterative pattern with mainly local intercell connections, where the basic cell behaves as a reversing switch with a single memory flip-flop. Various network forms are described, differing in the number of cells needed, in the shape of the array, and in the length and regularity of intercell connections. Also discussed are some ways of setting up the array to achieve a desired permutation.
Cited by 93 works. doi:10.1109/tc.1968.226908
Authors
References
- On the Synthesis of Signal Switching Networks with Transient Blocking
- A Study of Non-Blocking Switching Networks
- Mathematical Theory of Connecting Networks and Telephone Traffic
- A Permutation Network
- Mathematical Theory of Connecting Networks and Telephone Traffic.
- Testing for faults in combinational cellular logic arrays
- A Sorting Problem
- A study of the data commutation problems in a self-repairable multiprocessor