메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 134-139

Low-power high-level synthesis for FPGA architectures

Author keywords

Circuits; Energy consumption; Engines; Estimation error; Field programmable gate arrays; High level synthesis; Power generation; Scheduling algorithm; Simulated annealing; Wire

Indexed keywords

ALGORITHMS; BINDING ENERGY; BINS; DESIGN; ELECTRIC POWER SUPPLIES TO APPARATUS; ELECTRIC POWER UTILIZATION; ENERGY UTILIZATION; ENGINES; ESTIMATION; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); HIGH LEVEL SYNTHESIS; NETWORKS (CIRCUITS); POWER ELECTRONICS; POWER GENERATION; SCHEDULING ALGORITHMS; SIMULATED ANNEALING; SYNTHESIS (CHEMICAL); WIRE;

EID: 1542299296     PISSN: 15334678     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LPE.2003.1231849     Document Type: Conference Paper
Times cited : (80)

References (23)
  • 2
    • 0031211386 scopus 로고    scopus 로고
    • A new approach to simultaneous scheduling, allocation and binding in high level synthesis
    • Aug
    • P. Kollig and B.M. Al-Hashimi, "A new approach to simultaneous scheduling, allocation and binding in high level synthesis," IEE Electronics Letters, vol. 33, Aug 1997.
    • (1997) IEE Electronics Letters , vol.33
    • Kollig, P.1    Al-Hashimi, B.M.2
  • 14
    • 0036385606 scopus 로고    scopus 로고
    • Efficient circuit clustering for area and power reduction in FPGAs
    • February 24-26
    • A. Singh and M. Marek-Sadowska, "Efficient circuit clustering for area and power reduction in FPGAs," ACM FPGA, February 24-26, 2002.
    • (2002) ACM FPGA
    • Singh, A.1    Marek-Sadowska, M.2
  • 15
    • 0015206785 scopus 로고
    • On a pin versus block relationship for partitions of logic graphs
    • B. Landman and R. Russo, "On a pin versus block relationship for partitions of logic graphs," IEEE Transactions on Computers, c-20:1469-1479, 1971.
    • (1971) IEEE Transactions on Computers , vol.C-20 , pp. 1469-1479
    • Landman, B.1    Russo, R.2
  • 16
    • 0018453798 scopus 로고
    • Placement and average interconnection lengths of computer logic
    • April
    • W. E. Donath, "Placement and average interconnection lengths of computer logic," IEEE Transactions on Circuits and Systems, 26(4):272-277, April 1979.
    • (1979) IEEE Transactions on Circuits and Systems , vol.26 , Issue.4 , pp. 272-277
    • Donath, W.E.1
  • 17
    • 0019899299 scopus 로고
    • Connectivity of random logic
    • Jan
    • M. Feuer, "Connectivity of random logic," IEEE Transactions on Computers, C-31(1):29-33, Jan 1982.
    • (1982) IEEE Transactions on Computers , vol.C-31 , Issue.1 , pp. 29-33
    • Feuer, M.1
  • 19
    • 0032026510 scopus 로고    scopus 로고
    • A stochastic wire-length distribution for gigascale integration (GSI) -Part I: Derivation and validation
    • Mar.
    • J.A. Davis, V.K. De and J. Meindl, "A stochastic wire-length distribution for gigascale integration (GSI) -Part I: Derivation and validation," IEEE Trans. on Electron Devices, 45(3):580-589, Mar. 1998.
    • (1998) IEEE Trans. on Electron Devices , vol.45 , Issue.3 , pp. 580-589
    • Davis, J.A.1    De, V.K.2    Meindl, J.3
  • 23
    • 0038336002 scopus 로고
    • Optimum and heuristic transformation techniques for simultaneous optimization of latency and throughput
    • Mar.
    • M. B. Srivastava and M. Potkonjak, "Optimum and heuristic transformation techniques for simultaneous optimization of latency and throughput," IEEE Trans. on VLSI Systems, vol.3 (1), pp.2-19, Mar. 1995.
    • (1995) IEEE Trans. on VLSI Systems , vol.3 , Issue.1 , pp. 2-19
    • Srivastava, M.B.1    Potkonjak, M.2


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