摘要
Transistor folding reduces the area of row-based designs that employ transistors of different size. Kim and Kang [1] have developed an O(m^2 log m) algorithm to optimally fold m transistor pairs. In this paper we develop an O(m^2) algorithm for optimal transistor folding. Our experiments indicate that our algorithm runs 3 to 60 times as fast for m values in the range (100, 100,000).
延伸閱讀
- 吳杰峯（2007）。A New Partitioning Algorithm for Solving The RST Problems〔碩士論文，國立虎尾科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0028-1501201314421360
- Kuo, W. D. (2008). IMPROVED ARCHITECTURE OF FAST FOURIER TRANSFORM PROCESSOR [master's thesis, Tatung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0081-0607200917245560
- Chang, S. L. (1998). A Fault-Containing Self-Stabilizing Algorithm for Maximal Matching [master's thesis, Yuan Ze University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611324895
- Lai, S. C., & Tsai, C. C. (2016). A LOW-COMPLEXITY RECURSIVE ALGORITHM AND COMPACT HARDWARE DESIGN FOR SLIDING DISCRETE FOURIER TRANSFORM. 電機工程學刊, 23(2), 73-81. https://doi.org/10.6329/CIEE.2016.2.05
- CHANG, K. E., & CHEN, S. W. (1996). An Efficient and Fast Algorithm for Routing Over the Cells. VLSI Design, 1996(), b1-10. https://doi.org/10.1155/1996/96136