Genetic algorithm based design optimization of CMOS VLSI circuits

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The proliferation of portable and hand-held electronics combined with increasing packaging costs is forcing circuit designers to adopt low power design methodologies. Low power designs of microprocessors and application specific integrated circuits (ASICs) result in increased battery life and improved reliability. In this paper, we examine the application of genetic algorithms to the low-power design of combinational logic. In particular, we consider the use of genetic algorithms for the optimization of standard cell based designs which account for 20-50% of a typical microprocessor die size. Our algorithm optimizes a user-specified function of delay, power, and area under performance constraints. Empirically, we find that the run time for our algorithm scales linearly with circuit size. In our extensive benchmark suite, this algorithm has reduced power by 17% on the average and as much as 24% on some circuits.

Cite

CITATION STYLE

APA

Hill, A. M., & Steve Kang, S. M. (1994). Genetic algorithm based design optimization of CMOS VLSI circuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 866 LNCS, pp. 546–555). Springer Verlag. https://doi.org/10.1007/3-540-58484-6_297

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free