ACM Home Page
Please provide us with feedback. Feedback
Switch-matrix architecture and routing for FPDs
Full text PdfPdf (836 KB)
Source International Symposium on Physical Design archive
Proceedings of the 1998 international symposium on Physical design table of contents
Monterey, California, United States
Pages: 158 - 163  
Year of Publication: 1998
ISBN:1-58113-021-X
Authors
Guang-Min Wu  Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, ROC
Yao-Wen Chang  Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, ROC
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 14,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/274535.274559
What is a DOI?

ABSTRACT

An FPD switch module M with w terminals on each side is said to be universal if every set of nets satisfying the dimensional constraint (i.e., the number of nets on each side of M is at most w) is simultaneously routable through M [8]. Chang, Wong, and Wong have identified a class of universal switch blocks [8]. 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 w has a total of only 14w - 20 (14w - 21) switches if w is even (odd), w > 1, compared to a fully populated one which has 3w2 - 2w switches. We prove that no switch matrix with less than 14w - 20 (14w - 21) switches can be quasi-universal. Experimental results demonstrate that the quasi-universal switch matrices improve routabilty at the chip level.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Actel Corp., FPGA Data Book and Design GsJde, 1996.
 
2
Altera Corp., FLBX lOKHandbook, 1996.
 
3
Aptix Inc., PPIC AXIO24D, Preliminary Data Sheet, Aug., 1992.
 
4
AT&T Microelectronlcs, AT~T Field.ProgrammaMe Gate Arrayl Data Book, Apr. 1995.
 
5
 
6
S.D. Brown, 3. Rose, and Z. G. Vraneslc, UA stochastic model to predict the rontability of field-programmable gate arrays," IEBB Trans. CompateroAided Design, vol. 12, no. 12, pp. 1827"-1838, Dec. 1993.
 
7
8
 
9
A. El Gamal, ~t at., nAn architecture for electrically configurable gate arrays," IBBB J. Solid.State Circuits, vol. 24, no. 2, pp. 394-398, Apr. 1989.
 
10
3- L. Hen,easy and D. A. Patterson, Compxfcr Arch,lactate: A Qsanfitofie~ Ap. prva~l~, 2nd Ed., Morgan Kaufmann Pub., 1996.
 
11
H.C. Hsieh, et nL, UThird-generatlon architecture boosts speed and density of field-programmable gate arrays,n in Pro~~ IBBB Csstor~ Integrated C,rcslts Cony., pp. 31.2.1-31.2.7, May 1990.
12
 
13
C. Y. Lee, "An algorithm for path connections and its applications," IRB Tran,. Bittern,los Camp=far., vol. EC-10, pp. 346-365, Sept. 1961.
 
14
G- G. Lemienx and S. D. Brown, "A detailed routing algorithm for allocating wire segments in fleld-programmable gate arrays," in Pro~. ACM/SIGDA P&~s,caIDelign Workshop, pp. 215-216, Lake Arrowhead, CA, 1993.
 
15
J. Rose and S. Brown, "Flexibility of {nterconnection structures for fieldprogrammable gate axrays," IBBB J. Solid State C~rcsmfJ, vol. 26, no.3, pp. 277- 282, Mar. 1991.
 
16
 
17
 
18
Xilinx Inc., T&e Pr~ammable Z, ogle Data Book, 1996.
 
19


Collaborative Colleagues:
Guang-Min Wu: colleagues
Yao-Wen Chang: colleagues