Tabu search based circuit optimization

Engineering Applications of Artificial Intelligence

Volumn 15, Issue 3-4, 2002, Pages 357-368

  Sait, Sadiq M ^a   Zahra, Munir M ^a  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

Author keywords

Circuit optimization; CMOS BiCMOS; Critical path; False path; Mixed technologies; Search algorithms; Simulated evolution; Tabu search

Indexed keywords

ALGORITHMS; CAPACITANCE; COMPUTER SIMULATION; MIXER CIRCUITS; OPTIMIZATION;

CIRCUIT OPTIMIZATION;

CMOS INTEGRATED CIRCUITS;

EID: 0036625517     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0952-1976(02)00054-4     Document Type: Article

References (22)

1. Baase S. Computer Algorithms: Introduction to Design and Analysis. 1991;Addison-Wesley, Reading, MA.
2. Baba-Ali A.R., Bellaouar A. An optimization tool for mixed CMOS/BiCMOS standard cells circuits. Arabian Journal of Science and Engineering. 19(4B):1994;883-888.
3. Benkoski J., Meersch E., Claesen L., De Man H. Timing verification using statically sensitizable paths. IEEE Transaction on Computer-Aided Design. 9(10):1990;1073-1083.
4. Brand, D., Iyengar, V., 1986. Timing analysis using functional relationships. Proceedings of ICCAD-86, pp. 126-129.
5. Chen H., Du D. Path sensitization in critical path problem. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 12(2):1993;196-207.
6. Chen H., Du D., Liu L. Critical path selection for performance optimization. IEEE Transactions on Computer-Aided Design. 12(2):1993;185-195.
7. Du, D. Yen, H., Ghanta, S., 1989. On the general false path problem in timing analysis. Proceedings of the 26th Design Automation Conference, pp. 555-560.
8. Embabi S., Bellaouar A., Elmasry M. Digital BiCMOS Integrated Circuit Design. 1993;Kluwer Academic Publishers, Dordrecht.
9. Glover, F., 1990. Tabu search: a tutorial. Technical Report, University of Colorado, November.
10. Horowitz E., Sahni S. Fundamentals of Computer Algorithms. 1990;Computer Science Press, Rockville, MD.
11. Huang, S., Parng, T., Shyu, J., 1993. A polynomial-time heuristic approach to approximate a solution to the false path problem. 30th ACM/IEEE Design Automation Conference, pp. 118-122.
12. Hubscher R., Glover F. Applying tabu search with influential diversification to multiprocessor scheduling. Computers & Operations Research. 21(8):1994;877-884.
13. Laguna M., Glover F. Bandwidth packing: a tabu search approach. Management Science. 39(4):1993;492-500.
14. Lin, S., Marek-Sadowska, M., Kuh, E., 1990. Delay and area optimization in standard-cell design. Proceedings of the 27th Design Automation Conference, pp. 349-352.
15. McGeer, P., Brayton, R., 1989. Efficient algorithm for computing the longest viable path in a combinational network. 26th ACM/IEEE Design Automation Conference, pp. 561-573.
16. Perremans, S., Claesen, L., De ManV, H., 1989. Static timing analysis of dynamically sensitizable paths. 26th ACM/IEEE Design Automation Conference, pp. 568-573.
17. Reeves, C. (Ed.), 1995. Modern Heuristic Techniques for Combinatorial Problems. Mc-Graw-Hill, Europe.
18. Kling, R., Banerjee, P., 1987. Esp:a new standard cell placement package using simulated evolution. Proceedings of the International Design Automation Conference, pp. 60-66.
19. Roth J.P. Diagnosis of automata failures: a calculus and a method. IBM Journal of Research Development. 10(4):1966;278-281.
20. Sait, S.M., Youssef, H., 1999. Iterative computer algorithms and their applications in engineering. IEEE CS Press.
21. Yen, S., et al., 1989. Efficient algorithms for extracting the K -most critical paths in timing analysis. Proceedings of 26th Design Automation Conference, pp. 649-654.
22. Youssef, H., Sait, S.M., Al-Farrah, K., 1995. Timing influenced force-directed floorplanning. European Design Automation Conference with Euro-VHDL Euro-DAC'95, Brighton, September, pp. 156-161.