Abstract
A new efficient algorithm is derived for the minimal period retiming problem by formal methods. Contrary to all previous algorithms, which used binary search to check feasibilities on a range of candidate periods, the derived algorithm checks the optimality of a current period directly. It is much simpler and more efficient than previous algorithms. Experimental results showed that it is even faster than ASTRA, an efficient heuristic algorithm. Since the derived algorithm is incremental by nature, it also opens the opportunity to be combined with other optimization techniques.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 |
| Pages | 990-993 |
| Number of pages | 4 |
| Volume | 2 |
| State | Published - Dec 1 2005 |
| Event | 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 - Shanghai, China Duration: Jan 18 2005 → Jan 21 2005 |
Other
| Other | 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 |
|---|---|
| Country/Territory | China |
| City | Shanghai |
| Period | 1/18/05 → 1/21/05 |
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering