The Louvre on the Web
Virtual Tourist
National Parks in the United
States
The
Asynchronous Logic Home Page
The Genius of Laxman
In my post-Stanford life, I spent a year in the Advanced CAD Research group at Fujitsu Laboratories of America, Inc. working on layout-driven logical transformations of digital circuits to improve their timing and area.
Prior to joining the Ph.D. program, I received a Bachelor of Technology (Honours) in Computer Science and Engineering from the Indian Institute of Technology (IIT), Kharagpur in 1993. Subsequently, I received an MS in Electrical Engineering from Stanford University in 1995.
My Ph.D. research focussed on designing efficient algorithms for approximate timing analysis of asynchronous systems with bounded delays. From a theoretical standpoint, several important timing analysis problems are computationally intractable in the presence of bounded delays. However, carefully designed polynomial-time algorithms can give results with a fairly high degree of accuracy in practice. In the worst-case, these algorithms make conservative approximations, trading efficiency for accuracy. Note that since the approximations are conservative, no real timing problem escapes detection by the analysis. However, the conservative nature of the analysis may lead to false alarms -- situations where the analysis indicates a problem, while in reality there are none. Nevertheless, by designing the algorithms appropriately, it is possible to reduce or eliminate the conservativeness in analysis in most cases in practice.
The advantage of using polynomial-time algorithms is that their performance scales very well with increasing system size. This makes it feasible to use them in analysis of large systems, especially in environments where repeated analysis is required, e.g., in a design-analysis-redesign loop. The efficiency of the algorithms also make them suitable for use as filters to weed out the vast majority of potential timing problems in large designs very efficiently. The small set of remaining potential problems can then be analyzed using more accurate and expensive techniques. This leads to a pragmatic approach to the timing analysis of large and complex asynchronous systems.
Click here for a brief synopsis of some of the work that I did during my Ph.D. Click here here for a list of my publications.
I have also worked on the theory of additive cellular automata and its applications to synthesis of easily testable synchronous finite state machines. I am also interested in several aspects of Theoretical Computer Science.
The Louvre on the Web
Virtual Tourist
National Parks in the United
States
The
Asynchronous Logic Home Page
The Genius of Laxman
Stanford |
 EE Dept. |
 CS Dept. |
 Stanford CAD |
 Stanford weather
|