Dinesh P. Mehta

Learn More
The large size of modern FPGAs has caused researchers to consider deploying hierarchical techniques in their design. In this paper, we consider the floorplanning of FPGAs. We present a two-step approach for the floorplanning of modern FPGAs that we believe is cleaner and more versatile than recent floorplanners. The steps, based on resource-aware fixed(More)
A floorplan of a bounding box is its dissection into rectangles (rooms) by horizontal and vertical segments. This paper proposes a string data structure called the Quarter-state sequence (or Q sequence) to represent the floorplan. The Q sequence is a concatenation of the states of rooms along the Abe order and is related to the VH graph, which is the union(More)
This paper presents algorithms for a constrained version of the "modern" floorplanning problem proposed by Kahng in "Classical Floorplanning Harmful?" (Kahng, 2000). Specifically, the constrained modern floorplanning problem (CMFP) is suitable when die-size is fixed, modules are permitted to have rectilinear shapes and, in addition, the approximate relative(More)
Handbook of Algorithms for Physical Design Automation 2008 Proceedings of the 2003 International Symposium on Physical Design, ISPD 2003, Monterey. Learn about the physical design automation techniques used in the D. P. Mehta, S. S. Sapatnekar, Handbook of Algorithms for Physical Design Automation. A hardware Trojan is a malicious modification of a design(More)
Network wide broadcast is a fundamental operation in mobile ad hoc networks (MANETs). Several broadcast protocols have been proposed in the literature that improves on simple flooding by reducing the probability that a receiving node retransmits a packet. We propose analytical models to estimate these probabilities for three broadcast protocols. Our(More)
This paper presents three minimum-area floorplanning algorithms that use flexible arbitrary rectilinear shapes for the standard cell regions in MBC design. The first algorithm (pure HCST) introduces a grid traversal technique which guarantees a minimum-area floorplan. The second algorithm (Hybrid-BF) uses a combination of HCST and Breadth First (BF)(More)
Automated reaction mapping is a fundamental first step in the analysis of chemical reactions and opens the door to the development of sophisticated chemical kinetic tools. This article formulates the reaction mapping problem as an optimization problem. The problem is shown to be NP-Complete for general graphs. Five algorithms based on canonical graph naming(More)
A productivity-driven methodology for incremental floorplanning is described and the <italic>constrained polygon transformation problem</italic>, a key step of this methodology, is formulated. The input to the problem consists of a floorplan computed using area estimates and the actual area required for each subcircuit of the floorplan. Informally, the(More)