메뉴 건너뛰기




Volumn 25, Issue 2, 1998, Pages 137-159

On the optimal four-way switch box routing structures of FPGA greedy routing architectures

Author keywords

FPGA routing architecture

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; ELECTRIC SWITCHES; MICROPROCESSOR CHIPS; OPTIMIZATION; POLYNOMIALS;

EID: 0032203974     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9260(98)00011-X     Document Type: Article
Times cited : (11)

References (12)
  • 3
    • 0028728166 scopus 로고
    • On the NP-completeness of regular 2-D FPGa routing architectures and a novel solution
    • Y.L. Wu, D. Chang, On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution, Proc. Int. Conf. On CAD, 1994, pp. 362-366.
    • (1994) Proc. Int. Conf. on CAD , pp. 362-366
    • Wu, Y.L.1    Chang, D.2
  • 8
    • 0029714355 scopus 로고    scopus 로고
    • Area-speed tradeoffs for hierarchical field-programmable gate arrays
    • V.C. Chan, D.B. Lewis, Area-speed tradeoffs for hierarchical field-programmable gate arrays, Proc. Int. Symp. on FPGAs, 1996, pp. 51-57.
    • (1996) Proc. Int. Symp. on FPGAs , pp. 51-57
    • Chan, V.C.1    Lewis, D.B.2


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