In this paper, we implement line probe routing algorithm (LPRA) to solve SOC routing issues. Two modules in LPRA named replace procedure and escape process. The former aims to normalize line for various lengths and the latter generate and insert escape points between source and destination point for routing. Two useful functionality, complex rate and the number of vertex, are developed for various SOC applications. To improve the routing performance, LPRA reduce the memory requirement than Lee's algorithm. Finally, two routing examples and five test cases are used to demonstrate the feasibility for the proposed LPRA.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com