Transformation of Graph Partitions into Problem Domain in Digital Circuit Layout
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 7
Abstract
The digital circuit layout problem is a constrained optimization problem in the combinatorial sense. It is accomplished in several stages such as partitioning, floorplanning, placement and routing with each step being a constrained optimization problem. Partitioning is one of the first steps in VLSI circuit design. The technique is applied recursively until the complexity in each subdesign is reduced to the extent that it can be handled efficiently by existing tools. This technique is of great importance since it directly affects the rest of the steps in the process. The paper presents three encoding techniques for representation of circuit in the form graph for solving the circuit partitioning problem in context with Digital circuit Layout
Authors and Affiliations
Maninder Kaur , Kawaljeet Singh
Keywords
Related Articles
- EP ID EP87751
- DOI -
- Views 148
- Downloads 0
Low Power And Area Efficiency of SHA-1 and SHA-2 Hash Algorithm
This paper summarizes about the design of a Low Power and Efficiency of SHA-1 and SHA-2 Hash Functions capable of performing all members of the Secure Hash Algorithm (SHA) group of Hash Functions. The need for high-s...
A KNOWLEDGE BASED APPROACH FOR AUTOMATIC DATABASE NORMALIZATION
Normalization is a process of analyzing the given relational schemas based on the functional dependencies and using primary key to achieve minimum data redundancy. Normalization is one of the key issues to be carried out...
Effective Estimation of Peak-Power for a Testable Digital Circuit
Peak power corresponds to the highest value of instantaneous power measured during testing. The peak power generally determines the thermal and electrical limits of the circuit and the system packaging requiremen...
Normalization of Intuitionistic Fuzzy Rough Relational Databases
In this paper, a method of normalization of a relational schema with intuitionistic fuzzy rough attributes in first normal form is presented. The method is implemented by an example which shows that how the proce...
INTERLEAVED FORWARD ERROR CORRECTING (FEC) CODES BASED ON BINAR SHUFFLE ALGORITHM (B.S.A)
Forward Error Correcting (FEC) is one of the technique is used for controlling errors without sending any retransmission to sender. Example of forward error correcting codes are hamming, lower-density parity-ch...