Issue No.09 - September (1970 vol.19)
W.H. Kautz , IEEE
Faults can be circumvented in one-dimensional cellular arrays simply by switching out (bypassing) the defective cells in the cascade. In this note, the problem is solved of finding the minimal network of switches capable of bypassing up to q possibly defective cells from an n-celled array. The cells may be combinational or sequential, unilateral or bilateral, and may employ digital or continuous signals. It is shown that the minimum number N(n, q) of switches required equals ?(q+1)(2n-q+2) for the case when added internal circuit nodes are disallowed, or when q=1, and equals 3n otherwise.
Cellular logic, fault avoidance, iterative arrays, redundant networks, switching circuits.
W.H. Kautz, "Bypass Switching for Cellular Cascades", IEEE Transactions on Computers, vol.19, no. 9, pp. 837-839, September 1970, doi:10.1109/T-C.1970.223050