No abstract

A productivity-driven methodology for incremental floorplanning is described and the constrained polygon transformation problem, 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 objective is to change the areas of the modules without drastically changing their shapes or locations. We show that the constrained polygon transformation problem is NP-hard and present several fast algorithms that produce results within a few percent of a theoretical lower bound on several floorplans.

The background numerical noise ε 0 is determined by the maximum of truncation error and round-off error. For a chaotic system, the numerical error ε(t) grows exponentially, say, ε(t) = ε 0 exp(κ t), where κ > 0 is the so-called noise-growing exponent. This is the reason why one can not gain a convergent simulation of chaotic systems in a long enough interval of time by means of traditional algorithms in double precision, since the background numerical noise ε 0 might stop decreasing because of the use of double precision. This restriction can be overcome by means of the clean numerical simulation (CNS), which can decrease the background numerical noise ε 0 to any required tiny level. A lot of successful applications show the novelty and validity of the CNS. In this paper, we further propose some strategies to greatly increase the computational efficiency of the CNS algorithms for chaotic dynamical systems. It is highly suggested to keep a balance between truncation error and round-off error and besides to progressively enlarge the background numerical noise ε 0 , since the exponentially increasing numerical noise ε(t) is much larger than it. Some examples are given to illustrate the validity of our strategies for the CNS.