DOI: 10.17587/prin.15.115-124

Compilation of Hierarchical Transistor Circuits in SPICE Format

D. I. Cheremisinov, Leading Researcher, cher@newman.bas-net.by, L. D. Cheremisinova, Chief Researcher, cld@newman.bas-net.by, The United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk, 220012, Republic of Belarus

Corresponding author: Liudmila D. Cheremisinova, Chief Researcher, The United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk, 220012, Republic of Belarus, E-mail: cld@newman.bas-net.by

Software tools for compiling and decompiling descriptions of transistor circuits are widely used in computer-aided VLSI design. These two operations are inverse to each other in terms of guiding the design process. Netlist compiling a hierarchical schematics allows its specification to be converted into a functionally equivalent flat netlist. The goal of the decompilation is to reconstruct the hierarchical description of the circuit by extracting subcircuits that are gates or more complex elements. This paper examines the problem of compiling hierarchical MOS transistor circuits. The initial hierarchical schematic and resulting flat netlist are specified in SPICE format. A fast recursive algorithm for compilation of hierarchical descriptions of arbitrary nesting depth and its software implementation in C++ are proposed. During the compilation process, the ports of the circuit substituted in place of the component being compiled are renamed, as well as the names of internal nets and elements in the description of the circuit itself by adding a prefix to them that specifies the path in the hierarchy to the component being compiled. The developed compilation program was tested on a number of practical hierarchical transistor circuits as part of a transistor circuit analyzer for functional equivalence. The results of the compilation program tests make it possible to evaluate the increase in compilation time with increasing complexity of circuits and the depth of subcircuits nesting, as well as to compare the performance of the compilation procedure and its inverse procedure of decompiling the resulting flat netlist.

Keywords: compilation of hierarchical circuits, decompilation, CMOS circuit, SPICE format, hierarchy elimination

pp. 115–124

For citation:
Cheremisinov D. I., Cheremisinova L. D. Compilation of Hierarchical Transistor Circuits in SPICE Format, Programmnaya Ingeneria, 2024, vol. 15, no. 3, pp. 115—124. DOI: 10.17587/prin.15.115-124 (in Russian).

References:

• Cheremisinov D. I., Cheremisinova L. D. Extracting a Logic Gate Network from a Transistor-Level CMOS Circuit, Russian Microelectronics, 2019, vol. 48, no. 3, pp. 187—196. DOI: 10.1134/ S106373971903003X.
• Yang L., Shi C-J. R. FROSTY: A program for fast extraction of high-level structural representation from circuit description for industrial CMOS circuits, Integration the VLSI Journal, 2006, vol. 39, no. 4, pp. 311—339. DOI: 10.1016/j.vlsi.2005.07.002.
• Baker R. J. CMOS Circuit Design, Layout, and Simulation, Wiley-IEEE Press, 2010 (Third Edition), 1214 p.
• Jones L. G. Fast batch incremental netlist compilation of hierarchical schematics, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 1991, vol. 10, no. 7, pp. 922—931. DOI: 10.1109/43.87602.
• Diss W. C. Circuit compilers don't have to be slow, DAC'88: Proc. of the 25th ACM/IEEE, Design Automation Conference (Anaheim, CA, USA), 12—15 June 1988, pp. 622—627.
• Kirienko N. A. Podsistema obrabotki strukturno-funkcional'ny'x opisanij sxem v sisteme avtomatizirovannogo proektirovaniya, Problemy razrabotki perspektivnyh mikro- nanoelektronnyh system, 2008, Sb. trudov / pod obshch. red. akad. RAN A. L. Stempkovskogo, Moscow, IPPM RAN, 2008, pp. 215—220 (in Russian).
• Kirienko N. A. Elimination of the hierarchy of transistor descriptions of logical circuits, Informatsionnyye tekhnologii i siste-my, 2019, Materialy mezhdunar. nauch. konf. (Respublika Belarus, Minsk, 30 Okt. 2019), Minsk, BSUIR, 2019, pp. 136—137 (in Russian).
• Cheremisinov D. I. Element search and adjustment in hash tables, Algoritmy resheniya logiko-kombinatornykh zadach, 1975, Sb. trudov, Minsk, ITK AN BSSR, 1975, рр. 90—99 (in Russian).
• Knuth D. E. The Art of Computer Programming. Volume 3: Sorting and Searching, Addison Wesley Longman Publishing Co., Inc., 1998 (2nd Ed.), 780 p.
• Bartlett J. Mastering recursive programming, 2005, available at: https://developer.ibm.com/articles/l-recurs/ (updated 26.04.2017).