Transformation of Graph Partitions into Problem Domain in Digital Circuit Layout

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

Improved Focused Crawler Using Inverted WAH Bitmap Index  

Focused Crawlers are software which can traverse the internet and retrieve web pages by hyperlinks according to specific topic. The traditional web crawlers cannot function well to retrieve the relevant pages effec...

Security and Privacy in Emerging Wireless Networks with Mobile Sinks 

Mobile sinks (MSs) are more significant in many wireless sensor network (WSN) applications for well-organized data gathering and for unique and revoking compromised sensors. Mobile sinks are act as intermediate nod...

Performance Analysis of IIR Digital Band Stop Filter

IIR Band-stop filter is recursive in nature i.e. the present output sample depends on the past input sample, past output samples and the present input samples. If the past and present inputs and output are varied the...

Biclustering for Microarray Data: A Short and Comprehensive Tutorial  

This paper presents a quick and very comprehensive tutorial on biclustering for the analysis of gene expression data obtained from microarray experiments. The results obtained from the conventional clustering methods...

A Scalable Privacy-Preserving Verification Correctness Protocol to Identify Corrupted Data in Cloud Storage

Cloud computing prevails over the whole world which makes the mankind to rely more on a number of online storage systems to back up data or for using it in real time which gives an anywhere, anytime access. Thus lot o...

Download PDF file
  • EP ID EP87751
  • DOI -
  • Views 138
  • Downloads 0

How To Cite

Maninder Kaur, Kawaljeet Singh (2013). Transformation of Graph Partitions into Problem Domain in Digital Circuit Layout. International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 2(7), 2230-2231. https://europub.co.uk/articles/-A-87751