The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Circuit camouflaging techniques have been proposed to thwart reverse engineering (RE) attacks to integrated circuits (IC). In one of the most well-known camouflaging methods, selective XOR, NAND, and NOR gates are replaced by configurable logic units which have the same appearance to the RE attackers. It is argued that a successful attack has to brute force search all the camouflaged gates' possible...
In analog and mixed signal designs, exact matching requirement is critical for correct functionality of analog devices. However, due to the excessive complexity, it is difficult to consider exact matching constraint in detailed routing stage. This paper presents a novel gridless detailed routing algorithm, which efficiently obtains the optimized detailed routing solutions for a given set of nets with...
The traditional placement methods for the island-style FPGA suffer from the conflicts of the unique architecture of the multilevel hierachical FPGA and the increasing capacity of FPGA. In this paper, we present an improved partitioning-based placement algorithm with three heuristic strategies, partition granularity strategy, vacancy distribution strategy and edge-weight assignment strategy. The partition...
In this paper, we present a top-down global placement algorithm considering wire density uniformity for CMP variation control. The proposed algorithm is based on top-down recursive bisection framework. Wire weight balancing constraint is employed into bisection to consider wire density uniformity. A multilevel hypergraph partitioning satisfying balancing constraints on not only cell area but also...
In this paper we present a multilevel hypergraph partitioning algorithm which satisfies not only vertex weight constraint but also edge weight constraint. In our multilevel paradigm, two FM (Fiduccia and Mattheyses, 1988) variants are performed alternately in the refinement stage. The first FM variant aims to symmetrize edge weight of the two partitioning blocks and the other aims to minimize cut...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.