Abstract:
Currently, Auto-routing algorithms on Printed Circuit Boards (PCB) have been the focus
of many researchers such as escape routing, length matching and shortest part. However the PCB
routing is still being designed manually because there are too many boundary pins on electronic
devices or components. To compensate for this problem, the author researching this dissertation
proposes a new technique to generate guidelines for boundary pins routing processes called Pin
Set Sequence (PSS). This proposed technique uses a new algorithm for selections and guidelines
to generate routing by pin assignment to form and make the set of sequences using Cartesian
Product. Therefore this set of sequences can generate routing guidelines and show a sequence of
pin couples in another layer on the circuit board. To summarise total score of circuit complexity,
the author has simulated the complex circuit and evaluated total layer of circuit board and
operating time of calculation process in millisecond unit. The experimental results demonstrate
that PSS is possible for sequential pairing process, especially the operating time of PCB routing
which is decreased more than 50%. Moreover, it does not affect to the design and it can be
applied to actual auto-routing processes.