Netlist Equivalence Validation via Bit-to-Word Transformation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional netlist equivalency techniques rely on simulation and bit-level comparisons, lacking a formal proof of equivalency and being limited in validating word-level functionalities.
Innovation Solution
A system and method that transform finite portions of a netlist into infinite portions, converting bit-level functionality to word-level functionality, allowing for the determination of netlist equivalency by comparing both finite and infinite portions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional bit-level comparison techniques are used to determine netlist equivalency, then the method is simple to implement, but it cannot formally prove equivalency and is limited in validating word-level functionalities
Solution Approach 1:
The netlist is divided into finite portions and infinite portions. Finite portions are transformed into infinite portions using predetermined transformations. This segmentation allows the system to handle different types of functionality appropriately - bit-level for finite portions and word-level for infinite portions - thereby improving equivalency validation accuracy without uniformly increasing complexity across the entire validation process.
Solution Approach 2:
The patent transforms the validation approach from a single dimension (bit-level comparison) to multiple dimensions by introducing both finite and infinite portions. The transformation of finite portions into infinite portions adds a new dimension of word-level functionality validation, enabling formal proof of equivalency while maintaining manageable complexity through targeted application of transformations.
2Adaptability or versatility
If finite portions are transformed into infinite portions using predetermined transformations, then word-level functionality can be identified and equivalency validation is improved, but the transformation process increases computational complexity
Solution Approach 1:
Predetermined transformations are applied to finite portions before equivalency validation. These transformations are prepared in advance and systematically convert finite portions into infinite portions, enabling the system to identify word-level functionality ahead of time. This preliminary action reduces the complexity during the actual validation phase by pre-processing the netlist structure.
Solution Approach 2:
The patent changes the parameter representation of finite portions by transforming them into infinite portions. This parameter change enables the system to work with word-level functionality instead of being constrained to bit-level comparisons. The transformation modifies the fundamental parameters of the netlist portions, increasing adaptability while managing complexity through systematic parameter conversion.
3Reliability
If traditional simulation-based techniques are used to show equivalency, then the process is straightforward to implement, but formal proof of equivalency cannot be obtained
Solution Approach 1:
The patent introduces transformations as an intermediary step between the original netlist and the equivalency validation process. By transforming finite portions into infinite portions, the system creates an intermediate representation that enables formal proof of equivalency. This intermediary transformation layer provides mathematical rigor and formal verification capabilities while maintaining a structured validation process.
Data Source
AI summary
A system, method and computer program product are provided for determining equivalence of netlists utilizing at least one transformation. In use, a netlist including a plurality of infinite portions and a plurality of finite portions is identified. Additionally, at least some of the finite portions are transformed, utilizing at least one predetermined transformation. Further, an equivalence of the netlist and another netlist is determined, utilizing at least a subset of the finite portions and the infinite portions. Moreover, the transformation identifies a word-level functionality of the at least some of the finite portions by converting bit-level functionality into word-level functionality.