Quasi-universal switch matrices for FPD design

南華大學機構典藏系統 > 科技學院 > 資訊管理學系 > 期刊論文 > Item 987654321/25079

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nhuir.nhu.edu.tw/handle/987654321/25079

题名:	Quasi-universal switch matrices for FPD design
作者:	吳光閔;Wu, Guang-Ming;Chang, Yao-Wen
貢獻者:	資訊管理學系
日期:	1999-10
上传时间:	2017-07-18 15:47:38 (UTC+8)
摘要:	An FPD switch module M with ω terminals on each side is said to be universal if every set of nets satisfying the dimension constraint (i.e., the number of nets on each side of EA is at most ω) is simultaneously routable through M. Chang et al. (1996) have identified a class of universal switch blocks. In this paper, we consider the design and routing problems for another popular model of switch modules called switch matrices. Unlike switch blocks, we prove that there exist no universal switch matrices. Nevertheless, we present quasi-universal switch matrices which have the maximum possible routing capacities among all switch matrices of the same size and show that their routing capacities converge to those of universal switch blocks. Each of the quasi-universal switch matrices of size ω has a total of only 14ω-20 (14ω-21) switches if ω is even (odd), ω>1, compared to a fully populated one which has 3ω² -2ω switches. We prove that no switch matrix with less than 14ω-20 (14ω-21) switches can be quasi-universal. Experimental results demonstrate that the quasi-universal switch matrices improve routability at the chip level.
關聯:	IEEE Transactions on Computers vol. 48, no. 10 pp1107-1122
显示于类别:	[資訊管理學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	312	检视/开启
Quasi-universal.pdf		287Kb	Adobe PDF	167	检视/开启

在NHUIR中所有的数据项都受到原著作权保护.

TAIR相关文章