I am writing a personal software that will read circuit design/ netlist. I will be using the MCNC benchmarks that contain different types of designs in SPICE netlist format. I need some pointers/papers/suggestions on creating a "hierarchical" netlist database. The netlist database can, at times, be fully flattened, partially flattened or fully hierarchical. I should be able to answer queries like: are there any capacitors connected to node: x1.x2.n1? My program is currently only for analyzing designs for connectivity, types of elements (resistors/capacitors) and figuring out some simple electrical properties. I am just starting, so please bear with me if I haven't thought about corner cases. Regards Nick Other posts:
• The Twin Paradox Embodied on a Hard Drive? The hard thinks it has met
it's twin but is taking in information from the Internet to see it's
reflection
• most common algorithms and design patterns ... • 1.Asku algorithm • If the Internet consists of connected machines, provided there exists 'Virtual Machines' provide therefore the existence of 'Virtual Internets' • Arches and galleries • Implementation suggestions for creating a Hierarchical circuit database • P Versus NP Resolutions Abounding? • Coding in Real Time While Melding Reality • Infinitely many primes of the form p=6k-1. • Fast Fourier Solutions • The Blank Algorithm |