Abstract

O b j e c t i v e s. With the increasing complexity of verification and simulation of modern VLSI, containing hundreds of millions of transistors, the means of extracting the hierarchical description at the level of logical elements froma flat description of circuits at the transistor level are becoming the main tools for computer-aided design and verification. Decompilation tools for transistor circuits can not only significantly reduce the time to perform VLSI topology check, but also provide the basis for generating test cases, logical reengineering of integrated circuits and reverse engineering to detect untrusted attachments.The objective of the work is to solve the problem of extracting the structure of the functional level from a flat circuit of the transistor level by recognizing in it subcircuits that implement logical elements.M e t h o d s. Graph based methods are proposed for solving some key problems arising at the stage of structural recognition of CMOS gates in a transistor circuit: partitioning a graph into connectivity components corresponding to transistor subcircuits; recognition of subcircuits that are logical elements, and functions implemented by them; forming a library of recognized gates and constructing two-level transistor circuit. The original flat and resulting two-level transistor circuits are presented in SPICE format.Re s u l t s. The proposed methods are implemented in C++ as a part of a transistor circuit decompilation programfor the case without any predetermined cell library. All steps of the proposed methods of structural CMOS gates recognition are performed in a linear time from the number of transistors in the initial circuit.Co n c l u s i o n. The decompilation program has been tested on practical transistor-level circuits. Experiments indicate that the present tool is fast enough to process circuits with more than a hundred thousand transistors in a few minutes on a personal computer. Currently, the authors are developing methods for recognizing more complex elements in a transistor circuit, such as memory elements.

Highlights

  • With the increasing complexity of verification and simulation of modern VLSI, containing hundreds of millions of transistors, the means of extracting the hierarchical description at the level of logical elements from a flat description of circuits at the transistor level are becoming the main tools for computer-aided design and verification

  • The objective of the work is to solve the problem of extracting the structure of the functional level from a flat circuit of the transistor level by recognizing in it subcircuits that implement logical elements

  • Graph based methods are proposed for solving some key problems arising at the stage of structural recognition of CMOS gates in a transistor circuit: partitioning a graph into connectivity components corresponding to transistor subcircuits; recognition of subcircuits that are logical elements, and functions implemented by them; forming a library of recognized gates and constructing two-level transistor circuit

Read more

Summary

Оригинальная статья Original Paper

Целью работы является решение задачи извлечения структуры функционального уровня из плоской схемы транзисторного уровня путем распознавания в ней подсхем, реализующих логические элементы. Предлагаются графовые методы решения некоторых ключевых задач, возникающих на этапе структурного распознавания КМОП-вентилей в транзисторной схеме: разбиение графа на компоненты связности, соответствующие подсхемам из транзисторов; распознавание подсхем, являющихся логическими элементами, и реализуемых ими функций; формирование библиотеки распознанных вентилей и построение двухуровневого описания транзисторной схемы. Предложенные методы реализованы на языке C++ как часть программы декомпиляции транзисторных схем для случая, когда искомая библиотека логических элементов заранее неизвестна. Все шаги предлагаемых процедур структурного распознавания КМОП-вентилей в плоской транзисторной схеме выполняются за линейное время от числа транзисторов исходной схемы. В настоящее время авторами разрабатываются методы распознавания в транзисторной схеме более сложных элементов, таких как элементы памяти. Ключевые слова: экстракция транзисторных подсхем, КМОП-схемы, верификация, перепроектирование СБИС, распознавание логических вентилей, формат SPICE. Поступила в редакцию | Received 14.09.2021 Подписана в печать | Accepted 08.10.2021 Опубликована | Published 29.12.2021

Непокрытая часть
Список использованных источников
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call