An Efficient CPLD Technology Mapping considering Area and the Time Constraint

Jaejin Kim; Kwan Hyeong, Lee

Journal of The Korea Society of Computer and Information

Abbr : JKSCI
2005, 10(3), pp.11-18
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science

Jaejin Kim ¹, Kwan Hyeong, Lee ²

¹강동대학교
²대진대학교

ABSTRACT

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing.Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by 62.2% than those of DDMAP. And reduced the number of CLBs by 17.6% than those of TEMPLA.
KEYWORDS

CPLD, Technology Mapping
REFERENCES (11)

[journal] / 1996 / Altera Corporation

[journal] / 1996 / Altera Corporation

[journal] / 1996 / Advanced Micro Devices

[journal] / 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 13 : 1~11

[journal] / “chortle-crf / Fast Technology Mapping for Lookup Table -Based FPGAs” / June 1991 : 227~233

[journal] / “Technology Mapping of Lookup Table-Based FPGAs for Performance” 1991 IEEE Conference on Computer Aided Design : 568~571

[journal] / 1992 / A system for sequential Circuit Synthesis“ Department of Electrical Engineering and Computer Science University of California

[journal] / 1998 / “Technology Mapping for Large Complex PLDs” : 698~703

[journal] / 1999 / “시간적 조건에서 실행 시간을 개선한 CPLD 기술 매핑 알고리즘 개발” 4(3) : 35~46

[journal] / 2001 / “A New Technology Mapping for CPLD under the time constraint” ASP-DAC : 235~238

[journal] / 2005 / 이관형. “상관관계에 의한 CLB구조의 CPLD 저전력 기술 매핑 알고리즘” 10(2) : 49~58
KCI Citation (6)

KJC Korea
Journal Central

Statistics

Tools