A RTL Binding Technique for CPLD constraint

CPLD 조건식을 위한 RTL 바인딩

  • 김재진 (극동정보대학 컴퓨터정보과) ;
  • 윤충모 (서울대학 정보전자)
  • Published : 2006.12.30

Abstract

In this paper, a RTL binding technique for CPLD constraint is proposed. Allocation processing selected module consider the module calculation after scheduling process for circuit by HDL. Select CPLD for constrain after allocation. A Boolean equation is partitioned for CLB by allocated modules. The proposed binding algorithm is description using optimum CLB within a CPLD. The proposed algorithm is examined by using 16 bit FIR filter. In the case that applicate the algorithm, the experiments results show reduction in used CLB.

References

  1. C. Ramachandran, F. J. Kurdahi, D. Gajski, V. Chaiyakul, A. Wu, 'Accurate Layout Area and Delay Modeling for System Level Design' Proc. ICCAD'92, NOV. 1992
  2. M. Xu, F. J. Kurdahi 'Chip Level Area and Timing Estimation for Lookup Table Based FPGAs' Tech. Report #95-31, DO, Aug.1995
  3. N. Dutt, C. Ramachandran, 'Benchmarks for the 1992 High Level Synthesis Workshop', DCI, 1992
  4. Ashutosh Mujumdar, Minjoong Rim, Rajiv Jain, Renato De Leone, 'BITNET : An Algorithm for solving The Binding Problem' 7th International Conference on VLSI Design, pp. 163-168, 1994
  5. 윤충모, 김희석, '시간적 조건에서 실행시간을 개선한 CLPD 기술 매핑 알고리즘 개발', 한국QA학회 논문집 vol 4권 3호, pp. 35-46, 1999
  6. 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
  7. 김재진, 이관형, '상관관계에 위한 CLB 구조의 저전력 기술 매핑 알고리즘', 한국컴퓨터정보학회논문집 제10권 제2호, pp.49-57, 2005
  8. 김재진, 이관형, '시간제약 조건과 면적을 고려한 효율적인 CPLD 기술 매핑', 한국컴퓨터정보학회 논문집 제10권 제3호, pp.11-18, 2005