Efficient Netlist Comparison Using Hierarchy and Randomization

Programs to compare the layout of ICs with their schematics have recently appeared. These programs have limited functionality and require large amounts of CPU time. We discuss the implementation of a fast [&Ogr;(<italic>n</italic>(log <italic>n</italic>)<supscrpt>2</supscrpt>)] logic comparison algorithm which uses hierarchy and randomization. This algorithm handles swappable components without performance degradation and is extremely robust in the presence of input errors. We include experimental data.