期刊文献+

PLBMAP:高性能通用FPGA可编程逻辑块映射算法 被引量:1

PLBMAP:A High Performance and Universal Programmable Logic Block Mapping Algorithm Based on FPGA
下载PDF
导出
摘要 研究了一种低复杂度、高利用率、高性能的通用FPGA逻辑块映射算法。基本思想包括为降低算法复杂度而提出的将组合电路与时序电路分开映射、对逻辑单元分层;引入匹配度系数以提高逻辑单元的利用率。从而在算法的性能和速度两方面均得到了较好的突破:平均性能比现存通用映射算法提高了12.59%,平均运行时间可以降低10^2~10^3倍。 In this paper, we developed a low complexity, high utilization, high performance and universal programmable logic block mapping algorithm based on FPGA. The basic ideas include dealing with the combinational logic and sequential logic in the circuit severally, delaminate the circuit, and import the matching degree to improve the utilization of logic blocks. As a result, this algorithm has a breakthrough both in performance and run time. The results show that this algorithm performance equals to the special logic block mapping algorithms and even better than them, the average performance is 12.59% better than universal mapping algorithm, and the run time is 10^2--10^3 less than it.
出处 《微电子学与计算机》 CSCD 北大核心 2008年第8期40-44,共5页 Microelectronics & Computer
基金 国家自然科学基金项目(60776023) 国家"八六三"计划项目(2005AA1Z12305-2)
关键词 现场可编程门阵列 可编程逻辑块映射 子图同构 匹配度 field programmable gate array programmable logic blocks rnapping subgraph isomorphism matching degree
  • 相关文献

参考文献8

  • 1李辉,王欣,戴蓓倩,陆伟.基于FPGA的实时基音周期估计系统[J].微电子学与计算机,2007,24(6):140-142. 被引量:2
  • 2黄谆,白国强,陈弘毅.大数模乘脉动阵列的FPGA细粒度映射实现[J].微电子学与计算机,2005,22(7):31-35. 被引量:2
  • 3Jason Cong, John Peck, Yuzheng Ding. RASP: a general logic synthesis system for SRAM- based FPGAs [ C]// Proc. ACM 4th Int'l Symp. On FPGA. Los Argeles: University of California, 1996.
  • 4倪刚,来金梅,童家榕.一种基于图模式匹配的逻辑单元映射算法[J].计算机辅助设计与图形学学报,2006,18(12):1850-1854. 被引量:4
  • 5Gabriel Valiente, Conrado Martinez. An algorithm for graph pattern - matching[C]//Proc. Fourth South American Workshop on String Processing, volume 8 of International Informatics Series. Ottana: Carleton University Press, 1997 : 180 - 197.
  • 6Yang S. Logic synthesis and optimization benchmarks user guide Version 3.0 [ R]. USA: Microelectronics Center of North Carolina, 1991.
  • 7Sentovich E M, Singh K J, Lavagno L, et al. SIS: a system for sequential circuit synthesis[R]. Berkeley: University of California, 1992.
  • 8Cong J, Ding Y. Flow - map: an optimal technology mapping algorithm for delay optimization in lookup - table based FPGA designs[J]. IEEE Trans, CAD, 1994, 13 (1):1-12.

二级参考文献34

  • 1吴卅建,李辉,戴蓓倩.基于DSP的口令式语音CDHMM的实时训练系统[J].微电子学与计算机,2005,22(2):128-131. 被引量:4
  • 2P Montgomery. Modular Multiplication Without Trial Division. Mathematics of Computation, 1985, 44(170): 519-521.
  • 3S Y Kung. VLSI Array Processors. Prentice Hall, 1988.
  • 4S Even. Systolic Modular Multiplication. Advances in Cryptology -CRYPT 90, l.ecture Notes in Computer Science,Spinger-Verlag, 1990, 537: 619-624.
  • 5C D Walter: Systolic Modular Multiplication. IEEE Transactions on Computers, 1993, 42(3): 376-378.
  • 6P Komerup. A Systolic, Linear-Arty Multiplier for a Class of Right-Shift Algorithms. IEEE Transactions on Computers, 1994, 43(8): 892-898.
  • 7K M Elleithy, M A Bayoumi. A Systolic Architecture for Modulo Multiplication. IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, 1995,42(11): 725-729.
  • 8Weixin Gai, Hongyi Chen. A Systolic l,inear Array for Modular Multiplication. Proceedings of the 2nd International Conference on ASIC, ASICON' 1996, 6: 171-174.
  • 9J.B Shin, J Kim, H Lec-Kwang. Optimisation of Montgomery Modular Multiplication Algorithm for Systolic Arrays. Electronics Letters, 1998, 34(19): 1830-1831.
  • 10W C Tsai, C B Shung, S J Wang. Two Systolic Architectures for Modular Multiplication. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2000, 8(1):103-107.

共引文献5

同被引文献7

  • 1倪刚,童家榕,来金梅.基于对可编程逻辑块建模的FPGA通用装箱算法[J].计算机工程,2007,33(6):239-241. 被引量:2
  • 2Betz V, Marquardt A, Rose J. Using Cluster-based Logic Blocks and Timing-driven Packing to Improve FPGA Speed and Density[C] //Proc. of ACM International Symposium on FPGA. Monterey, USA: [s. n.] , 1999.
  • 3Betz V. VPR and T-VPack User’s Manual[EB/OL]. [2011-05-15]. http://www.eecg.utoronto/vpr/.
  • 4Bozorgzadeh E, Ogrenci-Memik S, Sarrafzadeh M. RPack: Routa- bility-Driven Packing for Cluster-based FPGAs[C] //Proc. of ASP-DAC’01. Yokohama, Japan: [s. n.] , 2001.
  • 5Hassan H, Anis M, El Daher A, et al. Activity Packing in FPGAs for Leakage Power Reduction[C] //Proc. of DATE’05. Munich, Germany: [s. n.] , 2005.
  • 6Pandit A, Easwaran L, Akoglu A. Concurrent Timing Based and Routability Driven Depopulation Technique for FPGA Packing[C] //Proc. of ICECE’08. [S. l.] : IEEE Press, 2008.
  • 7徐嘉伟,来金梅,童家榕.可配置宏的快速FPGA布局算法[J].计算机工程,2009,35(16):228-230. 被引量:4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部