• 검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
  • 검색연산자
검색연산자 기능 검색시 예
() 우선순위가 가장 높은 연산자 예1) (나노 (기계 | machine))
공백 두 개의 검색어(식)을 모두 포함하고 있는 문서 검색 예1) (나노 기계)
예2) 나노 장영실
| 두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색 예1) (줄기세포 | 면역)
예2) 줄기세포 | 장영실
! NOT 이후에 있는 검색어가 포함된 문서는 제외 예1) (황금 !백금)
예2) !image
* 검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색 예) semi*
"" 따옴표 내의 구문과 완전히 일치하는 문서만 검색 예) "Transform and Quantization"
쳇봇 이모티콘
ScienceON 챗봇입니다.
궁금한 것은 저에게 물어봐주세요.

논문 상세정보

시간 제약 조건 하에서 저전력을 고려한 CLB구조의 CPLD 기술 매핑 알고리즘

CLB-Based CPLD Technology Mapping Algorithm for Power Minimization under Time Constraint


In this paper, we proposed a CLB-based CPLD technology mapping algorithm for power minimization under time constraint in combinational circuit. The main idea of our algorithm is to exploit the "cut enumeration and feasible cluster" technique to generate possible mapping solutions for the sub-circuit rooted at each node. In our technology mapping algorithm conducted a low power by calculating TD and EP of each node and decomposing them on the circuit composed of DAG. It also takes the number of input, output, and OR-term into account on condition that mapping can be done up to the base of CLB, and so it generates the feasible clusters to meet the condition of time constraint. Of the feasible clusters, we should first be mapping the one that h3s the least output for technology mapping of power minimization and choose to map the other to meet the condition of time constraint afterwards. To demonstrate the efficiency of our approach, we applied our algorithm to MCNC benchmarks and compared the results with those of the exiting algorithms. The experimental results show that our approach is shown a decrease of 46.79% compared with DDMAP and that of 24.38% for TEMPLA in the power consumption.

저자의 다른 논문

참고문헌 (14)

  1. The MACH 4 Family Data Sheet, Advanced Micro Devices, 1996 
  2. S. Devadas, S. malik, 'A Survey of Optimization Techniques Targeting Low Power VLSI Circuits', in Proc. 32nd DAC, pp. 242-247, June 1995 
  3. A. Chandrakasan, T. Sheng, and R. Brodersen, 'Low Power CMOS Digital Design', Journal of Solid State Circuits, vol. 27, no. 4, pp. 473-484, April 1992 
  4. S. Chakravarty, 'On complexity of using BDDs for the synthesis and analysis of boolean circuits', in Proc. 27th Annual Allerton Conf. On Communication Control and computing., pp. 730-739.1989 
  5. S. ErColani et al., 'Testability measures in pseudorandom testing', IEEE Trans. Conputer-Aided Design., vol. 11, pp. 794-800, 1992, June 
  6. J. Cong and Y. Ding, 'FlowMap : An 'Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs', IEEE Transactions on Computer Aided Design of Integrated Circuit and Systems, Vol. 13, No. 1, January 1994, pp. 1-11 
  7. R.J. Francis, J. Rose and Z. Vranestic, 'Chortle-crf : Fast Technology Mapping for Lookup Table-Based FPGAs', 28th ACM/IEEE Design Automation Conference, June 1991, pp. 227-233 
  8. Zhi-Hong Wang, En-Cheng Liu, Jianbang Lai, Ting-Chi Wang, 'Power Minimization in LUT-Based FPGA Technology Mapping', ASP-DAC, pp. 635-640, January 2001 
  9. A. H. Farrahi and M. Sarrafzadeh, 'FPGA Technology Mapping for Power Minimization', Proc. Int. Workshop on field Programmable Logic and Applications, pp. 66-77, 1994 
  10. C. -C. Wang and C. -P. Kwan, 'Low Power Technology crossref
  11. R.J.Francis, J. Rose and Z. Vranestic, 'Technology Mapping of Lookup Table-Based FPGAs for Performance', 1991 IEEE Conference on Computer Aided Design, pp. 568-571 
  12. E. M. Sentovice et al., 'SIS : A system for sequential Circuit Synthesis', Technocal Report UCM/ERL M92/41, Electronics Research Laboratory, Departmant of Electrical Engineering and Computer Science, University of California, Berkeley, 1992 
  13. Jason Helge Anderson, Stephen Dean Brown, 'Technology Mapping for Large Complex PLDs', Design Automation Conference, 1998, pp. 698-703 
  14. Jae-Jin Kim, Hi-Seok Kim, Chi-Ho Lin, 'A New Technology Mapping for CPLD under the time constraint' ASP-DAC, pp. 235-238, January 2001 

이 논문을 인용한 문헌 (0)

  1. 이 논문을 인용한 문헌 없음


원문 PDF 다운로드

  • ScienceON :

원문 URL 링크

원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다. (원문복사서비스 안내 바로 가기)

상세조회 0건 원문조회 0건

DOI 인용 스타일