메뉴 건너뛰기




Volumn 52, Issue 1, 2003, Pages 21-30

General models and a reduction design technique for FPGA switch box designs

Author keywords

Detailed routing; FPGA; Global routing; Hyper universal; Optimum design; Reduction technique; Switch box

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; PROBLEM SOLVING; SWITCHING; THEOREM PROVING;

EID: 0037247315     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1159751     Document Type: Article
Times cited : (22)

References (17)
  • 5
    • 0026866240 scopus 로고
    • A detailed router for field-programmable gate arrays
    • May
    • S. Brown, J. Rose, and Z.G. Vranesic, "A Detailed Router for Field-Programmable Gate Arrays," IEEE Trans. Computer-Aided Design, vol. 11, pp. 620-628, May 1992.
    • (1992) IEEE Trans. Computer-Aided Design , vol.11 , pp. 620-628
    • Brown, S.1    Rose, J.2    Vranesic, Z.G.3
  • 9
    • 0029234175 scopus 로고
    • A performance and routability driven router for FPGAs considering path delays
    • Y.S. Lee and C.H. Wu, "A Performance and Routability Driven Router for FPGAs Considering Path Delays," Proc. Design Automation Conf., pp. 557-561, 1995.
    • (1995) Proc. Design Automation Conf. , pp. 557-561
    • Lee, Y.S.1    Wu, C.H.2
  • 10
    • 0032203974 scopus 로고    scopus 로고
    • On the optimal four-way switch box routing structures of FPGA greedy routing architectures
    • J.F. Pan, Y.L. Wu, G. Yan, and C.K. Wong, "On the Optimal Four-Way Switch Box Routing Structures of FPGA Greedy Routing Architectures," Integration, the VLSI J., vol. 25, pp. 137-159, 1998.
    • (1998) Integration, the VLSI J. , vol.25 , pp. 137-159
    • Pan, J.F.1    Wu, Y.L.2    Yan, G.3    Wong, C.K.4
  • 11
    • 0026124456 scopus 로고
    • Flexibility of interconnection structures for field-programmable gate arrays
    • J. Rose and S. Brown, "Flexibility of Interconnection Structures for Field-Programmable Gate Arrays," IEEE J. Solid-State Circuits, vol. 26, no. 3, pp. 277-282, 1991.
    • (1991) IEEE J. Solid-State Circuits , vol.26 , Issue.3 , pp. 277-282
    • Rose, J.1    Brown, S.2
  • 12
  • 13
    • 0028728166 scopus 로고
    • On NP-completeness of 2-D FPGA routing architectures and a novel solution
    • Y.L. Wu and D. Chang, "On NP-Completeness of 2-D FPGA Routing Architectures and a Novel Solution," Proc. Int'l Conf. Computer-Aided-Design, pp. 362-366, 1994.
    • (1994) Proc. Int'l Conf. Computer-Aided-Design , pp. 362-366
    • Wu, Y.L.1    Chang, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.