針對單電子電晶體之有考慮面積的分解技術的研究

Area-aware Decomposition for Single-Electron Transistor Arrays

何清萱(Ho, Ching Hsuan)

指導教授 ： 王俊堯

國立清華大學/電機資訊學院/資訊工程學系/碩士(2015年)

摘要

由於單電子電晶體(Single-Electron Transistor)在室溫下的操作過程耗能極低，它有望成為能夠延續摩爾定律的裝置。目前既有的單電子電晶體架構之合成方法是將一個布林網路合成成一個高度和主要輸入(Primary Input)個數相同的可重構單電子電晶體架構，然而，近來裝置方面的實驗顯示出此高度受到極低電流的影響，必須限制在一個數字內，例如10，而非任意數。此外，單電子電晶體架構的寬度也建議被縮減。因此，將一個大的單電子電晶體架構分解成多個高度不超過10的單電子電晶體架構是必要的。本論文提出兩個技術來達到面積有效的單電
子電晶體架構之分解：第一項技術是用於縮減單一一個單電子電晶體架構的寬度最小化演算法；另一項技術是深度綁定的映射演算法，用於將一個布林網路分解成多個寬度平衡的子函數。寬度最小化演算法與最先進的技術相比有25%~41%之進步，而映射演算法與簡易映射演算法相比能省下60%之面積。

關鍵字

Single electron devices ； Circuit synthesis

並列摘要

Single-electron transistor (SET) at room temperature has been demonstrated as a promising device for extending Moore's law due to its ultra-low power consumption.
Existing SET synthesis methods synthesize a Boolean network into a large recongurable SET array where the height of SET array equals the number of primary
inputs. However, recent experiments on device level have shown that this height is restricted to a small number, say 10, rather than arbitrary value due to the ultra-low
driving strength of SET devices. On the other hand, the width of an SET array is also suggested to be a small value. Consequently, it is necessary to decompose a large
SET array into a set of small SET arrays where each of them realizes a sub-function of the original circuit with no more than 10 inputs. Thus, this paper presents two
techniques for achieving area-efficient SET array decomposition: One is a width minimization algorithm for reducing the area of a single SET array; the other is a
depth-bounded mapping algorithm, which decomposes a Boolean network into many sub-functions such that the widths of the corresponding SET arrays are balanced.
The width minimization algorithm leads to a 25%~41% improvement compared to the state-of-the-art, and the mapping algorithm achieves a 60% reduction in total
area compared to a naive approach.

並列關鍵字

Single-electron circuit ； Circuit synthesis ； Minimization methods

參考文獻

[18] C.-W. Liu, C.-E. Chiang, C.-Y. Huang, Y.-C. Chen, C.-Y. Wang, S. Datta, V. Narayanan, "Synthesis for Width Minimization in the Single-Electron Transistor Array," IEEE Transactions on VLSI, Feb. 2015.

[1] R. Bryant, "Graph-based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, vol. 35, pp. 677-691, Aug. 1986.

[2] H. W. Ch. Postma, T. Teepen, Z. Yao, M. Grifoni, and C. Dekker, "Carbon Nanotube Single-Electron Transistors at Room Temperature," Science, vol. 293, pp. 76-79, 2001.

[3] Y.-H. Chen, J.-Y. Chen, and J.-D. Huang, "Area Minimization Synthesis for Recongurable Single-Electron Transistor Arrays with Fabrication Constraints," in Proc. Design, Autom. Test in Eur., 2014.

[4] Y.-H. Chen, Y. Chen, and J.-D. Huang, "ROBDD-Based Area Minimization Synthesis for Recongurable Single-Electron Transistor Arrays," in Proc. VLSI Design, Automation and Test, pp. 1-4, 2015.