Abstract
A new algorithm for channel routing is presented which addresses the special problems of bit-slice architectural assembly, namely the broadcasting and cascading of signals through layout slices. This is achieved by end-on abutment of channels. The method, used in the bit-slice assembler Slicesyn, is based on a heuristic approach using graph theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have