Boolean Satisfiability (SAT)-based routing has unique advantages over conventional one-net-at-a-time approaches such as simultaneous net embedding or routability decision. Yet SAT-based routing has been criticized for scalability issues. On the other hand, geometric search routing algorithms, even with extensive rip-up-reroute capabilities, have difficulty achieving routing solution convergence...

Mobile IPv6 has been designed by the IETF to provide mobility to the Internet. With mobility a user can move and change his point of attachment to the Internet without losing his network connections. If Mobile IPv6 was deployed on the Internet, typically Correspondent Nodes would be large servers of current content providers. These large servers have thousands of clients and in such scenario ma...

Advances in commercially-available ASR technology have enabled the deployment of “How-may-I-help-you?” interactions to automate call routing. While often preferred to menu-based or directed dialog strategies, there is little quantitative research into the relationships among prompt style, task completion, user preference/satisfaction, and domain. This work applies several dialog strategies to t...

It is well known that congestion control becomes more and more important in modern grid-based routing process. In this paper, a timing-constrained congestion-driven global routing approach is proposed to obtain initial congestion-driven global routing result without destroying the timing constraint of any routing net, and a post-processing simulated-annealingbased rip-up-and-reroute improvement...

In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. A t early generations, the search is biased toward solutions with superior tarning characteristics. As the algorithm starts converging toward generations with acceptable de lay properties, the objective is dynamically adjusted toward optimizing area and routability....

We propose a routability-driven analytical placer that aims at distributing pins evenly. This is accomplished by including a group of pin density constraints in its mathematical formulation. Moreover, for mixed-size circuits, we adopt a scaled smoothing method to cope with fixed macro blocks. As a result, we have fewer cells overlapping with fixed blocks after global placement, implying that th...

As a mobile node switches from one subnet to another, Mobile IPv6 requires that it authenticate the new Care of Address of the new subnet with the corresponding node. The authentication process, called Return Routability (RR) test, is required in every handoff and can delay the handoff process by a round trip delay between mobile and corresponding nodes. In this paper, a mechanism is proposed t...

A W-shaped multilevel full-chip routing framework using W-shaped optimization flow is used to find the final routing solution. The W-shaped flow consists of two sequential V-shaped optimization flows. The first V-shaped flow optimizes the global routing solution. The probabilistic congestion prediction technique is used to guide the global routing decision to find the routing solution that even...

In this paper, we present a methodology for rapid prototyping of linear time-invariant analog systems. The prototyping hardware is composed of field-programmable analog arrays (FPAAs) to enable rapid evaluation and validation of analog designs. Starting with a signal flow graph description of the system, a library-based technology mapping phase produces FPAA designs optimized for area. The tech...