Transistor permutation for better transistor chaining

Custom layout design style remains to be an effective way of improving and differentiating the performance of integrated circuits. In this paper, we revisit the classic problem of transistor chaining, a key step in transistor level layout generation and report a systematic method for permutating transistors in a circuit topology such that without altering its logic function, the chance of finding transistor chains with minimum number of diffusion breaks is increased. The results on nontrivial circuits show that our algorithm can consistently outperform the best reported results in the literature1.

[1]  David G. Chinnery,et al.  Closing the Gap Between ASIC and Custom - Tools and Techniques for High-Performance ASIC Design , 2002 .

[2]  Takao Uehara,et al.  Optimal Layout of CMOS Functional Arrays , 1978, 16th Design Automation Conference.

[3]  C. Y. Roger Chen,et al.  A new layout optimization methodology for CMOS complex gates , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[4]  Yu-Chin Hsu,et al.  A fast transistor-chaining algorithm for CMOS cell layout , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  John P. Hayes,et al.  Layout optimization of static CMOS functional cells , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..